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 singl...

Full description

Bibliographic Details

Published in:	Computer graphics forum Vol. 32; no. 5; pp. 157 - 166
Main Authors:	Zou, Ming, Ju, Tao, Carr, Nathan
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.08.2013
Subjects:	3-D graphics Algorithms Approximation Computer graphics Computer science Feeding Mathematical models Optimization Polygons Studies Three dimensional Triangles United States > US
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!