An algorithm for triangulating multiple 3D polygons

We present an algorithm for obtaining a triangulation of multiple, non‐planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angles between adjacent triangles. Our algorithm generalizes a classical method for optimally triangulating a single polygon. The key novelty is a mechanism for avoiding non‐manifold outputs for two and more input polygons without compromising optimality. For better performance on real‐world data, we also propose an approximate solution by feeding the algorithm with a reduced set of triangles. In particular, we demonstrate experimentally that the triangles in the Delaunay tetrahedralization of the polygon vertices offer a reasonable trade off between performance and optimality.

[1]  Christian Borgelt,et al.  Minimum Weight Triangulation by Cutting Out Triangles , 2005, ISAAC.

[2]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, SIGGRAPH.

[3]  Alla Sheffer,et al.  Design-driven quadrangulation of closed 3D curves , 2012, ACM Trans. Graph..

[4]  Hang Si,et al.  TetGen: A quality tetrahedral mesh generator and a 3D Delaunay triangulator (Version 1.5 --- User's Manual) , 2013 .

[5]  Peter Liepa,et al.  Filling Holes in Meshes , 2003, Symposium on Geometry Processing.

[6]  Leonidas J. Guibas,et al.  A hierarchical method for real-time distance computation among moving convex bodies , 2000, Comput. Geom..

[7]  Micha Sharir,et al.  Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..

[8]  David Eppstein,et al.  On triangulating three-dimensional polygons , 1996, SCG '96.

[9]  Tao Ju,et al.  Fixing Geometric Errors on Polygonal Models: A Survey , 2009, Journal of Computer Science and Technology.

[10]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.

[11]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from unorganized cross-sections , 2007, Symposium on Geometry Processing.

[12]  Gerhard Roth,et al.  An Efficient Volumetric Method for Building Closed Triangular Meshes from 3-D Image and Point Data , 1997, Graphics Interface.

[13]  Michael T. Goodrich,et al.  Straight-skeleton based contour interpolation , 2003, SODA '03.

[14]  Jack Snoeyink,et al.  Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL , 2007, Comput. Geom..

[15]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[16]  Kenneth Rose,et al.  Eurographics Symposium on Geometry Processing (2007) Developable Surfaces from Arbitrary Sketched Boundaries , 2022 .

[17]  Lu Liu,et al.  Surface Reconstruction From Non‐parallel Curve Networks , 2008, Comput. Graph. Forum.

[18]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[19]  Marco Attene,et al.  Polygon mesh repairing: An application perspective , 2013, CSUR.

[20]  Ravin Balakrishnan,et al.  ILoveSketch: as-natural-as-possible sketching system for creating 3d curve models , 2008, UIST '08.

[21]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[22]  Jonathan Richard Shewchuk,et al.  Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.

[23]  Raimund Seidel.  Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons , 2010, Comput. Geom..