Variational Design and Fairing of Spline Surfaces
|
|
- Basil Howard Harris
- 6 years ago
- Views:
Transcription
1 EUROGRAPHICS 94 / M. Daehlen and L. Kjelldahl (Guest Editors), Blackwell Publishers Eurographics Association, 1994 Volume 13, (1994), number 3 Variational Design and Fairing of Spline Surfaces Günther Greiner Computer Graphics Group, University of Erlangen Am Weichselgarten 9, D Erlangen, Germany greiner@informatik.uni-erlangen.de Abstract Variational principles have become quite popular in the design of free form surfaces. Among others they are used for fairing purposes. The choice of the right fairness functional is a crucial step. There is always a tradeoff between high quality and computational effort. In this paper we present fairness functionals that allow fairing efficiently, i.e., produce high quality surfaces in a reasonable amount of time. These functionals can be considered as simplified thin plate energy functionals for parametric surfaces or as simplified MVC functionals. 1 Introduction Modeling free form surfaces by specifying the control points or, modifying surfaces by changing some of its control points, is a popular way to construct surfaces having the required overall shape. In case the surface is determined by a large amount of control points, these manipulations often produce wrinkles or other flaws in parts of the surface. In a second, post processing step, one has to smoothen these regions. This procedure is called fairing (see [7] for basics on the subject). A standard approach is to consider the surface as a thin plate and change it locally in such a way that the energy of the thin plate described by the surface will be minimal. The exact functional expressing the energy of a thin plate is very complicated. As a consequence, this method is computationally very demanding and requires a lot of time. In the functional case, i.e., when the z-coordinate in 3D-space can be expressed as a bivariate function of x and y coordinates, there is a simplified thin plate energy functional which is (in most cases) a good approximation of the exact energy and can be handled rather easily. It seems that there is no similar simplified functional in the parametric case. The ad hoc transition (though used by some authors) of this functional will, in general, be a rather bad approximation to the exact energy. We are going to describe how correct simplifications of the exact thin plate energy functional for parametric surfaces can be obtained that allow solutions in a reasonable time. Moreover, we describe simplifications of the so-called MVC functionals (see [12]) which are also well suited for fairing purposes. The basic idea is the following. When fairing has to be done, one already has a surface, call it, which is a good approximation to the find result call it. The surface is used to define an appropriate, quadratic, positive definite functional which serves as a fairness functional. Thus we do not consider some universal fairing functional, instead, we introduce a data dependent fairness functional. Details are described in the next section. Minimizing will then yield the desired faired surface. In the subsequent sections we describe in detail two fairing methods for tensor product spline surfaces which use these functionals. A global method and an iterative procedure. The global method described in Section 3 can be used in cases where not too many control points are involved (at most several hundreds), while the local method described in Section 4 can be applied also to very large sets of control points.
2 C-144 G. Greiner / Variational Design and Fairing of Spline Surfaces 2 Appropriate Fairness Functionals Usually, for fairing a parametrized surface in some interior region one tries to choose the surface following functional that coincides with outside of and, in addition, minimizes the where and denote the principal curvatures of the surface G. denotes the surface element. Using the notions of Gaussian curvature and mean curvature instead of the principle curvatures, the functional (1) can be reformulated as By the Gauss-Bonnet Theorem from differential geometry [8], the integral over Gaussian curvature can be expressed as an integral over the boundary of Since in the fairing we do not change the boundary values, the second term in (1 ) can be omitted in the optimization process. That is, we obtain the same result when minimzing the following functional Since this functional (as well as (1) and (1 )) is highly nonlinear, the numerical solution to this problem will be very involved and time consuming. To overcome this difficulty, one simplifies the functional. E.g. in [1] where tensor product spline surfaces are considered, this is achieved by evaluting the integrand of (1) only at the corners of the rectangular patch. Another possibility is to work with simpler functionals (e.g., quadratic ones). Often one uses the (simplified) thin plate energy. The corresponding functional then is However, this functional is a good approximation only in the functional case, but may fail to be close to the correct thing in the parametric case. A better approximation to the functional (2), by a quadratic functional can be obtained as follows. Choose a parametrized surface that is close to the desired surface, and consider the functional Here is the Laplace-Beltrami operator related to (see e.g. [8]). It is a second order elliptic partial differential operator with non-constant coefficients. The coefficients depend on the first fundamental form of the surface. More precisely, the Laplace-Beltrami operator applied to a scalar function h yields Here are the coefficients of the first fundamental form corresponding to and is its determinant. denotes the usual inner product in 3-dimensional Euclidean space. The Laplace-Beltrami operator typically will be applied to scalar functions. When applying it to a vector valued function, as in formula (4), we apply it to each component individually (i.e, After all these complicated formulas, the functional defined in (4) seems to be rather complicated. Actually, it is much simpler to deal with than any of the functionals (1), (1 ) or (2). Moreover, it has some interesting properties listed below (see [5]).
3 G. Greiner / Variational Design and Fairing of Spline Surfaces C Proposition. Considering as a functional on the set of all twice differentiable parametrizations having fixed values outside the following holds. a) is a positive definite, quadratic functional. b) only depends on the geometry of the surface not on the parametrization. c) If then 2.2 Consequences. Let us briefly comment on these properties. From a) it follows that determining the minimum reduces to solving a linear system. In fact, the minimum is characterized by the fact that the gradient of this functional vanishes. Since it is a quadratic functional, its gradient is linear! Moreover, positive definiteness guarantees the existence of a a unique minimum. From b) it follows, that when choosing the surface we do not have to care about a special parametrization or a special parameter space. From c) it follows that in case is chosen in such a way that it is close to the surface we are looking for, then for this surface is a good approximation of the functional described in formula (2), at least in a neighborhood of A rigorous mathematical statement is the following: with a constant const not depending on F provided that the distance is suficiently small. The constant is independent of F. Note however, that the distance dist has to be measured with respect to the Sobolev norm, that is the partial derivatives (up to order two) enter. 2.3 Remark. Another way to explain the meaning of is the following. Provided that the parametrization is isometric (i.e., at every point the first fundamental form is the 2 x 2 unit matrix), then (1) and (3) yield the same value at F = and will not differ very much, provided that F is close to. The same holds true for (2) and the following functional where denotes the usual Laplacian of Euclidean 2-space. Thus in case is an nearly isometric parametrization, then (3) and (4) would be good approximations for (1) and (2) respectively. This however, will be rarely the case. The situation can be improved by reparametrization the surface. Even then, only special surfaces can be parametrized nearly isometrically. The situation changes quite drastically, when one allows non-plane parameter spaces. Then every surface can be parametrized isometrically very easily. Use the surface itself as parameter space and consider the identical paramerization! Then however, one has to replace in (5) the standard Laplacian by the Laplacian of the non-plane parameter space, which is the Laplace-Beltrami operator. In the design process so-called MVC functionals have proven to yield surfaces of perfect shape [12, 13, 11]. These functionals minimize the variation of the curvature. That is, they involve derivatives of the curvature. A typical example is the following. As above, denote the principle curvatures and denote the corresponding directions of principle curvature. The complexity of this functional and hence the numerical treatment are even worse than for (1).
4 C-146 G. Greiner / Variational Design and Fairing of Spline Surfaces We are going to describe how quadratic approximations to these functionals can be obtained. The idea is similar as above. Since derivatives of the curvature involve third order derivatives of the parametrization, we are looking for a quadratic functional which contains third order derivatives. Actually we are looking for something which simultanuously minimizes all third order derivatives. The following functional does this job Here grad denotes the gradient. It has to be applied to each component of Thus the integrand is However, this functional does not take into account the special geometry which we are looking for. After the discussion above it is clear how to modify it in order to incorporate the geometry described by : Consider gradient, Laplacian, inner product and area element with respect to the surface. Thus the simplified MVC functional we are looking for is Here denotes the inner product with respect to the Riemannian metric (= first fundamental form) induced by And, for a scalar function h, the gradient with respect to is given by Again, denote the coefficients and g the determinant of the first fundamental form of. Thus for the integrand has the following form with The properties of the functional are listed in the following proposition. a) and b) coincide with the corresponding statements of Proposition Proposition. Considering tions having fixed values outside as a functional on the set of all three times differentiable parametrizathe following holds. a) is a positive definite, quadratic functional. b) only depends on the geometry of the surface not on the parametrization. c) then The consequences of a) and b) are the same as in case of Proposition 2.1 (see 2.2). In particular, the minimum of can be determined by solving a linear system.
5 G. Greiner / Variational Design and Fairing of Spline Surfaces C Global Fairing for Tensor Product Spline Surfaces We assume that there is a parametrized surface. Then fairing can be achieved as follows: having some wrinkles in a subdomain Choose as fairing functional either or defined in (4) and (7) respectively. Solve the variational problem The resulting minimum is the surface we are looking for. In practical applications one will deal with a certain finite dimensional set of parametrizations, call it S. Each F S is a mapping from a fixed parameter space into. S may consist of tensor product spline surfaces over a rectangular grid, or of piecewise Bézier patches (over a triangulation), or of triangular splines (over a triangulation and an associated cloud of knots, see [2]) or a scheme of split surfaces (e.g., Clough-Tocher or Powell-Sabin). For simplicity we restrict ourselves to the case of tensor product spline surfaces and describe the procedure in detail for this situation. The parameter space will be rectangle and there are knot vectors and Multiple knot are allowed with the restriction that -continuity is guaranteed. Thus interior knots may have multiplicity up to n - 2, exterior knots up to n + 1. The corresponding normalized (univariate) B-spline functions of degree n subordinated to T and S will be denoted by and respectively. Then, has its support in the interval and in. S consists of all tensor product B-spline surfaces of degree (n, n) subordinated to T x S. Thus each F S has a unique representation where are the control points. The subregion in which fairing has to be performed is best specified by determining a subset of the indices. Note that the control point modifies the surface only in the rectangle In the following we only want to do fairing in the interior. Therefore, we require that is a subset of For fairing at the boundary see the remark at the end of this section. For a set the corresponding subregion is given by Next we identify all control points that have influence on the subregion. These are the control points having an index (i,j) satisfying Call this set. In case is the rectangular set is the rectangle. Then for any surface we have that and coincide on Hence, Thus for minimizing we only have to take into consideration the control points with indices in The control points with indices in are the ones which have to be determined in the optimization process, while the control points with indices belonging to the difference remain fixed. Due to the quadratic nature of our functional we end up with a least square problem for the coefficients 3.1 Fairing with the simplified minimal energy functional We choose as given by (4). Then we have
6 C-148 G. Greiner / Variational Design and Fairing of Spline Surfaces Introducing the quantities we obtain We have to minimize this symmetric quadratic functional over the control points while the control points are the control points of, we denote them This least square problem leads to the following linear system Only the control points on the left-hand side are unknows. The one on the right-hand side are the control points of the surface! There are as many equations in (9) as we have indices in. Each equation is a vector equation in that is three scalar equations, one for the x-,y- and z-component. So we have a linear system of size denotes the number of coefficients in. However, the coefficient matrices are identical for x-, y- and z-component. Only the right-hand side differs. Thus we only have to solve a linear system of size for three different right-hand sides. We summarize the steps explained in detail above. Given a tensor product spline surface to be done, perform the following steps: for which fairing has 1. Specify a subset of interior indices describing the region where fairing has to he done and determine the set 2. For determine the coefficients of the linear system given in (8) by numerical quadrature. 3. Solve three times (for and the linear system Then, the control points of the resulting surface are given by Besides solving the linear system, the most complicated step in the procedure is the determination of the coefficients by numerical integration. However, the implementation shows that there is no need for an accurate integration method. Quadrature formalus involving evaluation at four interior points in each rectangle already produce good results. Also the simple midpoint formula
7 G. Greiner / Variational Design and Fairing of Spline Surfaces C-149 can be used. 3.2 Fairing with the simplified MVC functional If we choose as fairing functional given by (7) everything mentioned in 3.1 remains true, except that the quantities are given by Figure 1: The left figure shows the initial surface, the right figure the surface after fairing with the global method. As fairing functional the simplified MVC functional has been used. 3.3 Modifications. a) In fairing one often requires additionally that the resulting surface does not move too far away from the initial surface. For this purpose a tolerance is specified. This can be easily achieved as follows. Having determined the control points as described above, one checks for every whether If not, replace by Another approach guaranteeing that the resulting surface stays close to the initial surface might be the following. Add to the fairing functional J a term The larger the constant Const is chosen, the more the resulting surface will stick to. Note that by this modification the new fairing functional remains quadratic and positve definite. Hence, the numerical treatment can be handled similarly. b) Instead using to define the fairing functional and respectively, one can use a modified surface obtained by averaging the control points having indices in. The implementation shows, that the following choice gives a slightly better result than working with. Define the control points of by c) Obviously, the fairing method described above can be iterated. The resulting surface may be used as starting point for another fairing process. As long as one considers the same subregion (the same set it turns out, that in many case a second step is not neccesary. A possible third step
8 C-150 G. Greiner / Variational Design and Fairing of Spline Surfaces hardly changes anything. However, we do not have a rigorous proof for the convergence of this iteration procedure! 3.4 Fairing at the boundary. So far we have not allowed that the region where fairing has to be done meets the boundary. This assumptions guarantees that the boundary of the surface will not be changed. Thus the surface cannot contract. Otherwise this may happen. Think of the extreme case where contains all indices (including the ones at the boundary). Then the method will produce the trivial surface contracted to the point 0. If one also wants to do fairing at the boundary, we propose the following two step procedure. 1) Do fairing of those boundary curves where meets the boundary. 2) Remove the boundary indices from and perform fairing as described above. Possibly one has to repeat these steps several times. Of course, fairing of the (boundary) curves can be done by an variational approach as well. 4 Local Fairing for Tensor Product Spline Surfaces In this section we present an alternative to the method described in the previous section. The idea is that instead minimizing over a set of control points one minimizes in each step only over one control point. This can be done for any of the fairing functionals given in (4) and (7). 4.1 The basic step. We perform fairing as described in Sect. 3 for the special case where contains only a single interior index. Then The linear system (9) reduces to a single equation for Its solution is given by Thus the resulting surface is obtained from by replacing the control point by defined in (10). Formula (10) shows that the new control point is obtained by a linear combination of the control points in a rectangular neighborhood. In general one has to do fairing in a subdomain specified by a set of many indices. This can be achieved by replacing subsequently one of the control points specified by by the control point given by (10). Note that in each step the initial surface changes, therefore the coefficients have to be recomputed! Moreover, it does not suffice to do this only once for every index. In order to obtain good results one has to go over the whole set several times. We summarize the procedure.
9 G. Greiner / Variational Design and Fairing of Spline Surfaces C-151 Figure 2: To the surface of Fig. 1 the also the local fairing method has been applied. The four figures shown here are the resulting surfaces after 1, 2, 5 and 10 iterations. 4.2 The local method. Given a tensor product spline surface to be done, perform the following steps: for which fairing has 1. Specify a subset of interior indices describing the region where fairing has to be done. 2. For every determine the coefficients, (for n), and replace by the expression given in (10). 3. Repeat step 2 until convergence, i.e. the surface changes only by a certain, a priori specified amount. The only non-trivial step in this method is the determination of the coefficients which has to be done by numerical integration. As mentioned in Sect. 3 it is enough to work with simple quadrature
10 C-152 G. Greiner / Variational Design and Fairing of Spline Surfaces formulas. The method described above, can be compared to the usual Gauss-Seidel iteration for linear systems. There in each single step one unknown is altered in order to satisfy the i-th equation exact. This has to be done for all unknowns and than the whole process will be repeated until convergence. Figure 3: Fairing the Torus on the left using the global method. The right image was obtained by the MVC functional (7), the one in the middle by the minimal energy functional (4). 5 Concluding Remarks 5.1 Implementation. Preliminary implementation of all methods (local/global and minmal energy/mvc) has been done and several examples have been tested. Some are shown in the figures. The fairing regions consisted of up to 100 control points. The results show that the MVC method produces better results (see Fig. 3). In cases were some isolated points were picked out of the fairing region, only with the MVC functional one obtains a good result. The use of the minimal energy functional produces peaks in this situation (see Fig. 4). 5.2 Conclusion. In this paper we have introduced two fairing functionals which are good approximations to minimal energy functionals and MVC functionals respectively. The functionals are data dependent. That is, knowledge of the geometry of the final result is necessary to define the functionals. Both functionals are simple enough (quadratic, positive definite) to perform the optimization in a reasonable time. Moreover, we have introduced two methods, a global and a local method, for fairing of tensor product spline surfaces. This can be done with either of the functionals. In the global method a single step yields the result. One has to do numerical integration and solve a linear system. The size of this system is proportional to the number of control points involved in the fairing process. In the local method, one single step involves only numerical integration. This step, however has to be executed very often. Depending on the number of control points involved in the fairing process, one has to do it times for each control point. 5.3 Future Work More examples have to be tested and comparisons have to be done in order to decide which method (local or global) is preferable. Furthermore, fairing at the boundary (as described in 3.4) has to be included. A comfortable user interface has to be build in order to allow interactively specifying the region where fairing has to be done. Also integrating it in modelling systems as a future task. Moreover, the method will be implemented for other classes of surfaces, triangular spline surfaces and split surfaces.
11 G. Greiner / Variational Design and Fairing of Spline Surfaces C-153 Figure 4: Same thing as in Fig. 3 for another configuration. In addition, one control point in the interior, the one close to the peak, remain fixed. References [1] G.-P. Bonneau, H. Hagen, and St. Hahmann. Variational surface design and surface interrogation. Computer Graphics Forum, 12(3): , [2] W. Dahmen, C. A. Micchelli, and H.-P. Seidel. Blossoming bedgets b-spline bases built better by b-patches. Math. Comp., 59:97-115, [3] M. Eck and J. Hadenfeld. Local energy fairing of B-spline curves. preprint, [4] G. Farin and N. Sapidis. Curvature and fairness of curves and surfaces. IEEE CGA, 9:52-57, [5] G. Greiner. Surface construction based on variational principles. In P. J. Laurent, A. LeMéhauté, and L. L. Schumaker, editors, Curves and Surfaces II, Boston, AKPeters. [6] H. Hagen and G. Schulze. Automatic smoothing with geometric surface patches. CAGD, 4: , [7] J. Hoschek and D. Lasser. Grundlagen der geometrischen Datenverarbeitung. B. G. Teubner, Stuttgart, [8] W. Klingenberg. A Course in Differential Geometry. Springer-Verlag, Berlin Heidelberg, [9] E. T. Y. Lee. Energy, fairness, and a counterexample. CAD, 22:37-40, 1990.
12 C-154 G. Greiner / Variational Design and Fairing of Spline Surfaces [10] N.J. Lott and D.I. Pullin. Method for fairing B-spline surfaces. CAD, 22: , [11] M. Lounsberry, St. Mann, and T. DeRose. Parametric surface interpolation. IEEE Comp. Graphics Appl., 12:45-52, [12] H. P. Moreton and C. Séquin. Functional optimization for fair surface design. ACM Computer Graphics, 26: , [13] H. P. Moreton and C. H. Séquin. Scale-invariant minimum-cost curves: Fair and robust design implements. Computer Graphics Forum, 12 (3): , [14] W. Welch and A. Witkin. Variational surface design. ACM Computer Graphics, 26: , 1992.
Interpolating and approximating scattered 3D-data with hierarchical tensor product B-splines
Interpolating and approximating scattered 3D-data with hierarchical tensor product B-splines Günther Greiner Kai Hormann Abstract In this note we describe surface reconstruction algorithms based on optimization
More informationFairing Scalar Fields by Variational Modeling of Contours
Fairing Scalar Fields by Variational Modeling of Contours Martin Bertram University of Kaiserslautern, Germany Abstract Volume rendering and isosurface extraction from three-dimensional scalar fields are
More informationFilling Holes with B-spline Surfaces
Journal for Geometry and Graphics Volume 6 (22), No. 1, 83 98. Filling Holes with B-spline Surfaces Márta Szilvási-Nagy Department of Geometry, Budapest University of Technology and Economics Egry József
More informationAlmost Curvature Continuous Fitting of B-Spline Surfaces
Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University
More informationFairing Bicubic B-Spline Surfaces using Simulated Annealing
Fairing Bicubic B-Spline Surfaces using Simulated Annealing Stefanie Hahmann and Stefan Konz Abstract. In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing
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 informationAre isophotes and reflection lines the same?
Computer Aided Geometric Design 18 (001) 711 7 www.elsevier.com/locate/comaid Are isophotes and reflection lines the same? Holger Theisel University of Rostock, Computer Science Department, P.O. Box 999,
More informationlinearize discretize Galerkin optimize sample
Fairing by Finite Dierence Methods Leif Kobbelt Abstract. We propose an ecient and exible scheme to fairly interpolate or approximate the vertices of a given triangular mesh. Instead of generating a piecewise
More informationimplicit surfaces, approximate implicitization, B-splines, A- patches, surface fitting
24. KONFERENCE O GEOMETRII A POČÍTAČOVÉ GRAFICE ZBYNĚK ŠÍR FITTING OF PIECEWISE POLYNOMIAL IMPLICIT SURFACES Abstrakt In our contribution we discuss the possibility of an efficient fitting of piecewise
More informationNormals of subdivision surfaces and their control polyhedra
Computer Aided Geometric Design 24 (27 112 116 www.elsevier.com/locate/cagd Normals of subdivision surfaces and their control polyhedra I. Ginkel a,j.peters b,,g.umlauf a a University of Kaiserslautern,
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationGauss curvature. curvature lines, needle plot. vertices of progenitor solid are unit size. Construction Principle. edge. edge. vertex. Patch.
The Platonic Spheroids Jorg Peters and Leif Kobbelt Abstract. We present a gallery of simple curvature continuous surfaces that possess the topological structure of the Platonic solids. These spherelike
More informationContents. I The Basic Framework for Stationary Problems 1
page v Preface xiii I The Basic Framework for Stationary Problems 1 1 Some model PDEs 3 1.1 Laplace s equation; elliptic BVPs... 3 1.1.1 Physical experiments modeled by Laplace s equation... 5 1.2 Other
More informationarxiv: v1 [math.na] 20 Sep 2016
arxiv:1609.06236v1 [math.na] 20 Sep 2016 A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization P. Gangl 1,2 and U. Langer 3 1 Doctoral Program Comp.
More informationCurves and Surfaces for Computer-Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design A Practical Guide Fourth Edition Gerald Farin Department of Computer Science Arizona State University Tempe, Arizona /ACADEMIC PRESS I San Diego
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationCurve and Surface Fitting with Splines. PAUL DIERCKX Professor, Computer Science Department, Katholieke Universiteit Leuven, Belgium
Curve and Surface Fitting with Splines PAUL DIERCKX Professor, Computer Science Department, Katholieke Universiteit Leuven, Belgium CLARENDON PRESS OXFORD 1995 - Preface List of Figures List of Tables
More informationVisualizing High-Order Surface Geometry
1 Computer-Aided Design and Applications 2009 CAD Solutions, LLC http://www.cadanda.com Visualizing High-Order Surface Geometry Pushkar P. Joshi 1,2 and Carlo H. Séquin 2 1 Adobe Systems Inc., pushkarj@adobe.com
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 24
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 24 So in today s class, we will look at quadrilateral elements; and we will
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationGEOMETRIC LIBRARY. Maharavo Randrianarivony
GEOMETRIC LIBRARY Maharavo Randrianarivony During the last four years, I have maintained a numerical geometric library. The constituting routines, which are summarized in the following list, are implemented
More informationNormals of subdivision surfaces and their control polyhedra
Normals of subdivision surfaces and their control polyhedra I. Ginkel, a, J. Peters b, and G. Umlauf a, a University of Kaiserslautern, Germany b University of Florida, Gainesville, FL, USA Abstract For
More informationG 2 Interpolation for Polar Surfaces
1 G 2 Interpolation for Polar Surfaces Jianzhong Wang 1, Fuhua Cheng 2,3 1 University of Kentucky, jwangf@uky.edu 2 University of Kentucky, cheng@cs.uky.edu 3 National Tsinhua University ABSTRACT In this
More information(Refer Slide Time: 00:02:24 min)
CAD / CAM Prof. Dr. P. V. Madhusudhan Rao Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture No. # 9 Parametric Surfaces II So these days, we are discussing the subject
More informationDiscrete Coons patches
Computer Aided Geometric Design 16 (1999) 691 700 Discrete Coons patches Gerald Farin a,, Dianne Hansford b,1 a Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA b NURBS
More informationApproximation by NURBS curves with free knots
Approximation by NURBS curves with free knots M Randrianarivony G Brunnett Technical University of Chemnitz, Faculty of Computer Science Computer Graphics and Visualization Straße der Nationen 6, 97 Chemnitz,
More informationParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology
More informationConstruction and smoothing of triangular Coons patches with geodesic boundary curves
Construction and smoothing of triangular Coons patches with geodesic boundary curves R. T. Farouki, (b) N. Szafran, (a) L. Biard (a) (a) Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble,
More informationMA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces
MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces David L. Finn Today, we want to exam interpolation and data fitting problems for surface patches. Our general method is the same,
More informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More informationSpline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1
Spline Curves Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Problem: In the previous chapter, we have seen that interpolating polynomials, especially those of high degree, tend to produce strong
More information1.2 Numerical Solutions of Flow Problems
1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian
More information(Discrete) Differential Geometry
(Discrete) Differential Geometry Motivation Understand the structure of the surface Properties: smoothness, curviness, important directions How to modify the surface to change these properties What properties
More informationInterpolatory 3-Subdivision
EUROGRAPHICS 2000 / M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19 (2000), Number 3 Interpolatory 3-Subdivision U. Labsik G. Greiner Computer Graphics Group University of Erlangen-Nuremberg Am Weichselgarten
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More informationGeometric Registration for Deformable Shapes 2.2 Deformable Registration
Geometric Registration or Deormable Shapes 2.2 Deormable Registration Variational Model Deormable ICP Variational Model What is deormable shape matching? Example? What are the Correspondences? Eurographics
More informationG 2 Bezier Crust on Quad Subdivision Surfaces
Pacific Graphics (2013) B. Levy, X. Tong, and K. Yin (Editors) Short Papers G 2 Bezier Crust on Quad Subdivision Surfaces paper 1348 Figure 1: Two examples of Bezier crust applied on Catmull-Clark subdivision
More informationLecture 9: Introduction to Spline Curves
Lecture 9: Introduction to Spline Curves Splines are used in graphics to represent smooth curves and surfaces. They use a small set of control points (knots) and a function that generates a curve through
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 36
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 36 In last class, we have derived element equations for two d elasticity problems
More informationComputational Physics PHYS 420
Computational Physics PHYS 420 Dr Richard H. Cyburt Assistant Professor of Physics My office: 402c in the Science Building My phone: (304) 384-6006 My email: rcyburt@concord.edu My webpage: www.concord.edu/rcyburt
More informationEstimating normal vectors and curvatures by centroid weights
Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National
More informationApproximation of 3D-Parametric Functions by Bicubic B-spline Functions
International Journal of Mathematical Modelling & Computations Vol. 02, No. 03, 2012, 211-220 Approximation of 3D-Parametric Functions by Bicubic B-spline Functions M. Amirfakhrian a, a Department of Mathematics,
More informationQuadrilateral Remeshing
Quadrilateral Remeshing Kai Hormann Günther Greiner Computer Graphics Group, University of Erlangen-Nürnberg Am Weichselgarten 9, 91058 Erlangen, Germany Email: {hormann, greiner}@informatik.uni-erlangen.de
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationIntroduction to geometry
1 2 Manifolds A topological space in which every point has a neighborhood homeomorphic to (topological disc) is called an n-dimensional (or n-) manifold Introduction to geometry The German way 2-manifold
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationReparametrization of Interval Curves on Rectangular Domain
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:15 No:05 1 Reparametrization of Interval Curves on Rectangular Domain O. Ismail, Senior Member, IEEE Abstract The
More informationKnot Insertion and Reparametrization of Interval B-spline Curves
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:14 No:05 1 Knot Insertion and Reparametrization of Interval B-spline Curves O. Ismail, Senior Member, IEEE Abstract
More informationSOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS
SOLVING PARTIAL DIFFERENTIAL EQUATIONS ON POINT CLOUDS JIAN LIANG AND HONGKAI ZHAO Abstract. In this paper we present a general framework for solving partial differential equations on manifolds represented
More informationA generalized conversion matrix between non-uniform B-spline and Bézier representations with applications in CAGD
A generalized conversion matrix between non-uniform B-spline and Bézier representations with applications in CAGD Giulio Casciola, Lucia Romani Department of Mathematics, University of Bologna, P.zza di
More informationComputer Graphics Curves and Surfaces. Matthias Teschner
Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves
More informationDiscrete Differential Geometry. Differential Geometry
Discrete Differential Geometry Yiying Tong CSE 891 Sect 004 Differential Geometry Why do we care? theory: special surfaces minimal, CMC, integrable, etc. computation: simulation/processing Grape (u. of
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationOn the Dimension of the Bivariate Spline Space S 1 3( )
On the Dimension of the Bivariate Spline Space S 1 3( ) Gašper Jaklič Institute of Mathematics, Physics and Mechanics University of Ljubljana Jadranska 19, 1000 Ljubljana, Slovenia Gasper.Jaklic@fmf.uni-lj.si
More informationON INDEX EXPECTATION AND CURVATURE FOR NETWORKS
ON INDEX EXPECTATION AND CURVATURE FOR NETWORKS OLIVER KNILL Abstract. We prove that the expectation value of the index function i f (x) over a probability space of injective function f on any finite simple
More informationPositivity Preserving Interpolation of Positive Data by Rational Quadratic Trigonometric Spline
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 2 Ver. IV (Mar-Apr. 2014), PP 42-47 Positivity Preserving Interpolation of Positive Data by Rational Quadratic
More information15.10 Curve Interpolation using Uniform Cubic B-Spline Curves. CS Dept, UK
1 An analysis of the problem: To get the curve constructed, how many knots are needed? Consider the following case: So, to interpolate (n +1) data points, one needs (n +7) knots,, for a uniform cubic B-spline
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationAssignment 8; Due Friday, March 10
Assignment 8; Due Friday, March 10 The previous two exercise sets covered lots of material. We ll end the course with two short assignments. This one asks you to visualize an important family of three
More informationFlank Millable Surface Design with Conical and Barrel Tools
461 Computer-Aided Design and Applications 2008 CAD Solutions, LLC http://www.cadanda.com Flank Millable Surface Design with Conical and Barrel Tools Chenggang Li 1, Sanjeev Bedi 2 and Stephen Mann 3 1
More informationp y = 0 x c Figure : Stereographic projection. r p p y = 0 c p Figure : Central projection. Furthermore, we will discuss representations of entire sph
Circle and Sphere as rational splines Claudia Bangert and Hartmut Prautzsch Universitat Karlsruhe, Fakultat fur Informatik D-8 Karlsruhe, Germany corresponding author, e-mail: prau@ira.uka.de Abstract
More information05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo
05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated
More informationChapter 13. Boundary Value Problems for Partial Differential Equations* Linz 2002/ page
Chapter 13 Boundary Value Problems for Partial Differential Equations* E lliptic equations constitute the third category of partial differential equations. As a prototype, we take the Poisson equation
More informationMotivation. Parametric Curves (later Surfaces) Outline. Tangents, Normals, Binormals. Arclength. Advanced Computer Graphics (Fall 2010)
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 19: Basic Geometric Concepts and Rotations Ravi Ramamoorthi http://inst.eecs.berkeley.edu/~cs283/fa10 Motivation Moving from rendering to simulation,
More informationLacunary Interpolation Using Quartic B-Spline
General Letters in Mathematic, Vol. 2, No. 3, June 2017, pp. 129-137 e-issn 2519-9277, p-issn 2519-9269 Available online at http:\\ www.refaad.com Lacunary Interpolation Using Quartic B-Spline 1 Karwan
More informationGenerating Airplane Wings for Numerical Simulation and Manufacturing
Generating Airplane Wings for Numerical Simulation and Manufacturing Karl-Heinz Brakhage Philipp Lamby Institute of Geometry and Applied Mathematics RWTH Aachen, University of Technology D-52056 Aachen,
More informationSnakes reparameterization for noisy images segmentation and targets tracking
Snakes reparameterization for noisy images segmentation and targets tracking Idrissi Sidi Yassine, Samir Belfkih. Lycée Tawfik Elhakim Zawiya de Noaceur, route de Marrakech, Casablanca, maroc. Laboratoire
More informationGeodesic and curvature of piecewise flat Finsler surfaces
Geodesic and curvature of piecewise flat Finsler surfaces Ming Xu Capital Normal University (based on a joint work with S. Deng) in Southwest Jiaotong University, Emei, July 2018 Outline 1 Background Definition
More informationMATHEMATICAL ANALYSIS, MODELING AND OPTIMIZATION OF COMPLEX HEAT TRANSFER PROCESSES
MATHEMATICAL ANALYSIS, MODELING AND OPTIMIZATION OF COMPLEX HEAT TRANSFER PROCESSES Goals of research Dr. Uldis Raitums, Dr. Kārlis Birģelis To develop and investigate mathematical properties of algorithms
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationMOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH. Anton GFRERRER 1 1 University of Technology, Graz, Austria
MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH Anton GFRERRER 1 1 University of Technology, Graz, Austria Abstract. The following geometric problem originating from an engineering
More informationLecture 3.2 Methods for Structured Mesh Generation
Lecture 3.2 Methods for Structured Mesh Generation 1 There are several methods to develop the structured meshes: Algebraic methods, Interpolation methods, and methods based on solving partial differential
More informationA Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
Scientific Papers, University of Latvia, 2010. Vol. 756 Computer Science and Information Technologies 207 220 P. A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings
More informationAdaptive and Smooth Surface Construction by Triangular A-Patches
Adaptive and Smooth Surface Construction by Triangular A-Patches Guoliang Xu Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, China Abstract
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More informationMultidimensional scaling
Multidimensional scaling Lecture 5 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Cinderella 2.0 2 If it doesn t fit,
More informationNon-Linear Finite Element Methods in Solid Mechanics Attilio Frangi, Politecnico di Milano, February 3, 2017, Lesson 1
Non-Linear Finite Element Methods in Solid Mechanics Attilio Frangi, attilio.frangi@polimi.it Politecnico di Milano, February 3, 2017, Lesson 1 1 Politecnico di Milano, February 3, 2017, Lesson 1 2 Outline
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationSubdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches Fuhua Frank Cheng,GangChen, and Jun-Hai Yong University of Kentucky, Lexington, KY, USA Tsinghua University, Beijing,
More informationFitting Uncertain Data with NURBS
Fitting Uncertain Data with NURBS Wolfgang Heidrich, Richard Bartels, George Labahn Abstract. Fitting of uncertain data, that is, fitting of data points that are subject to some error, has important applications
More informationCEG477/CEG677. Computer Graphics II
CEG477/CEG677 Computer Graphics II 0-1 Outline 0 Introduction 1 Three-Dimensional Object Representations 2 Visible-Surface Detection Methods 3 Illumination Models and Surface-Rendering Methods 4 Interactive
More informationLectures in Discrete Differential Geometry 3 Discrete Surfaces
Lectures in Discrete Differential Geometry 3 Discrete Surfaces Etienne Vouga March 19, 2014 1 Triangle Meshes We will now study discrete surfaces and build up a parallel theory of curvature that mimics
More informationKai Hormann, N. Sukumar. Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics
Kai Hormann, N. Sukumar Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics Contents Chapter 1 Multi-Sided Patches via Barycentric Coordinates 1 Scott Schaefer 1.1 INTRODUCTION
More informationSpline Functions on Triangulations
Spline Functions on Triangulations MING-JUN LAI AND LARRY L. SCHUMAKER CAMBRIDGE UNIVERSITY PRESS Contents Preface xi Chapter 1. Bivariate Polynomials 1.1. Introduction 1 1.2. Norms of Polynomials on Triangles
More informationScale Space and PDE methods in image analysis and processing. Arjan Kuijper
Scale Space and PDE methods in image analysis and processing Arjan Kuijper Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, 64283
More informationCOMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg
COMPUTER AIDED GEOMETRIC DESIGN Thomas W. Sederberg January 31, 2011 ii T. W. Sederberg iii Preface This semester is the 24 th time I have taught a course at Brigham Young University titled, Computer Aided
More informationOn Smooth Bicubic Surfaces from Quad Meshes
On Smooth Bicubic Surfaces from Quad Meshes Jianhua Fan and Jörg Peters Dept CISE, University of Florida Abstract. Determining the least m such that one m m bi-cubic macropatch per quadrilateral offers
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIQKI VESNIK Corrected proof Available online 01.10.2016 originalni nauqni rad research paper THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this paper
More informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationSurfaces, meshes, and topology
Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh
More informationRegularity Analysis of Non Uniform Data
Regularity Analysis of Non Uniform Data Christine Potier and Christine Vercken Abstract. A particular class of wavelet, derivatives of B-splines, leads to fast and ecient algorithms for contours detection
More informationOn-Line Geometric Modeling Notes REFINEMENT
On-Line Geometric Modeling Notes REFINEMENT Kenneth I Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview Bézier curves, B-spline curves
More informationIn this lecture we introduce the Gauss-Bonnet theorem. The required section is The optional sections are
Math 348 Fall 2017 Lectures 20: The Gauss-Bonnet Theorem II Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams.
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationScientific Computing: Interpolation
Scientific Computing: Interpolation Aleksandar Donev Courant Institute, NYU donev@courant.nyu.edu Course MATH-GA.243 or CSCI-GA.22, Fall 25 October 22nd, 25 A. Donev (Courant Institute) Lecture VIII /22/25
More informationCS 523: Computer Graphics, Spring Shape Modeling. Differential Geometry of Surfaces
CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry of Surfaces Andrew Nealen, Rutgers, 2011 2/22/2011 Differential Geometry of Surfaces Continuous and Discrete Motivation Smoothness
More informationA New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes
A New Smoothing Algorithm for Quadrilateral and Hexahedral Meshes Sanjay Kumar Khattri Department of Mathematics, University of Bergen, Norway sanjay@mi.uib.no http://www.mi.uib.no/ sanjay Abstract. Mesh
More informationExcerpt from the Proceedings of the COMSOL Conference 2010 Paris
Excerpt from the Proceedings of the COMSOL Conference 2010 Paris Simulation of Flaw Signals in a Magnetic Flux Leakage Inspection Procedure O. Nemitz * and T. Schmitte Salzgitter Mannesmann Forschung GmbH
More informationShape fitting and non convex data analysis
Shape fitting and non convex data analysis Petra Surynková, Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 186 7 Praha 8, Czech Republic email: petra.surynkova@mff.cuni.cz,
More information