Anisotropic surface meshing

We study the problem of triangulating a smooth closed implicit surface Σ endowed with a 2D metric tensor that varies over Σ. This is commonly known as the anisotropic surface meshing problem. We extend the 2D metric tensor naturally to 3D and employ the 3D anisotropic Voronoi diagram of a set P of samples on Σ to triangulate Σ. We prove that a restricted dual, Mesh P, is a valid triangulation homeomorphic to Σ under appropriate conditions. We also develop an algorithm for constructing P and Mesh P. In addition to being homeomorphic to Σ, each triangle in Mesh P is well-shaped when measured using the 3D metric tensors of its vertices. Users can set upper bounds on the anisotropic edge lengths and the angles between the surface normals at vertices and the normals of incident triangles (measured both isotropically and anisotropically).

[1]  Steven J. Owen,et al.  Advancing Front Surface Mesh Generation in Parametric Space Using a Riemannian Surface Definition , 1998, IMR.

[2]  David Letscher,et al.  Delaunay triangulations and Voronoi diagrams for Riemannian manifolds , 2000, SCG '00.

[3]  Jean-Daniel Boissonnat,et al.  Isotopic Implicit Surface Meshing , 2004, STOC '04.

[4]  Jonathan Richard Shewchuk,et al.  Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation , 2003, SCG '03.

[5]  Steve Oudot,et al.  Provably Good Surface Sampling and Approximation , 2003, Symposium on Geometry Processing.

[6]  Jean-Christophe Cuillière.  An adaptive method for the automatic triangulation of 3D parametric surfaces , 1998, Comput. Aided Des..

[7]  A. James Stewart,et al.  Curvature-Dependent Triangulation of Implicit Surfaces , 2001, IEEE Computer Graphics and Applications.

[8]  Pierre Alliez,et al.  Anisotropic polygonal remeshing , 2003, ACM Trans. Graph..

[9]  Sunghee Choi,et al.  A Simple Algorithm for Homeomorphic Surface Reconstruction , 2002, Int. J. Comput. Geom. Appl..

[10]  Tamal K. Dey,et al.  Sampling and Meshing a Surface with Guaranteed Topology and Geometry , 2007, SIAM J. Comput..

[11]  Micha Sharir.  Almost tight upper bounds for lower envelopes in higher dimensions , 1994, Discret. Comput. Geom..

[12]  Jean-Daniel Boissonnat,et al.  Natural neighbor coordinates of points on a surface , 2001, Comput. Geom..

[13]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[14]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[15]  Mariette Yvinec,et al.  Anisotropic Diagrams: Labelle Shewchuk approach revisited , 2005, CCCG.

[16]  Ho-Lun Cheng,et al.  Dynamic Skin Triangulation , 2001, SODA '01.

[17]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..