An algorithm for triangulating multiple 3D polygons
Article first published online: 19 AUG 2013
© 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
Computer Graphics Forum
Volume 32, Issue 5, pages 157–166, August 2013
How to Cite
Zou, M., Ju, T. and Carr, N. (2013), An algorithm for triangulating multiple 3D polygons. Computer Graphics Forum, 32: 157–166. doi: 10.1111/cgf.12182
- Issue published online: 19 AUG 2013
- Article first published online: 19 AUG 2013
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.