An Intuitive Framework for Real-Time Freeform Modeling
|
|
- Aldous Sharp
- 5 years ago
- Views:
Transcription
1 An Intuitive Framework for Real-Time Freeform Modeling Mario Botsc Leif Kobbelt Computer Grapics Group RWTH Aacen University Abstract We present a freeform modeling framework for unstructured triangle meses wic is based on constraint sape optimization. Te goal is to simplify te user interaction even for quite complex freeform or multiresolution modifications. Te user first sets various boundary constraints to define a custom tailored (abstract) basis function wic is adjusted to a given design task. Te actual modification is ten controlled by moving one single 9-dof manipulator object. Te tecnique can andle arbitrary support regions and piecewise boundary conditions wit smootness ranging continuously from C 0 to C 2. To more naturally adapt te modification to te sape of te support region, te deformed surface can be tuned to bend wit anisotropic stiffness. We are able to acieve real-time response in an interactive design session even for complex meses by precomputing a set of scalar-valued basis functions tat correspond to te degrees of freedom of te manipulator by wic te user controls te modification. CR Categories: I.3.5 [Computer Grapics]: Computational Geometry and Object Modeling Pysically based modeling; I.3.6 [Computer Grapics]: Metodology and Tecniques Interaction Tecniques Keywords: surface editing, freeform design, user interaction 1 Introduction Computer aided geometric design tecniques ave become an important key tecnology in te industrial design and development process. Te availability of digital 3D models during te various stages of te design process triggers a large number of applications ranging from numerical simulation and assembly planning to design studies and product presentation. Tis variety of applications implies tat tere are many different (and sometimes contradicting) requirements for ow tese 3D models ave to be accessed in an interactive design session. Especially in te earlier (conceptual) design stages, te major bottleneck is still te freeform design metapor wic sould allow te user to convey an imaginary sape to te computer system in an intuitive fasion. Te fundamental problem ere is tat te space of possible geometric sapes is extremely ig dimensional and as a very complex structure wit estetically pleasing sapes sometimes lying surprisingly close to unacceptable sapes. Te designer as to explore tis ric space of sapes by just pressing buttons or clicking and dragging 2D positions on te screen. More sopisticated interaction Permission to make digital or ard copies of part or all of tis work for personal or classroom use is granted witout fee provided tat copies are not made or distributed for profit or direct commercial advantage and tat copies sow tis notice on te first page or initial screen of a display along wit te full citation. Copyrigts for components of tis work owned by oters tan ACM must be onored. Abstracting wit credit is permitted. To copy oterwise, to republis, to post on servers, to redistribute to lists, or to use any component of tis work in oter works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY USA, fax +1 (212) , or permissions@acm.org ACM /04/ $5.00 tecnology like aptic input devices, immersive displays [Sckolne et al. 2001], or two-anded input metapors [Llamas et al. 2003] are available today but tey did not replace te well-establised PCbased working place as it can be found in every industrial design company. In an interactive design session, te user usually drags control vertices wic ave tree degrees of freedom (translation) or e moves more general manipulator objects aving six (translation and rotation) or nine (plus scaling) degrees of freedom. For complex sape modifications several control andles ave to be dragged sequentially or simultaneously. Tis rudimentary interface is te reason wy it takes igly skilled experts to operate a CAD system. Neverteless it is te widely accepted standard and implemented in many NURBS or subdivision based modeling frameworks. Let S be te given sape tat te designer wants to modify into anoter sape S and let us assume tat S and S do not differ too muc. Obviously, every extreme modification can be decomposed into a sequence of smaller modifications and tis is wat designers usually do even traditional designers working wit real clay, not just CAD designers. If we accept tat interactive design is about dragging manipulators and verifying te result by visual feedback ten any sape modification can be caracterized by S = S + B(δC) (1) were B represents an abstract basis function and δc someow represents te cange of position and orientation of te control andles. For a modeling tool based on NURBS surfaces, e.g., B could be te set of tensor-product basis functions and δc te displacement vectors by wic we sift te corresponding control vertices. A sape modification is complex if te update B(δC) is complex. Tis can be acieved by eiter providing a complicated andle object wit many degrees of freedom or by using special basis functions tat are adapted to te desired modification. Since our goal is to keep te user interaction simple, te possible types of modifications tat we can apply to te object S are ence limited by te abstract basis functions tat our system associates wit te control andles. In te case of NURBS or subdivision surfaces, tis means tat wit eac elementary modification we can add a smoot bump wit rectangular or polygonal support to te surface. Every more sopisticated modeling operation as to be built from tese elementary modifications. An important limitation wit most of te existing modeling frameworks is tat te underlying matematical surface representation is tigtly linked to te type and number of control andles. Tis problem is more tan obvious if our geometry representation is based on unstructured triangle meses since ere, sifting a (control) vertex just adds a tiny at function to te surface. In order to perform some non-trivial modification one as to manually move a larger number of control vertices simultaneously. In te setting of (1) tis would correspond to a igly complex δc, i.e. a igly complex user interaction. 630
2 Figure 1: In our modeling metapor, we define a custom tailored basis function by selecting a support region (blue) and a andle region (green). Te smootness conditions at te inner and outer boundary can be controlled independently and continuously blended between C 0 and C 2. From left to rigt we sow te initial configuration, C 2 at inner and outer boundary, C 0 at inner and C 2 at outer, as well as C 2 at inner and C 0 at outer boundary. Te blue, green and gray regions correspond to te sets of vertices p,, and f in equation (5), respectively. Tis is wy for polygon meses, control andle based modification metapors ave been developed wic are mostly independent from te underlying tessellation of te surface. Tis means we simplify te structure of C in (1) by making B sligtly more complicated. Freeform deformation [Sederberg and Parry 1986; Coquillart 1990; MacCracken and Joy 1996] is probably one of te most prominent examples were sifting a control vertex in a spatial grid causes a deformation of te embedding space around a 3D model and tereby induces a global modification on te model itself. Wile tis is a very intuitive modeling metapor, is does not provide significantly more degrees of freedom (bumps over simple support regions). Moreover, te support of te modification is sometimes difficult to predict as it is determined by intersecting a volumetric basis function s support wit te modified surface. Te purpose of tis sort paper is to describe anoter modeling metapor wic provides te maximum flexibility wit respect to te set of potential basis functions. Te idea is to elp te designer to define is own custom tailored basis function tat is optimally adapted to te intended modification. Ten tis basis function is associated wit a manipulator object tat te user can move interactively to do te actual sape editing operation in real-time. Our goal is to provide as many degrees of freedom as possible for te definition of te basis function B to offer enoug flexibility for non-trivial modifications. Yet, we always keep in mind tat te resulting sape modeling system sould be simple and intuitive enoug for an average (not specialized) user. Hence, after te definition of te boundary constraints, te user interaction is restricted to moving a single manipulator object C. Wile we are integrating various known geometry processing concepts into our freeform modeling framework, we also extend tese tecniques to meet te central requirements of our modeling system. Te two major innovations are tat we obtain flexible sape control by using an anisotropic discretization of te energy functional wic determines ow te surface bends under deformation and tat by precomputing a set of linear basis functions, we easily acieve real-time feedback even wen modifying large surface areas. 2 Te modeling metapor In Eq. (1) we represented an arbitrary freeform modification by an abstract basis function B wic is added to an existing sape S. In order to specify tis basis function for a particular modification we ave to define its support, i.e., te region of te surface S tat sould be affected by tis modification and its caracteristic sape. Flexibility wit respect to te support of B means tat we can select an arbitrary region, convex or non-convex wit smoot or nonsmoot boundary, and wic can be aligned to any feature on te surface. A simple way to let te user define tis region is by letting im draw directly on te surface eiter te outline of te region or te complete region (wit some painting tool). Te caracteristic sape of te basis function B is most intuitively defined by terms like smootness, stiffness, or fullness. Here, smootness is a property tat describes ow te deformed part of te surface connects wit te unmodified part, stiffness or tension describes ow te curvature is distributed (equally distributed vs. clustered near te constraints), and fullness rates te relation between eigt and volume of te basis function (pointed vs. blobby). To control stiffness and smootness, we let te user select eiter te interior of te support region or (a segment) of its boundary and ten provide a simple slider to increase or decrease te respective parameter. Even if te matematical meaning of tese terms migt not be obvious for te non-expert user, te visual feedback wen moving te slider still allows im to quickly set te corresponding scalar parameters according to is design intend. In order to map te control of te modification to a 9-dof manipulator object, te user selects anoter region, te andle region, in te interior of te support region (cf. Fig. 1, left). Te manipulator is ten rigidly attaced to tis surface patc and ence moving te manipulator moves te surface patc accordingly. Te remaining part of te surface, i.e., support region minus andle region is supposed to smootly bend according to te translation, rotation and scaling of te andle region. Te fullness of te basis function B can ence be controlled by te size and te sape of te andle region. Te modeling metapor as we described it so far, i.e. te definition of an abstract basis function B wic is ten controlled by a simple manipulator object, provides a flexible tool for freeform sape editing. We can easily integrate tis metapor into a multiresolution modeling framework in order to preserve te local detail information of an object wen applying a global modification. For tis we need a decomposition operator wic separates te ig-frequency detail from te low-frequency global sape. Te freeform modeling tecnique is ten applied to te low-frequency component and finally te detail information is added back to te modified surface by a reconstruction operator. Te multiresolution decomposition and reconstruction can be idden from te user suc tat e seems to interact wit te detailed surface wile te frequency of te modification is controlled by te size of te support region. 631
3 Figure 2: Te order k of te energy functional defines te stiffness of te surface in te support region and te maximum smootness C k 1 of te boundary conditions. From left to rigt: membrane surface (k = 1), tin-plate surface (k = 2), minimal curvature variation (k = 3). 3 Te matematical realization Te matematical tecniques tat we need in order to implement te design metapor described in te last section ave to be flexible enoug to allow for arbitrary support and caracteristics but tey also ave to be efficient enoug to give real-time responses wen te user moves te manipulator. Smoot deformation of a surface wit respect to boundary conditions is most elegantly modelled by an energy minimization principle [Moreton and Sequin 1992; Welc and Witkin 1992; Kobbelt et al. 1998; Du and Qin 2000]. Te surface is assumed to beave like a pysical skin wic stretces and bends as forces are acting on it. Matematically tis beavior can be captured by an energy functional wic penalizes stretc or bending. Ten te optimal surface is te one tat minimizes tis energy wile satisfying all te prescribed boundary conditions. Te advantage of tis formulation is tat it allows us to take arbitrary boundary conditions into account and te optimal solution is known to ave certain smootness properties. Wen canging te boundary conditions, te optimal surface canges accordingly and tis is wy we call tis approac boundary constraint modeling (BCM). An alternative approac wic mimics boundary constraint modeling is to compute a blending function tat propagates te constraints into te interior of te support region [Sing and Fiume 1998; Bendels and Klein 2003; Pauly et al. 2003]. Wile tese metods are extremely efficient, tey usually do not provide te full generality since tey often assume a certain topology or sape of te support region. Linear system derivation For efficiency reasons te energy functionals tat are used most often are quadratic functionals wit te generic form [Kobbelt 1997] E k (S) = F k (S u...u,s u...uv,...,s v...v ) (2) were te expressions S stand for te partial derivatives of order k wit respect to a surface parametrization S : Ω IR 3 wic is locally as close as possible to isometric. In order to actually compute te solution to te above optimization problem one usually applies variational calculus to derive te corresponding Euler-Lagrange equation wic caracterizes te minimizers of (2). For te most common quadratic energy functionals, te resulting linear differential equation as te form k S(x) = 0, j S(x) = b j (x), x Ω \ δω x δω, j < k (3) were is te Laplace operator and te boundary constraints b j of order j < k on δω imply a non-trivial solution. For k = 1 tis equation caracterizes membrane surfaces wic minimize surface area, for k = 2 it caracterizes tin plate surfaces wic minimize surface bending and for k = 3 we obtain surfaces tat minimize te variation of linearized curvature (cf. Fig. 2). Higer order equations are usually not recommended because of numerical instabilities. Te types of boundary conditions tat we can impose on (3) can be up to C k 1. Hence for k 2 we can coose between inged boundaries (C 0, j = 0) and clamped boundaries (C 1, j = 1). Moreover we can continuously blend boundary conditions between C 0 and C k 1 wit a smootness parameter c(p) [0,k 1] for constrained boundary vertices p by modifying te recursive definition of te iger order Laplacian from [Kobbelt et al. 1998] to be ( ) k (p) := λ k (p) := λ k 1 (p) k 1 (p) 1, c(p) > k c(p) k, k 1 c k 0, c(p) < k 1 Since we want to use a triangle mes as te underlying surface representation, we ave to discretize te Laplace operator [Desbrun et al. 1999; Meyer et al. 2003] by (p i ) := 2 ( )( ) A(p i ) cotαi j + cotβ i j p j p i, (4) p j N(p i ) were α i j = (p i, p j 1, p j ) and β i j = (p i, p j+1, p j ) for a vertex p i and its one-ring neigbors p j and A(p i ) denotes te Voronoi area around te vertex p i. By tis (3) becomes a sparse linear system k 0 I F+H p f = 0 f., (5) were p = (p 1,..., p P ) is te vector of free vertices in te interior of te support region, f = ( f 1,..., f F ) are te fixed vertices outside te support region and = ( 1,..., H ) are te vertices inside te andle region. Tese sets of vertices correspond to te blue, gray and green surface regions sown in Fig. 1, respectively. Since f and are fixed, tey impose te boundary conditions on te system. Notice tat only k + 1 rings of fixed vertices are used to prescribe C k boundary constraints. For te sake of simplicity we combined te optimality conditions and te boundary conditions into one equation. In te following we refer to te matrix in (5) as L. Wen te user moves te andle region, te vertices in cange teir position and provide a new rigt and side for te linear system. By solving (5) again we ence compute te vertex positions in p as a linear function of. 632
4 Anisotropic bending If we use te standard discretization (4) of te Laplace operator ten te resulting optimal surface bends isotropically even if te support region is anisotropic. Since te sape of te andle and support regions are considered as design parameters wen defining te basis function for a particular modification, we would rater like te resulting surface to better adapt its bending beavior to te boundary conditions. As sown in Fig. 3 te basis function looks more natural if te impact of te andle region is propagated troug te support region in suc a way tat its iso-contours it te outer boundary everywere wit approximately te same slope. Tis can be acieved by discretizing te Laplace operator (4) not wit respect to te mes itself (Laplace-Beltrami) but rater wit respect to a special parametrization tat factors out te anisotropy. First we compute a conformal parametrization for te support region [Lévy et al. 2002; Ray and Levy 2003]. Tis yields a planar triangulation wit te same connectivity as te support region. Ten we apply a principal axis transform and scale tis planar triangulation along its principal axes suc tat its diameter is approximately te same in eac direction. On tis scaled triangulation we finally compute te weigts for te Laplace operator tat we ten use in (5). Fig. 3 sows te effect of minimizing tis anisotropic energy functional. During interactive sape editing we are using a 9-dof manipulator wic provides an intuitive interface to control an affine map T tat is applied to te andle region. If we pick four affinely independent vertices a, b, c, and d from te andle region ten tese define an affine frame and tere exists a matrix Q IR H 4 of affine combinations suc tat = Q [a,b,c,d] T. Due to affine invariance, applying an affine map T (controlled by te manipulator) to te andle vertices, is ten equivalent to applying T to te affine frame, i.e. T (Q[a,b,c,d] T ) = Q T ([a,b,c,d] T ). As a consequence we can rewrite te non-constant term in (6) as p f + L [a,b,c,d] T. 0 Q Tis owever means tat we only ave to solve te system (5) in a pre-processing step for 7 different rigt and sides: te tree columns of [0,f,0] T and te four columns of [0,0,Q] T. Te latter allows us to precompute te basis function matrix B = L 1 [0,0,Q] T. Ten for every frame we simply apply te manipulator transformation to te four andle points a, b, c, and d and add te current displacement vectors B[a,b,c,d] T to te constant part in (6). 4 Results Figure 3: Isotropic (left) and anisotropic basis functions (rigt) wit te corresponding parameter domains over wic te Laplace operator is discretized. Precomputed basis functions Te tecnique as we described it so far requires to solve a linear system for te free vertex positions wenever te manipulator (and ence te andle region) moves. Altoug we can use a igly efficient multi-grid solver for tis task we still do not acieve a sufficiently ig frame rate, especially wen minimum curvature variation surfaces (k = 3) are computed and te number of vertices in te support region is on te order of 10 4 or iger. By precomputing a special set of basis functions tat directly correspond to te degrees of freedom of te manipulator, we can significantly reduce te per-frame computing costs. Since te solution of (5) can be expressed explicitly in terms of te inverse matrix L 1, tis set of basis functions is represented by (a combination of) column vectors of L 1. A similar tecnique was used in te pysically-based modeling system ArtDefo [James and Pai 1999], were also a set of column vectors of an inverse matrix is precomputed in order to speed up te surface updating. First we observe tat te explicit solution of (5) is p f + L (6) wit te first term on te rigt and side being constant and te second term depending on te vertices in te andle region. We integrated our freeform modeling metapor into a multiresolution mes editing framework like te one described in [Kobbelt et al. 1998]. Te decomposition and editing operators are bot based on BCM and te representation of ig-frequency detail is implemented in terms of normal displacement vectors [Kobbelt et al. 1999]. A real world example is sown in Fig. 5, were te sillboard of a car is to be lowered. Exploiting te flexibility provided by continuous boundary smootness avoids te generation of an unwanted point of inflection along te feature line and te anisotropic Laplace discretization propagates te displacement naturally over te support region. Features are preserved due to multiresolution decomposition and reconstruction (idden from te user). Notice tat multiple independent andle regions eac controlled by teir own manipulator object are no problem for te setup described Figure 4: Example of a non-disc saped modification using multiple andles. Te left cap (green) is defined as a andle component tat is not to be moved. Te actual modification is done by defining additional andle components as rings (green). 633
5 Figure 5: Multiresolution modification of te sillboard using flexible boundary conditions and anisotropic Laplacian: An unwanted point of inflection (center left) is avoided by reducing te smootness constraint near te andle region to C 0 continuity. Switcing from te isotropic discretization of te Laplace operator (center rigt) to te anisotropic one finally leads to te intended natural displacement propagation. in tis paper. All we ave to do is to split into several components and precompute te corresponding four basis functions for eac of tem. By tis it is even possible to generate modifications wit a support region tat is not topologically equivalent to a disk. We simply exclude some regions from te deformable area by labelling tem as special andle regions tat cannot be moved (cf. Fig. 4). More complex support regions can be used if we restrict to te isotropic Laplacian because tis avoids te parametrization step (cf. Sect. 3). Te last example sows a complex modification of a car s ood (cf. Fig. 6, 250k triangles). Here we use multiple andle regions placed at te weel ouses and te grill, enabling us to stretc te ood wile keeping te weel ouses circular. Te support region of tis modification contains 35k vertices, te complete precomputation (multigrid ierarcy, basis functions, multiresolution ierarcy) took less tan 15s. Te actual surface editing can be done wit 12 fps, were only 25ms are required to compute te BCM surface and te remaining time is used for detail reconstruction and rendering. In an industrial evaluation te presented modeling system proved to be bot sufficiently flexible as well as very intuitive, enabling also te non-experts to perform teir desired sape modifications. Due to te precomputed basis functions, deformations even on complex models could be performed in real-time. Figure 6: Stretcing te ood using multiple independent andle components. Notice tat rigidly preserving te circular sape of te weel ouses would be very difficult using a volumetric deformation tool like freeform deformation. References BENDELS, G. H., AND KLEIN, R Mes forging: editing of 3D-meses using implicitly defined occluders. In Proceedings of te Eurograpics/ACM SIGGRAPH symposium on Geometry processing, Eurograpics Association, COQUILLART, S Extended free-form deformation: a sculpturing tool for 3D geometric modeling. In Computer Grapics (Proceedings of ACM SIGGRAPH 90), ACM, DESBRUN, M., MEYER, M., SCHRÖDER, P., AND BARR, A. H Implicit fairing of irregular meses using diffusion and curvature flow. In Proceedings of ACM SIGGRAPH 99, ACM Press/ACM SIGGRAPH, DU, H., AND QIN, H Direct manipulation and interactive sculpting of pde surfaces. In Proceedings of Eurograpics 00, JAMES, D. L., AND PAI, D. K ArtDefo: accurate real time deformable objects. In Proceedings of ACM SIGGRAPH 99, ACM Press/ACM SIGGRAPH, KOBBELT, L., CAMPAGNA, S., VORSATZ, J., AND SEIDEL, H.-P Interactive multi-resolution modeling on arbitrary meses. In Proceedings of ACM SIG- GRAPH 98, ACM Press/ACM SIGGRAPH, KOBBELT, L., VORSATZ, J., AND SEIDEL, H.-P Multiresolution ierarcies on unstructured triangle meses. Computational Geometry: Teory and Applications 14. KOBBELT, L Discrete Fairing. In Proceedings on 7t IMA Conference on te Matematics of Surfaces, LÉVY, B., PETITJEAN, S., RAY, N., AND MAILLOT, J Least squares conformal maps for automatic texture atlas generation. ACM Transactions on Grapics 21, 3, LLAMAS, I., KIM, B., GARGUS, J., ROSSIGNAC, J., AND SHAW, C. D Twister: a space-warp operator for te two-anded editing of 3D sapes. ACM Transactions on Grapics 22, 3, MACCRACKEN, R., AND JOY, K. I Free-form deformations wit lattices of arbitrary topology. In Proceedings of ACM SIGGRAPH 95, ACM Press/ACM SIGGRAPH, MEYER, M., DESBRUN, M., SCHRÖDER, P., AND BARR, A. H Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Matematics III, H.-C. Hege and K. Poltier, Eds. Springer-Verlag, Heidelberg, MORETON, H., AND SEQUIN, C Functional optimization for fair surface design. In Computer Grapics (Proceedings of ACM SIGGRAPH 92), PAULY, M., KEISER, R., KOBBELT, L. P., AND GROSS, M Sape modeling wit point-sampled geometry. ACM Transactions on Grapics 22, 3, RAY, N., AND LEVY, B Hierarcical Least Squares Conformal Map. In Proceedings of Pacific Grapics 03, SCHKOLNE, S., PRUETT, M., AND SCHRÖDER, P Surface drawing: creating organic 3D sapes wit te and and tangible tools. In Proceedings of te SIGCHI conference on Human factors in computing systems, ACM Press, SEDERBERG, T. W., AND PARRY, S. R Free-form deformation of solid geometric models. In Computer Grapics (Proceedings of ACM SIGGRAPH 86), SINGH, K., AND FIUME, E Wires: A geometric deformation tecnique. In Proceedings of ACM SIGGRAPH 98, ACM Press/ACM SIGGRAPH, WELCH, W., AND WITKIN, A Variational surface modeling. In Computer Grapics (Proceedings of ACM SIGGRAPH 92),
An Intuitive Framework for Real-Time Freeform Modeling
An Intuitive Framework for Real-Time Freeform Modeling Leif Kobbelt Shape Deformation Complex shapes Complex deformations User Interaction Very limited user interface 2D screen & mouse Intuitive metaphor
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationMixed Finite Elements for Variational Surface Modeling
Eurograpics Symposium on Geometry Processing 200 Olga Sorkine and Bruno Lévy (Guest Editors) Volume 29 (200), Number 5 Mixed Finite Elements for Variational Surface Modeling Alec Jacobson, Elif Tosun,2,
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More informationZernike vs. Zonal Matrix Iterative Wavefront Reconstructor. Sophia I. Panagopoulou, PhD. University of Crete Medical School Dept.
Zernie vs. Zonal Matrix terative Wavefront Reconstructor opia. Panagopoulou PD University of Crete Medical cool Dept. of Optalmology Daniel R. Neal PD Wavefront ciences nc. 480 Central.E. Albuquerque NM
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationGeometric Modeling and Processing
Geometric Modeling and Processing Tutorial of 3DIM&PVT 2011 (Hangzhou, China) May 16, 2011 6. Mesh Simplification Problems High resolution meshes becoming increasingly available 3D active scanners Computer
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationReal-Time Shape Editing using Radial Basis Functions
Real-Time Shape Editing using Radial Basis Functions, Leif Kobbelt RWTH Aachen Boundary Constraint Modeling Prescribe irregular constraints Vertex positions Constrained energy minimization Optimal fairness
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationImage Registration via Particle Movement
Image Registration via Particle Movement Zao Yi and Justin Wan Abstract Toug fluid model offers a good approac to nonrigid registration wit large deformations, it suffers from te blurring artifacts introduced
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationClassification of Osteoporosis using Fractal Texture Features
Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationGrid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid Flows
Journal of Computational Pysics 176, 40 69 (2002) doi:10.1006/jcp.2001.6967, available online at ttp://www.idealibrary.com on Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid
More informationA VOLUME-BASED METHOD FOR DENOISING ON CURVED SURFACES
A VOLUME-BASED METHOD FOR DENOISING ON CURVED SURFACES Harry Biddle Double Negative Visual Effects London, UK b@dneg.com Ingrid von Glen, Colin B. Macdonald, Tomas März Matematical Institute University
More informationComputer Physics Communications. Multi-GPU acceleration of direct pore-scale modeling of fluid flow in natural porous media
Computer Pysics Communications 183 (2012) 1890 1898 Contents lists available at SciVerse ScienceDirect Computer Pysics Communications ournal omepage: www.elsevier.com/locate/cpc Multi-GPU acceleration
More informationNon-Interferometric Testing
NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault
More informationNumerical Simulation of Two-Phase Free Surface Flows
Arc. Comput. Met. Engng. Vol. 12, 2, 165-224 (2005) Arcives of Computational Metods in Engineering State of te art reviews Numerical Simulation of Two-Pase Free Surface Flows Alexandre Caboussat Department
More informationNetwork Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks
Downloaded from vbn.aau.dk on: April 7, 09 Aalborg Universitet etwork Coding to Enance Standard Routing Protocols in Wireless Mes etworks Palevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank;
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationICES REPORT Isogeometric Analysis of Boundary Integral Equations
ICES REPORT 5-2 April 205 Isogeometric Analysis of Boundary Integral Equations by Mattias Taus, Gregory J. Rodin and Tomas J. R. Huges Te Institute for Computational Engineering and Sciences Te University
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationDeformation Transfer for Detail-Preserving Surface Editing
Deformation Transfer for Detail-Preserving Surface Editing Mario Botsch Robert W Sumner 2 Mark Pauly 2 Markus Gross Computer Graphics Laboratory, ETH Zurich 2 Applied Geometry Group, ETH Zurich Abstract
More informationH-Adaptive Multiscale Schemes for the Compressible Navier-Stokes Equations Polyhedral Discretization, Data Compression and Mesh Generation
H-Adaptive Multiscale Scemes for te Compressible Navier-Stokes Equations Polyedral Discretization, Data Compression and Mes Generation F. Bramkamp 1, B. Gottsclic-Müller 2, M. Hesse 1, P. Lamby 2, S. Müller
More information2D transformations Homogeneous coordinates. Uses of Transformations
2D transformations omogeneous coordinates Uses of Transformations Modeling: position and resize parts of a complex model; Viewing: define and position te virtual camera Animation: define ow objects move/cange
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
More informationMeasuring Length 11and Area
Measuring Lengt 11and Area 11.1 Areas of Triangles and Parallelograms 11.2 Areas of Trapezoids, Romuses, and Kites 11.3 Perimeter and Area of Similar Figures 11.4 Circumference and Arc Lengt 11.5 Areas
More informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More information12 - Spatial And Skeletal Deformations. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo
12 - Spatial And Skeletal Deformations Space Deformations Space Deformation Displacement function defined on the ambient space Evaluate the function on the points of the shape embedded in the space Twist
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationA Global Laplacian Smoothing Approach with Feature Preservation
A Global Laplacian Smoothing Approach with Feature Preservation hongping Ji Ligang Liu Guojin Wang Department of Mathematics State Key Lab of CAD&CG hejiang University Hangzhou, 310027 P.R. China jzpboy@yahoo.com.cn,
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationHaptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages Daniela Constantinescu and Septimiu E Salcudean Electrical & Computer Engineering Department University of Britis
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationIntroduction to Computer Graphics 5. Clipping
Introduction to Computer Grapics 5. Clipping I-Cen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,
More informationMean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.
Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department
More informationAnimating Lava Flows
Animating Lava Flows Dan Stora Pierre-Olivier Agliati Marie-Paule Cani Fabrice Neyret Jean-Dominique Gascuel imagis y -GRAVIR / IMAG BP 53, F-38041 Grenoble cedex 09, France Marie-Paule.Cani@imag.fr Abstract
More informationShape Modeling and Geometry Processing
252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry
More informationAreas of Triangles and Parallelograms. Bases of a parallelogram. Height of a parallelogram THEOREM 11.3: AREA OF A TRIANGLE. a and its corresponding.
11.1 Areas of Triangles and Parallelograms Goal p Find areas of triangles and parallelograms. Your Notes VOCABULARY Bases of a parallelogram Heigt of a parallelogram POSTULATE 4: AREA OF A SQUARE POSTULATE
More informationTruncated Newton-based multigrid algorithm for centroidal Voronoi diagram calculation
NUMERICAL MATHEMATICS: Teory, Metods and Applications Numer. Mat. Teor. Met. Appl., Vol. xx, No. x, pp. 1-18 (200x) Truncated Newton-based multigrid algoritm for centroidal Voronoi diagram calculation
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More information( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.
Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.
More information3D data segmentation using a non-parametric density estimation approach
Eurograpics Italian Capter Conference (6) G. Gallo and S. Battiato and F. Stanco (Editors) 3D data segmentation using a non-parametric density estimation approac U. Castellani, M. Cristani, V. Murino Dipartimento
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationTilings of rectangles with T-tetrominoes
Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More informationCSE 554 Lecture 7: Deformation II
CSE 554 Lecture 7: Deformation II Fall 2011 CSE554 Deformation II Slide 1 Review Rigid-body alignment Non-rigid deformation Intrinsic methods: deforming the boundary points An optimization problem Minimize
More informationTHIS paper presents the recent advances in mesh deformation
1 On Linear Variational Surface Deformation Methods Mario Botsch Computer Graphics Laboratory ETH Zurich Olga Sorkine Computer Graphics Group TU Berlin Abstract This survey reviews the recent advances
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationDistributed and Optimal Rate Allocation in Application-Layer Multicast
Distributed and Optimal Rate Allocation in Application-Layer Multicast Jinyao Yan, Martin May, Bernard Plattner, Wolfgang Mülbauer Computer Engineering and Networks Laboratory, ETH Zuric, CH-8092, Switzerland
More informationWhen a BST becomes badly unbalanced, the search behavior can degenerate to that of a sorted linked list, O(N).
Balanced Binary Trees Binary searc trees provide O(log N) searc times provided tat te nodes are distributed in a reasonably balanced manner. Unfortunately, tat is not always te case and performing a sequence
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More informationFeature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganographic Schemes
Feature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganograpic Scemes Jessica Fridric Dept. of Electrical Engineering, SUNY Bingamton, Bingamton, NY 3902-6000, USA fridric@bingamton.edu
More informationLarge Mesh Deformation Using the Volumetric Graph Laplacian
Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Xinguo Liu1 Hujun Bao2 Baining Guo1 Heung-Yeung Shum1 1 Microsoft Research Asia 2 Zhejiang University 3 Microsoft
More informationCRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS
27 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES CRASHWORTHINESS ASSESSMENT IN AIRCRAFT DITCHING INCIDENTS C. Candra*, T. Y. Wong* and J. Bayandor** * Te Sir Lawrence Wackett Aerospace Centre
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More information