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

Celý popis

Podrobná bibliografia

Vydané v:	Computer graphics forum Ročník 32; číslo 5; s. 157 - 166
Hlavní autori:	Zou, Ming, Ju, Tao, Carr, Nathan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford, UK Blackwell Publishing Ltd 01.08.2013
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!