An Algorithm for Triangulating Multiple 3D Polygons

Simple item page
dc.contributor.authorZou, Mingen_US
dc.contributor.authorJu, Taoen_US
dc.contributor.authorCarr, Nathanen_US
dc.contributor.editorYaron Lipman and Hao Zhangen_US
dc.date.accessioned2015-02-28T15:51:08Z
dc.date.available2015-02-28T15:51:08Z
dc.date.issued2013en_US
dc.description.abstractWe 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.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/cgf.12182en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12182en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleAn Algorithm for Triangulating Multiple 3D Polygonsen_US
Files
Collections
32-Issue 5
SGP13: Eurographics Symposium on Geometry Processing (CGF 32-5)