A Contribution to Triangulation Algorithms for Simple Polygons

Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. The known algorithms for polygon triangulation can be classified into three groups: algorithms based on diago...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computing and information technology Jg. 8; H. 4; S. 319 - 331
Hauptverfasser:	Lamot, Marko, alik, Borut
Format:	Journal Article Paper
Sprache:	Englisch
Veröffentlicht:	Zagreb University Computing Centre 2000 Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Schlagworte:	Algorithms Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Pattern recognition. Digital image processing. Computational geometry Simple polygons Triangulation Computational geometry Speed Triangulation Randomized design Diagonal matrix Geographic information system Recursive algorithm
ISSN:	1330-1136, 1846-3908
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!