Optimising Triangulated Polyhedral Surfaces with Self-intersections

We discuss an optimisation procedure for triangulated polyhedral surfaces (referred to as (2-3)D triangulations) which allows us to process self–intersecting surfaces. As an optimality criterion we use minimisation of total absolute extrinsic curvature (MTAEC) and as a local transformation – a diagonal flip, defined in a proper way for (2-3)D triangulations. This diagonal flip is a natural generalisation of the diagonal flip operation in 2D, known as Lawson’s procedure. The difference is that the diagonal flip operation in (2-3)D triangulations may produce self-intersections. We analyze the optimisation procedure for (2-3)D closed triangulations, taking into account possible self–intersections. This analysis provides a general insight on the structure of triangulations, allows to characterise the types of self–intersections, as well as the conditions for global convergence of the algorithm. It provides also a new view on the concept of optimisation on the whole and is useful in the analysis of global and local convergence for other optimisation algorithms. At the end we present an efficient implementation of the optimality procedure for (2-3)D triangulations of the data, situated in the convex position, and conjecture possible results of this procedure for non–convex data.

[1]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[2]  Wolfgang Kühnel,et al.  Smooth approximation of polyhedral surfaces with respect to curvature measures , 1981 .

[3]  Jörn Mehnen,et al.  New Solutions for Surface Reconstruction from Discrete Point Data by Means of Computational Intelligence , 1998 .

[4]  Charles L. Lawson,et al.  Transforming triangulations , 1972, Discret. Math..

[5]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[6]  Lyuba Alboul,et al.  On Flips in Polyhedral Surfaces: a new development , 2002 .

[7]  P. Krsek.  Algorithms for Computing Curvatures from Range Data , 2001 .

[8]  L. Kobbelt.  Fairing by finite difference methods , 1998 .

[9]  Paolo Cignoni,et al.  A low cost optical 3D scanner , 2001, Comput. Graph. Forum.

[10]  Paolo Cignoni,et al.  A low cost 3D scanner based on structured light , 2001 .

[11]  Michela Spagnuolo,et al.  A new method for the characterization of topographic surfaces , 1991, Int. J. Geogr. Inf. Sci..

[12]  Nira Dyn,et al.  Transforming triangulations in polygonal domains , 1993, Comput. Aided Geom. Des..

[13]  Seiya Negami.  DIAGONAL FLIPS OF TRIANGULATIONS ON SURFACES, A SURVEY , 1999 .

[14]  Lyuba Alboul,et al.  Polyhedral Metrics in Surface Reconstruction , 1994, IMA Conference on the Mathematics of Surfaces.

[15]  Lyuba Alboul,et al.  Polyhedral metrics in surface reconstruction: tight triangulations , 1995 .

[16]  Y. Yoon,et al.  Triangulation of scattered data in 3D space , 1988 .

[17]  C. Traas,et al.  Best data-dependent triangulations , 2000 .

[18]  Wolfgang Kühnel,et al.  Tight Polyhedral Submanifolds and Tight Triangulations , 1995 .

[19]  Leif Kobbelt,et al.  Towards robust broadcasting of geometry data , 2002, Comput. Graph..

[20]  George K. Francis.  A Topological Picturebook , 1988 .

[21]  Mark Meyer,et al.  Interactive geometry remeshing , 2002, SIGGRAPH.

[22]  Lyuba Alboul,et al.  On Flips in Polyhedral Surfaces , 2002, Int. J. Found. Comput. Sci..