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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of computing and information technology Ročník 8; číslo 4; s. 319 - 331
Hlavní autori: Lamot, Marko, alik, Borut
Médium: Journal Article Paper
Jazyk:English
Vydavateľské údaje: Zagreb University Computing Centre 2000
Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 diagonal inserting, algorithms based on Delaunay triangulation, and the algorithms using Steiner points. The paper briefly explains the most popular algorithms from each group and summarizes thecommon features of the groups. After that four algorithms based on diagonals insertion are tested: a recursive diagonal inserting algorithm, an ear cutting algorithm, Kong's Graham scan algorithm, and Seidel'srandomized incremental algorithm. An analysis concerning speed, the quality of the output triangles and the ability to handle holes is doneat the end. (Original abstract)
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
44830
ISSN:1330-1136
1846-3908
DOI:10.2498/cit.2000.04.07