Stretch-based Tetrahedral Mesh Manipulation
|
|
- Ezra Nichols
- 7 years ago
- Views:
Transcription
1 Stretch-based Tetrahedral Mesh Manipulation Wenhao Song Computer Graphics Department Max-Planck-Institut Informatik Saarbrücken, Germany Ligang Liu Department of Mathematics State Key Lab of CAD&CG Zhejiang University, China Figure 1: Examples of free form deformation (FFD). The object is embedded in the blue tetrahedral grids (leftmost) and is deformed by manipulating the tetrahedral grids. ABSTRACT We present a novel least scaling distortion metric to measure the deformation distortion for tetrahedral meshes. The stretch-like metric is a combination of Jacobian matrix norm and tetrahedron volume and has the properties of good shape preservation and rotation invariance. Based on our metric, we propose a uniform non-linear optimization solution to a variety of tetrahedral mesh manipulation applications including shape deformation, interpolation, deformation transfer, and deformation learning. Our approach can produce volume preserving and flip free tetrahedral mesh results, which performs much better than the previous tetrahedral manipulation approaches. We also demonstrate an efficient and practical application using free-form deformation technique. The object is embedded in a rough control tetrahedral mesh and deformed by editing the tetrahedral mesh with various constraints. Each vertex of the object can be obtained by its barycentric coordinates according to its embedding tetrahedron of the control tetrahedral mesh. CR Categories: J.6 [Computer-Aided Engineering]: Computeraided design Shape manipulation; Keywords: tetrahedral mesh, shape manipulation, volume distortion metric, free-form deformation 1 INTRODUCTION Shape manipulation plays a central role in computer modelling and animation. Good manipulation tools must be intuitive, easy to use, and robust. Most importantly, they should provide physically plausible and natural looking resultant models. As it is quite difficult to quantify the natural look of manipulated models, it is generally believed that the models should preserve as much as possible their local and global shape properties, e.g., volumes, distances, angles, etc, with minimal distortion. In some engineering applications like manipulating volumetric data, it is required to deform the shape while preserving its volume. In order to preserve shape volume, it is generally necessary to tetrahedralize the domain [9, 14]. And tetrahedral meshes are needed in some applications using finite element method [6, 2]. On the other hand, classical approaches for deforming tetrahedral mesh employ physical-based simulation such as mass spring model [16] which is linear but can not preserve the tetrahedron quality. The quality of the deformation should be measured by some geometric stretch. However, the geometric stretch for tetrahedral meshes has not well studied in the literature. Geometric stretch has been used for surface parameterization and texturing mapping community [19]. But the volume stretch metric generalized from 2D stretch metric is nonlinear and extremely difficult to be solved. In this paper, we propose a novel metric, called least scaling distortion (LSD) metric, to approximate the geometric stretch metric. The LSD metric is rotation invariant, but is dependent on scaling, which can preserve the volume constraints. Based on the new metric, we present a framework for manipulating the tetrahedral meshes including shape editing, shape interpolation, deformation transfer, and deformation learning. Furthermore, the shape manipulation can be performed in a fast way based on free-form deformation technique. The object is first embedded into a sparse control tetrahedral mesh. Then the object can be deformed by editing the control tetrahedral mesh using our approach. Our main contribution is a unified framework of tetrahedral mesh manipulation with least distortion. An efficient solver is proved to be available for solving the nonlinear optimization problem. Furthermore, all the solutions can be applied to triangular meshes, as we can measure the distortion of the deformation gradient as in [24, 25]. 2 RELATED WORK Free form deformation (FFD) is an important technique in shape modeling. Various FFD techniques have been proposed during the past two decades [20, 5]. Energy minimization based approaches [26] and multiresolution editing approaches [12] are also popular
2 for shape deformation. Mesh editing systems based on differential coordinates have been proposed recently [23, 27]. Some approach guides rotation deformation by harmonic scalar fields [28] or by encoding higher derivatives [15]. Some of the above approaches cannot handle large deformation while the others cannot handle distortion caused by large movements of handles. Only a few papers study the deformation of tetrahedral meshes in the literature. Volumetric constraints by sampling points inside the triangular mesh and simulating the volumetric graph Laplacian was introduced in [30]. But this approach failed to keep the tetrahedron quality and to avoid tetrahedron flips. Huang et al. use the mean value coordinate to deform the shape and introduce nonlinear hard constraints to preserve shape volume [9]. Recently, Lipman et al. [14] proposed an approach for triangular mesh deformation that can preserve local volume but tends to generate shrinkage near the bent or twisted part. To improve the quality of the tetrahedron, the approach of [8] optimize the mesh connectivity by flipping edges and faces of the tetrahedra in an iterative way. Other approaches use various distortion metrics to optimize the tetrahedral meshes [4, 7, 11, 17]. The work of [11, 17] adopt the Jacobian matrix norm, which measures the shape variation between two tetrahedra, in the distortion metric. It is still a challenge to find more efficient geometric metric for tetrahedra shape manipulation. 3 TETRAHEDRON SHAPE METRICS A tetrahedral mesh M consists of a finite set of vertices and tetrahedron elements. Throughout the paper M denotes either the set of vertices or the set of tetrahedron elements if there is no ambiguity in the context. 3.1 Jacobian matrix norm Each tetrahedron element e is defined by four vertices [v 1,v 2,v 3,v 4 ]. We define the incidence matrix A R 3 3 of e as: A(e) := [v 2 v 1,v 3 v 1,v 4 v 1 ]. That is, the incidence matrix is obtained by computing the edges of the element emanating from the first vertex in the coordinate list and concatenating them into a square matrix. The volume of the tetrahedron e is related to the determinant of A(e), which can be positive or negative depending on the labeling of the vertices. We assume throughout that all the vertices are labeled according to the right-hand rule so that the determinants of all the incidence matrices are positive for a tetrahedral mesh. A linear map f : e ē can be determined for two given tetrahedron elements e and ē with nonzero volumes. The map f has the Jacobian matrix J = A(ē)A 1 (e). This linear transformation f measures the deviation of the element ē from the element e. If two tetrahedron elements e and ē have the same shape, i.e., their edges are proportional, then for some σ > 0. A(ē) = σa(e), A(ē)A 1 (e) 2 = 3σ 2, F ( ) det A(ē)A 1 (e) = σ 3, 3.2 Volume stretch metrics The volume stretch metric is defined as the following [31]: L 2 (J) := 1 λ1 2 J F = + λ λ 3 2, (1) 3 3 where J F = tr (J T J) is the Frobenius norm, λ 1,λ 2,λ 3 are the singular values of J. This stretch was used as the texture stretch metric in its 2D form in [19, 22, 29]. It is easy to see that the volume stretch metric is invariant to the rotation of the tetrahedron but depends on the scaling of the tetrahedron. The inverse mean ratio metric was introduced by [11] as L i (J) := L 2(J) [det(j)] 2/3. However, both volume stretch metrics can not preserve the shape volume when used in deforming the tetrahedral mesh. 3.3 Least scaling distortion metric To preserve the shape volume as much as possible, we introduce a novel volume metric for tetrahedral manipulation. The volume of a tetrahedron is σ = [det(j)] 1/3. Inspired by the work of [17], we look for a metric with the form of L a,b := 1 2 ( L 2 σ + L a 2 ) where σ b 0 b < a 3 according to the positive Hessian matrix requirement. The parameters a and b should satisfy a + b = 4 if we set the volume ratio contract to one in the metric L a,b. Thus, we propose a novel volume metric, called least scaling distortion (LSD) metric, as following: L s (J) := L 2(J) 2det(J) + L 2(J) 2[det(J)] 1/3, by setting a = 3 and b = 1. When the tetrahedron element and its deformed tetrahedron element with nonzero volume have the same shape, i.e., A(ē) = σa(e),σ > 0, then L s (J) = 2 1 ( 1 σ + σ), which reaches its minimum at σ = 1. That means the LSD metric depends on the volume ratio. The volume of the tetrahedral mesh will be kept as much as possible during the manipulation. The range of the LSD metric is between two and infinity, where a value greater than two means that the tetrahedron element and its deformed tetrahedron element have different shapes. Therefore, the LSD metric for tetrahedral elements is invariant to translating and rotating the input values, but related to scaling. 4 LEAST DISTORTION OPTIMIZATION PROBLEM 4.1 Optimization problem Suppose the tetrahedral mesh M x is deformed into another mesh M y by the mapping function F : M x M y. Each tetrahedron element e T x is deformed into the corresponding element ē T y using the linear map with the Jacobian matrix J e = A(ē)A 1 (e). Some vertices on M y are usually fixed or constrained in space, while the other vertices are unrestricted. The optimization problem to minimize the average squared LSD metric over the entire mesh is then minl s (F) = 1 M y M x L s (Je 1 ) e, (2) e M x s.t. det(j e ) > 0, e M x, (3) v i = v i, i C, (4)
3 where e denotes the volume of the tetrahedron element e, M x = e Mx e is the volume of mesh M x, v i denotes the fixed vertices, and C is the index set of the fix vertex constraints during the mesh manipulation. This objective function in Eq. 2 minimizes the volume distortion of the whole tetrahedral mesh. As a consistent orientation for all the tetrahedron elements is required during the manipulation, adding the volume constraints in Eq. 3, i.e., the strict inequalities in the optimization problem, ensures a consistent orientation in the result tetrahedral mesh. Thus the tetrahedron elements will not flip during the manipulation. A similar optimization problem was also constructed for optimizing triangular and tetrahedral meshes using the inverse mean ratio metric in [17]. But the inverse mean ratio metric is dimensionless and scale invariant, which makes it unable to process mesh manipulation. 4.2 Unconstrained minimization problem The consistent orientation constraints in Eq. 3 are problematic because they involve a strict inequality. As the tetrahedral mesh is connected, it can be seen from the optimization problem in Eq. 2 that the objective function L s (F) approaches infinity if the volume of one tetrahedron element converges to zero [17]. In order for the objective function to be bounded away from infinity, all of the individual tetrahedron element functions must be bounded away from infinity. Therefore, the consistent orientation constraints can be dropped from the optimization problem as: min M y L s (F), (5) s.t. v i = v i, i C. In this case, the objective function is defined to have a value of + whenever the volume of at least one tetrahedron element is nonpositive. With this reformulation, we must provide a starting point where the orientation constraints are satisfied. 4.3 Numerical solution We now formulate the mesh manipulation as an optimization problem associated with the objective function in Eq. 5. Once the constrained vertices are fixed and removed, we have an unconstrained optimization problem with an objective function that is twice continuously differentiable on an open set. The characteristics of the objective function demand different solution techniques, and we briefly describe the method used in our system. We utilize a fast algorithm presented in [17] where a similar objective function was minimized using an inexact Newton method [10] with an Armijo line search method [3]. Denote S the objective function after removing the fixed vertices from L s (F) in Eq. 5. Given x k, a direction d k can be obtained from the symmetric linear system: 2 S(x k )d k = S(x k ), by using a conjugate gradient method with a block Jacobian preconditioner [18]. If S(x k ) T d k ρ d k 2, 2 for a positive constant ρ > 0, then, S(x k ) is used as the steepest descent direction. Using the Armijo line search method [3], a smallest nonnegative integer m is determined by satisfying S(x k + β m d k ) S(x k ) + µβ m S(x k ) T d k, where 0 < µ < 1 2 and 0 < β < 1 are constants. Therefore, the new position is iteratively updated by x k+1 = x k + β m d k. The algorithm terminates when S(x k ) 2 < Note that during the iteration, if the volume of one tetrahedron element is smaller than a given tolerance ε = 10 14, we consider the consistent orientation conditions to be violated, and the objective function is set to + in the line search. 5 TETRAHEDRAL MESH MANIPULATION We illustrate our technique for tetrahedral mesh manipulation in this section. Different tetrahedral mesh models are used in our tests as shown in Fig. 2. (a) (c) Figure 2: Tetrahedral meshes used in our paper shown in cut views. (a) Bar; (b) dragon; (c) bunny; (d) gear. 5.1 Mesh deformation An editing interface like in Laplacian mesh editing [23] is used to manipulate a tetrahedral mesh in our system. The user first selects some vertices on the surface of the mesh as fixed anchors and defines the region of interest (ROI) for editing. Then, the user manipulates the handle that can either be one vertex or a group of vertices inside the ROI, and the tetrahedral mesh is reconstructed with respect to the relocation of the handle. The fixed anchors and the user handle are regarded as the constraints in the minimization problem in Eq. 5. The other vertices of the deformed tetrahedral mesh are solved by the optimization process. Fig. 3 shows various results of manipulating a bar tetrahedral mesh. The top row shows the editing results using the inverse mean ratio (IMR) metric [17]. The bottom row is the editing results using the LSD metric proposed in our paper. The original bar mesh with the fixed vertices in blue and the handle vertices in red are shown in (a). The user manipulates the handle vertices to elongate (b), squash (c), bend (d), or twist (e) the mesh respectively. It is easily seen that (b) (d)
4 Using the inverse mean ratio (IMR) metric Figure 5: Isotropic (Top row) and anisotropic (Bottom row) scaling the bunny mesh locally. (a) Using our least scaling distortion (LSD) metric (b) (c) Figure 3: Examples of manipulating a bar tetrahedral mesh. our approach has achieved much better results which are very nice and physically plausible even for large deformation manipulations. Fig. 4 shows various results of manipulating a gear tetrahedral mesh. We see that our deformation approach can preserve the sharp features of the shape. (d) (e) assume that M 0 and M 1 are compatible and each corresponding tetrahedron pair (s 0,s 1 ),s 0 T 0,s 1 T 1, has a consistent orientation, i.e., det(a(s 0 )A(s 1 )) > 0. Compatible tetrahedral meshes can be obtained by remeshing techniques [13, 1]. Alexa et al. proposed an as-rigid-as-possible morphing technique that blends the tetrahedral meshes by interpolating each individual transformation between each pair of tetrahedron [1]. But this method can not avoid the tetrahedra flips in the intermediate meshes. Let F 0t : M 0 M t and F 1t : M 1 M t be the piecewise linear maps between the tetrahedral meshes. As the LSD metric is rotation invariant, the intermediate mesh M t can be solved by the following optimization problem: min M t (1 t)l s (F 0t ) +tl s (F 1t ). (6) Figure 4: Examples of manipulating a gear tetrahedral mesh. Furthermore, the deformed meshes using our approach can almost preserve the mesh volume as the LSD metric is relevant to the scaling. If we want to control the scaling and shearing effects during the manipulation, a modified LSD metric can be used in the optimization problem as: L s (JU 1 ), where U = diag(λ 1,λ 2,λ 3 ),λ 1,λ 2,λ 3 > 0, is a positive definite diagonal matrix. Fig. 5 shows the results of isotropic and anisotropic scaling the bunny mesh locally by setting different U. The blue vertices on the surface are fixed and the other vertices are free to move. 5.2 Mesh interpolation Given two tetrahedral meshes M 0 and M 1, mesh interpolation constructs an intermediate tetrahedral mesh M t for t [0,1]. Here we Fig. 6 shows some interpolation examples between different tetrahedral meshes. Fig. 6(a) shows the morphing sequence between a bar mesh and a bent and twisted mesh with t = 0.1. The vertices in blue color are fixed as positional constraints during the optimization process in this example. Fig. 6(b) and (c) show the morphing sequences between two dragon meshes and between a bunny model and a sphere model with t = 0.2 respectively. These examples demonstrate that linear interpolation of the LSD metrics in Eq. 6 has obtained perfectly uniform transformation, e.g., uniform bending, twisting, and shearing transition from the source mesh to the target mesh. Our interpolation approach preserves the shape features and obtained high quality intermediate meshes. 5.3 Deformation transfer Deformation transfer aims to transfer the deformation exhibited by a source triangle mesh onto a different target triangle mesh [24]. We use tetrahedral meshes and represent the source deformation as a collection of Jacobian matrices that captures the linear transformations which individual tetrahedrons undergo relative to the source mesh. Given a source tetrahedral mesh X and its deformed mesh X, we want to generate a new mesh Y for the given target mesh Y such that the relationship between Y and Y is analogous to the relationship between X and X. For simplicity, we suppose X and Y are compatible tetrahedral meshes. Let G : X X and H : Y Y. We hope H = G for each corresponding element pair. Therefore, the following optimization problem should be solved min Y L s (HG 1 ), (7)
5 (a) (b) (c) Figure 6: Interpolation sequence between different tetrahedral meshes. to obtain the deformed target mesh Y. Fig. 7 demonstrates our method used to transfer different deformations of a bar mesh onto other bar meshes with various thickness. Top row shows the results of transferring bending effects: bending effect of the example (a) is transferred to a thicker bar (b) and to a thinner bar (c) respectively. Bottom row shows the results of transferring twisting effects: twisting effect of the example (d) is transferred to a thicker bar (e) and to a thinner bar (f) respectively. Note that the thicker mesh is more rigid in the bending direction as it is bent much less by transferring while the thinner mesh is softer in the bending direction as is bent more by transferring, see top row of Fig. 7. Similar effects occur in twist examples in the bottom row of Fig. 7. Our approach deformation transfer has obtained physically plausible results. (a) (b) (c) (d) (e) (f) Figure 7: Examples of transferring different deformations of a bar mesh onto other bar meshes with various thickness. 5.4 Deformation learning The goal of deformation learning is to position a small number of handle vertices and produce a meaningful overall deformation from a set of given example meshes to indicate the class of meaningful deformations [25]. We also use tetrahedral representation for meshes. Each example is represented with a a collection of Jacobian matrices that captures the linear transformations which individual tetrahedrons undergo relative to a reference pose. Our approach searches among all meshes with specified vertex positions to find the one that has the least LSD metric difference with the given example meshes. Given a deformation example of the source tetrahedral mesh X as G : X X. We want to edit the target tetrahedral mesh Y so that the style of the deformation H : Y Y is analogous to the style of the deformation G. If n deformation examples G i : X i X,i = 1,2,,n, are given, i.e., X i are meaningful deformed shapes of X, we could edit Y by learning from all the examples. For each tetrahedron element X and its corresponding element Y, the Jacobian matrices are respectively represented by G i and H. We decompose the Jacobian matrix G i into scale/shear and rotational components using polar factorization [21]: [ G i] 1 = S i R i (8) Like in the paper [25], we blend the example shapes by using the matrix exponential and logarithm functions: [ [G(ϖ)] 1 n n ] = ϖ i S i exp ϖ i log(r i ), i=1 i=1 where ϖ = (ϖ 1,ϖ 2,,ϖ n ) is the weight vector. As LSD metric is rotation invariant, the rotation part could actually be removed from the metric. Thus the following optimization problem could be solved to obtain the edited shape Y : ( [ n ]) i S i=1ϖ i minl s Y H. (9)
6 It can be proved that the Hessian matrix 2 ϖ i ϖ j L s (Y ) is positive definite. Thus we solve the above optimization problem by using the following Hessian matrix [ ] 2 yi y j L s (Y ) deformed result using our learning approach by twisting the top side with a larger angle is shown in (e). 2 ϖ i ϖ j L s (Y ) which is used to simultaneously search the steepest descent direction of the geometric coordinates Y and the blending weights ϖ. Fig. 8 demonstrates deformation learning results from a bent deformation example shown in brown color in (a). Two example poses of bar are shown in (a). The bottom of the unbent bar is constrained to stay in place while the vertices on the top side are moved. Fig. 8(b) shows the deformed result using the deformation technique in Eq. 5, which is not reasonable. The deformed results using MeshIK learning approach [25] and our learning approach are shown in (c) and (d) respectively. Our approach obtains the better result as the shape near the handle vertices in (c) is much distorted. ( a ) ( b ) ( c ) ( d) Figure 8: Deformation learning from a bent deformation example. Fig. 9 shows the result of deformation learning from one bent and twist deformation example shown in brown color in (a). The bottom of the unbent bar is constrained to stay in place. The vertices on the top side are manipulated with a rotation movement. The deformed result using MeshIK learning approach [25] shown in (b) is rather bad as the bent result is affected by the twist information in the example. Our approach produces a more reasonable result shown in (c). This example demonstrates that our learning approach can extract bending information from the example with complex hybrid deformation. ( a ) ( b ) ( c) Figure 9: Deformation learning from a bent and twisted deformation example. Fig. 10 demonstrates that our learning approach can extract twisting deformation from complex twisting example. Two example poses of bar are shown in brown color in (a) where the two side of the unbent bar are twisted in two different directions. The deformed result using the deformation technique in Eq. 5 shown in (b), where the twist occurs uniformly along the bar. The approach of MeshIK learning [25] does not wok for this case, see (c), while our learning approach obtain a reasonable twist result shown in (d). Note that the bottom part of the bar is not twisted as much as the upper part as the bottom of the bar is constrained to be fixed. The ( a ) ( b ) ( c ) ( d ) ( e) Figure 10: Deformation learning from a bent and twisted deformation example. 5.5 tetrahedral free-form deformation A tetrahedral mesh with a large number of tetrahedra will cause much computation cost. We use the technique of free form deformation(ffd) to deform the shape effectively. We can first embed the shape in a sparse control tetrahedral mesh and then get its deformation by editing the control tetrahedral mesh. Each point inside the control tetrahedral mesh can be computed by the barycentric coordinates of its embedded tetrahedron. Fig 1 demonstrates various deformation examples. The original model is embedded by a sparse control tetrahedral mesh that is shown in blue lines. Then the object is deformed to different shapes by editing the control tetrahedral mesh in different ways. It is shown that the deformed objects are smoothly changed and have no shrinkage even in large bending and twisting. 6 DISCUSSION All the techniques presented in this paper are implemented and tested on a 1.8G Intel computer with 1G memory. The main computational core of our system is solving the optimization problem. We apply an efficient implementation of an inexact Newton algorithm [10] using the conjugate gradient method with an Armijo line search method [3] to solve the unconstrained optimization problem. We could also linearize the optimization process as in [25] to speed up the computation for large meshes. However, it is still a far way to manipulate the tetrahedral meshes using our approach in real time. In each iteration of the inexact Newton method, it involves solving the linear system by the conjugate gradient. Thus, one iteration time for the inexact Newton method varies according to the iteration inside the conjugate gradient. We record the range of the one iteration time related to the number of the iterations inside the conjugate gradient in Table 1. Usually, our algorithms converge in 4 8 steps according to the step size of the manipulated points. As to deformation learning, it involves extra weight Hessian matrix evaluation, where the time is multiplied with the increase of the examples meshes. Table. 2 shows the geometric stretch of the examples shown in the paper. The stretch metric of the deformed tetrahedral mesh is measured as e L 2 (J)det(J)/ e det(j). From Table. 2, it is shown that our approach preserves the tetrahedron quality and is better than both the IMR metric and MeshIK method. 7 CONCLUSIONS We introduce a novel least scaling distortion metric for tetrahedral mesh manipulation and achieve good results. The mesh manipulation is formularized as a nonlinear optimization problem based
7 Example #Vertex #Tet #IN(sec) #CG Bar(Fig. 3) Bunny(Fig. 5) Dragon(Fig. 6(b)) Fig. 6(c) Fig Fig Table 1: Timing statistics of the examples shown in the paper. #Vertex: the number of vertices; #Tet: the number of tetrahedra; #IN: the computation time in second of each iteration of inexact Newton method; #CG: the iteration time of the conjugate gradient method. Example (b) (c) (d) (e) Fig 3(IMR) Fig 3(LSD) Fig Fig Fig Table 2: Geometric stretch for tetrahedral mesh deformations in our paper. on the LSD metric which can be solved using an inexact Newton method with an Armijo line search method. All deformation techniques of triangular meshes are implemented on tetrahedral meshes in a unified framework. We demonstrate the superiority of our approach over other approaches by many experimental results. The main weakness of our approach is the speed of the solver as the optimization problem is nonlinear. We will extend our approach for multiresolution tetrahedral mesh manipulation to speed up the process in the future. We will also extend our approach to subspace tetrahedral based mesh deformation like in [9], which will make the deformation more flexible by directly manipulating the embedded shape. Acknowledge We would like to thank the anonymous reviewers for their helpful comments. This work is partly supported by National Natural Science Foundation of China (No , ), Zhejiang Provincial Natural Science Foundation of China (No. Y105159). REFERENCES [1] M. Alexa, D. Cohen-Or, and D. Levin. As-rigid-as-possible shape interpolation. ACM Transactions on Graphics (Proc. SIGGRAPH), pages , [2] P. Alliez, D. Cohen-Steiner, M. Yvinec, and M. Desbrun. Variational tetrahedral meshing. ACM Transactions on Graphics (Proc. SIGGRAPH 05), 24(3): , [3] L. Armijo. Minimization of functions having lipschitz-continuous first partial derivatives. Pacific Journal of Mathematics, 16(3):1 3, [4] R.E. Bank and R.K. Smith. Mesh smoothing using a posteriori error estimates. SIAM Journal on Numerical Analysis, 34(3): , [5] S. Coquillart. Extended free-form deformation: A sculpturing tool for 3d geometric modeling. In Proc. SIGGRAPH 1990, pages , [6] B. Cutler, J. Dorsey, and L. Mcmillan. Simplification and improvement of tetrahedral models for simulation. In Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry Processing, pages , [7] L. Freitag and P. Knupp. Tetrahedral mesh improvement via optimization of the element condition number. International Journal for Numerical Methods in Engineering, 53(6): , [8] L. Freitag and C. Ollivier. Tetrahedral mesh improvement using swapping and smoothing. J. Numerical Methods in Engineering, 40(21): , [9] J. Huang, X. Shi, X. Liu, K. Zhou, L. Wei, S. Teng, H. Bao, B. Guo, and H.-Y. Shum. Subspace gradient domain mesh deformation. ACM Transactions on Graphics (Proc. SIGGRAPH 06), 25(3): , [10] C.T. Kelley. Solving nonlinear equations with newton s method. SIAM, Philadelphia, Pennsylvania, [11] P. Knupp. Achieving finite element mesh quality via optimization of the jacobian matrix norm and associated quantities, part ii-a framework for volume mesh optimization and the condition number of the jacobian matrix. International Journal for Numerical Methods in Engineering, 48: , [12] L. Kobbelt, S. Campagna, J. Vorsatz, and H.-P. Seidel. Interactive multi-resolution modeling on arbitrary meshes. In Proc. SIGGRAPH 1998, pages , [13] V. Kraevoy and A. Sheffer. Cross-parameterization and compatible remeshing of 3d models. ACM Transactions on Graphics (Proc. SIG- GRAPH 04), 23(3): , [14] Y. Lipman, D. Cohen-Or, G. Ran, and D. Levin. Volume and shape preservation via moving frame manipulation. ACM Transactions on Graphics, 26(1), [15] Y. Lipman, O. Sorkin, D. Levin, and D. Cohen-Or. Linear rotationinvariant coordinates for meshes. ACM Transactions on Graphics(Proc. SIGGRAPH), 24(3): , [16] W. Mollemans, F. Schutyser, J. Cleynenbreugel, and P. Suetens. Tetrahedral mass spring model for fast soft tissue deformation. Lecture Notes in Computer Science, 2673: , [17] T.S. Munson. Mesh shape-quality optimization using the inverse mean-ratio metric. ANL/MCS-P , Argonne National Laboratory, Illinois, [18] Y. Saad. Iterative methods for sparse linear systems. SIAM, Philadelphia, Pennsylvania, [19] P.V. Sander, J. Snyder, S.J. Gortler, and H. Hoppe. Texture mapping progressive meshes. In Proc. SIGGRAPH 2001, pages , [20] T. Sederberg and S. Parry. Free-form deformation of solid geometric models. In Proc. SIGGRAPH 1986, pages , [21] K. Shoemake and T. Duff. Matrix animation and polar decomposition. In Proc. Graphics Interface, pages , [22] O. Sorkine, D. Cohen-Or, R. Goldenthal, and D. Lischinski. Boundeddistortion piecewise mesh parameterization. In Proc. Visualization, pages , [23] O. Sorkine, Y. Lipman, D. Cohen-Or, M. Alexa, C. Rössl, and H.- P. Seidel. Laplacian surface editing. In Proc. Symp. on Geometry Processing, pages , [24] R.W. Summer and J. Popovic. Deformation transfer for triangle meshes. ACM Transactions on Graphics(Proc. SIGGRAPH), 23(3): , [25] R.W. Sumner, M. Zwicker, C. Gotsman, and J. Popovic. Meshbased inverse kinematics. ACM Transactions on Graphics(Proc. SIG- GRAPH), 24(3): , [26] G. Taubin. A signal processing approach to fair surface design. In Proc. SIGGRAPH 1995, pages , [27] Y. Yu, K. Zhou, D. Xu, X. Shi, H. Bao, B. Guo, and H.-Y. Shum. Mesh editing with poisson-based gradient field manipulation. ACM Transactions on Graphics(Proc. SIGGRAPH), 23(3): , [28] R. Zayer, C. Rossl, Z. Karni, and H.-P. Seidel. Harmonic guidance for surface deformation. In Proc. Eurographics, pages , [29] E. Zhang, K. Mischaikow, and G. Turk. Feature-based surface parameterization and texture mapping. ACM Transactions on Graphics, 24(1):1 27, [30] K. Zhou, J. Huang, J. Snyder, X. Liu, H. Bao, B. Guo, and H.-Y. Shum. Large mesh deformation using the volumetric graph laplacians. ACM Transactions on Graphics(Proc. SIGGRAPH), 24(3): , [31] K. Zhou, X. Huang, X. Wang, Y. Tong, M. Desbrun, B. Guo, and H.Y. Shum. Mesh quilting for geometric texture synthesis. ACM Transactions on Graphics (Proc. SIGGRAPH), 25(3): , 2006.
2.5 Physically-based Animation
2.5 Physically-based Animation 320491: Advanced Graphics - Chapter 2 74 Physically-based animation Morphing allowed us to animate between two known states. Typically, only one state of an object is known.
More informationA study on generation of three-dimensional M-uniform tetrahedral meshes in practice
A study on generation of three-dimensional M-uniform tetrahedral meshes in practice Lennard Kamenski and Hang Si 2 Weierstrass Institute, Mohrenstr. 39, 07 Berlin, Germany. lennard.kamenski@wias-berlin.de
More informationAs-Rigid-As-Possible Surface Modeling
To appear at the Eurographics Symposium on Geometry Processing 2007 Alexander Belyaev, Michael Garland Editors As-Rigid-As-Possible Surface Modeling Olga Sorkine and Marc Alexa TU Berlin, Germany Abstract
More informationMean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its
More informationFrom Scattered Samples to Smooth Surfaces
From Scattered Samples to Smooth Surfaces Kai Hormann 1 California Institute of Technology (a) (b) (c) (d) Figure 1: A point cloud with 4,100 scattered samples (a), its triangulation with 7,938 triangles
More informationMetrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
More informationGeometric Constraints
Simulation in Computer Graphics Geometric Constraints Matthias Teschner Computer Science Department University of Freiburg Outline introduction penalty method Lagrange multipliers local constraints University
More informationanimation animation shape specification as a function of time
animation animation shape specification as a function of time animation representation many ways to represent changes with time intent artistic motion physically-plausible motion efficiency control typically
More informationStreaming Tetrahedral Mesh Optimization
Streaming Tetrahedral Mesh Optimization Tian Xia University of Illinois Eric Shaffer University of Illinois Abstract Improving the quality of tetrahedral meshes is an important operation in many scientific
More informationCharacter Animation from 2D Pictures and 3D Motion Data ALEXANDER HORNUNG, ELLEN DEKKERS, and LEIF KOBBELT RWTH-Aachen University
Character Animation from 2D Pictures and 3D Motion Data ALEXANDER HORNUNG, ELLEN DEKKERS, and LEIF KOBBELT RWTH-Aachen University Presented by: Harish CS-525 First presentation Abstract This article presents
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationGraphical Models. Robust mesh editing using Laplacian coordinates. Shaoting Zhang, Junzhou Huang, Dimitris N. Metaxas. abstract
Graphical Models 73 (2011) 10 19 Contents lists available at ScienceDirect Graphical Models journal homepage: www.elsevier.com/locate/gmod Robust mesh editing using Laplacian coordinates Shaoting Zhang,
More informationConstrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume *
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume * Xiaosong Yang 1, Pheng Ann Heng 2, Zesheng Tang 3 1 Department of Computer Science and Technology, Tsinghua University, Beijing
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationMesh Moving Techniques for Fluid-Structure Interactions With Large Displacements
K. Stein Department of Physics, Bethel College, St. Paul, MN 55112 T. Tezduyar Mechanical Engineering, Rice University, MS 321, Houston, TX 77005 R. Benney Natick Soldier Center, Natick, MA 01760 Mesh
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationPart-Based Recognition
Part-Based Recognition Benedict Brown CS597D, Fall 2003 Princeton University CS 597D, Part-Based Recognition p. 1/32 Introduction Many objects are made up of parts It s presumably easier to identify simple
More informationEssential Mathematics for Computer Graphics fast
John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made
More informationanimation shape specification as a function of time
animation 1 animation shape specification as a function of time 2 animation representation many ways to represent changes with time intent artistic motion physically-plausible motion efficiency typically
More informationComputational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON
Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf
More information3D Morphing for Triangle Meshes using Deformation Matrix
3D Morphing for Triangle Meshes using Deformation Matrix Tianwei Xing, Yipin Yang, Yao Yu, Yu Zhou, Xianglei Xing, Sidan Du NanJing University, School of Electronic Science and Engineering JiangSu Province,
More informationFinite Element Formulation for Plates - Handout 3 -
Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the
More informationCage-Based Tracking for Performance Animation
Cage-Based Tracking for Performance Animation Yann Savoye and Jean-Sébastien Franco INRIA Bordeaux University, France Abstract. Full body performance capture is a promising emerging technology that has
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationBig Ideas in Mathematics
Big Ideas in Mathematics which are important to all mathematics learning. (Adapted from the NCTM Curriculum Focal Points, 2006) The Mathematics Big Ideas are organized using the PA Mathematics Standards
More informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points
More informationPennsylvania System of School Assessment
Pennsylvania System of School Assessment The Assessment Anchors, as defined by the Eligible Content, are organized into cohesive blueprints, each structured with a common labeling system that can be read
More informationNEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
More informationHigh-Dimensional Image Warping
Chapter 4 High-Dimensional Image Warping John Ashburner & Karl J. Friston The Wellcome Dept. of Imaging Neuroscience, 12 Queen Square, London WC1N 3BG, UK. Contents 4.1 Introduction.................................
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationVolumetric Meshes for Real Time Medical Simulations
Volumetric Meshes for Real Time Medical Simulations Matthias Mueller and Matthias Teschner Computer Graphics Laboratory ETH Zurich, Switzerland muellerm@inf.ethz.ch, http://graphics.ethz.ch/ Abstract.
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More information6. Vectors. 1 2009-2016 Scott Surgent (surgent@asu.edu)
6. Vectors For purposes of applications in calculus and physics, a vector has both a direction and a magnitude (length), and is usually represented as an arrow. The start of the arrow is the vector s foot,
More informationLecture 7 - Meshing. Applied Computational Fluid Dynamics
Lecture 7 - Meshing Applied Computational Fluid Dynamics Instructor: André Bakker http://www.bakker.org André Bakker (2002-2006) Fluent Inc. (2002) 1 Outline Why is a grid needed? Element types. Grid types.
More informationBernice E. Rogowitz and Holly E. Rushmeier IBM TJ Watson Research Center, P.O. Box 704, Yorktown Heights, NY USA
Are Image Quality Metrics Adequate to Evaluate the Quality of Geometric Objects? Bernice E. Rogowitz and Holly E. Rushmeier IBM TJ Watson Research Center, P.O. Box 704, Yorktown Heights, NY USA ABSTRACT
More informationState of Stress at Point
State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,
More informationAn Overview of the Finite Element Analysis
CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometry
More informationChapter 111. Texas Essential Knowledge and Skills for Mathematics. Subchapter B. Middle School
Middle School 111.B. Chapter 111. Texas Essential Knowledge and Skills for Mathematics Subchapter B. Middle School Statutory Authority: The provisions of this Subchapter B issued under the Texas Education
More information3D Distance from a Point to a Triangle
3D Distance from a Point to a Triangle Mark W. Jones Technical Report CSR-5-95 Department of Computer Science, University of Wales Swansea February 1995 Abstract In this technical report, two different
More informationA Short Introduction to Computer Graphics
A Short Introduction to Computer Graphics Frédo Durand MIT Laboratory for Computer Science 1 Introduction Chapter I: Basics Although computer graphics is a vast field that encompasses almost any graphical
More informationOpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikki-gmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
More informationExample-Driven Deformations Based on Discrete Shells
Volume xx (200y), Number z, pp. 1 11 Example-Driven Deformations Based on Discrete Shells Stefan Fröhlich, Mario Botsch Computer Graphics Group, Bielefeld University Abstract Despite the huge progress
More informationModel Repair. Leif Kobbelt RWTH Aachen University )NPUT $ATA 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS !NALYSIS OF SURFACE QUALITY
)NPUT $ATA 2ANGE 3CAN #!$ 4OMOGRAPHY 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS!NALYSIS OF SURFACE QUALITY 3URFACE SMOOTHING FOR NOISE REMOVAL 0ARAMETERIZATION 3IMPLIFICATION FOR COMPLEXITY REDUCTION
More informationBack to Elements - Tetrahedra vs. Hexahedra
Back to Elements - Tetrahedra vs. Hexahedra Erke Wang, Thomas Nelson, Rainer Rauch CAD-FEM GmbH, Munich, Germany Abstract This paper presents some analytical results and some test results for different
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationCOMPUTATIONAL ENGINEERING OF FINITE ELEMENT MODELLING FOR AUTOMOTIVE APPLICATION USING ABAQUS
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 7, Issue 2, March-April 2016, pp. 30 52, Article ID: IJARET_07_02_004 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=7&itype=2
More informationOverset Grids Technology in STAR-CCM+: Methodology and Applications
Overset Grids Technology in STAR-CCM+: Methodology and Applications Eberhard Schreck, Milovan Perić and Deryl Snyder eberhard.schreck@cd-adapco.com milovan.peric@cd-adapco.com deryl.snyder@cd-adapco.com
More informationn 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1
. Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n
More informationTetrahedral mesh improvement via optimization of the element condition number
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2002; 53:1377 1391 (DOI: 10.1002/nme.341) Tetrahedral mesh improvement via optimization of the element condition number
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationTetrahedron Meshes. Linh Ha
Tetrahedron Meshes Linh Ha Overview Fundamental Tetrahedron meshing Meshing polyhedra Tetrahedral shape Delaunay refinements Removing silver Variational Tetrahedral Meshing Meshing Polyhedra Is that easy?
More informationClassifying Manipulation Primitives from Visual Data
Classifying Manipulation Primitives from Visual Data Sandy Huang and Dylan Hadfield-Menell Abstract One approach to learning from demonstrations in robotics is to make use of a classifier to predict if
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationCommon Core Unit Summary Grades 6 to 8
Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations
More informationP164 Tomographic Velocity Model Building Using Iterative Eigendecomposition
P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition K. Osypov* (WesternGeco), D. Nichols (WesternGeco), M. Woodward (WesternGeco) & C.E. Yarman (WesternGeco) SUMMARY Tomographic
More informationPoint Cloud Segmentation via Constrained Nonlinear Least Squares Surface Normal Estimates
Point Cloud Segmentation via Constrained Nonlinear Least Squares Surface Normal Estimates Edward Castillo Radiation Oncology Department University of Texas MD Anderson Cancer Center, Houston TX ecastillo3@mdanderson.org
More informationTWO-DIMENSIONAL TRANSFORMATION
CHAPTER 2 TWO-DIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization
More informationTESLA Report 2003-03
TESLA Report 23-3 A multigrid based 3D space-charge routine in the tracking code GPT Gisela Pöplau, Ursula van Rienen, Marieke de Loos and Bas van der Geer Institute of General Electrical Engineering,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationCustomer Training Material. Lecture 4. Meshing in Mechanical. Mechanical. ANSYS, Inc. Proprietary 2010 ANSYS, Inc. All rights reserved.
Lecture 4 Meshing in Mechanical Introduction to ANSYS Mechanical L4-1 Chapter Overview In this chapter controlling meshing operations is described. Topics: A. Global Meshing Controls B. Local Meshing Controls
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationLecture Topic: Low-Rank Approximations
Lecture Topic: Low-Rank Approximations Low-Rank Approximations We have seen principal component analysis. The extraction of the first principle eigenvalue could be seen as an approximation of the original
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More informationTOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS
TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS D.V. Vranić, D. Saupe, and J. Richter Department of Computer Science, University of Leipzig, Leipzig, Germany phone +49 (341)
More informationSubspace Analysis and Optimization for AAM Based Face Alignment
Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China zhaoming1999@zju.edu.cn Stan Z. Li Microsoft
More informationTopological Treatment of Platonic, Archimedean, and Related Polyhedra
Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic
More informationFACIAL RIGGING FOR 3D CHARACTER
FACIAL RIGGING FOR 3D CHARACTER Matahari Bhakti Nendya 1, Eko Mulyanto Yuniarno 2 and Samuel Gandang Gunanto 3 1,2 Department of Electrical Engineering, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia
More informationAlgebra 1 2008. Academic Content Standards Grade Eight and Grade Nine Ohio. Grade Eight. Number, Number Sense and Operations Standard
Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationInteractive Computer Graphics
Interactive Computer Graphics Lecture 18 Kinematics and Animation Interactive Graphics Lecture 18: Slide 1 Animation of 3D models In the early days physical models were altered frame by frame to create
More information(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationWe can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
More informationOverview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series
Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them
More information3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationLinear Programming. April 12, 2005
Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More informationIntroduction to Solid Modeling Using SolidWorks 2012 SolidWorks Simulation Tutorial Page 1
Introduction to Solid Modeling Using SolidWorks 2012 SolidWorks Simulation Tutorial Page 1 In this tutorial, we will use the SolidWorks Simulation finite element analysis (FEA) program to analyze the response
More informationThe elements used in commercial codes can be classified in two basic categories:
CHAPTER 3 Truss Element 3.1 Introduction The single most important concept in understanding FEA, is the basic understanding of various finite elements that we employ in an analysis. Elements are used for
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationModule 3: Correlation and Covariance
Using Statistical Data to Make Decisions Module 3: Correlation and Covariance Tom Ilvento Dr. Mugdim Pašiƒ University of Delaware Sarajevo Graduate School of Business O ften our interest in data analysis
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationGlencoe. correlated to SOUTH CAROLINA MATH CURRICULUM STANDARDS GRADE 6 3-3, 5-8 8-4, 8-7 1-6, 4-9
Glencoe correlated to SOUTH CAROLINA MATH CURRICULUM STANDARDS GRADE 6 STANDARDS 6-8 Number and Operations (NO) Standard I. Understand numbers, ways of representing numbers, relationships among numbers,
More informationSouth Carolina College- and Career-Ready (SCCCR) Pre-Calculus
South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More informationA linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form
Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...
More informationWii Remote Calibration Using the Sensor Bar
Wii Remote Calibration Using the Sensor Bar Alparslan Yildiz Abdullah Akay Yusuf Sinan Akgul GIT Vision Lab - http://vision.gyte.edu.tr Gebze Institute of Technology Kocaeli, Turkey {yildiz, akay, akgul}@bilmuh.gyte.edu.tr
More informationGiven a point cloud, polygon, or sampled parametric curve, we can use transformations for several purposes:
3 3.1 2D Given a point cloud, polygon, or sampled parametric curve, we can use transformations for several purposes: 1. Change coordinate frames (world, window, viewport, device, etc). 2. Compose objects
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationA New Approach to Cutting Tetrahedral Meshes
A New Approach to Cutting Tetrahedral Meshes Menion Croll August 9, 2007 1 Introduction Volumetric models provide a realistic representation of three dimensional objects above and beyond what traditional
More informationA Direct Numerical Method for Observability Analysis
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method
More informationEstimating Body Shape of Dressed Humans
Estimating Body Shape of Dressed Humans Nils Hasler a, Carsten Stoll a, Bodo Rosenhahn b, Thorsten Thormählen a, Hans-Peter Seidel a a MPI Informatik b Hannover University Abstract The paper presents a
More informationMultigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation
Multigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation M. Donatelli 1 M. Semplice S. Serra-Capizzano 1 1 Department of Science and High Technology
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More information096 Professional Readiness Examination (Mathematics)
096 Professional Readiness Examination (Mathematics) Effective after October 1, 2013 MI-SG-FLD096M-02 TABLE OF CONTENTS PART 1: General Information About the MTTC Program and Test Preparation OVERVIEW
More informationCircuit Analysis using the Node and Mesh Methods
Circuit Analysis using the Node and Mesh Methods We have seen that using Kirchhoff s laws and Ohm s law we can analyze any circuit to determine the operating conditions (the currents and voltages). The
More information