hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2000.04.07

A Contribution to Triangulation Algorithms for Simple Polygons

Borut Žalik
Marko Lamot

Puni tekst: engleski, pdf (764 KB) str. 319-331 preuzimanja: 2.209* citiraj
APA 6th Edition
Žalik, B. i Lamot, M. (2000). A Contribution to Triangulation Algorithms for Simple Polygons. Journal of computing and information technology, 8 (4), 319-331. https://doi.org/10.2498/cit.2000.04.07
MLA 8th Edition
Žalik, Borut i Marko Lamot. "A Contribution to Triangulation Algorithms for Simple Polygons." Journal of computing and information technology, vol. 8, br. 4, 2000, str. 319-331. https://doi.org/10.2498/cit.2000.04.07. Citirano 28.02.2021.
Chicago 17th Edition
Žalik, Borut i Marko Lamot. "A Contribution to Triangulation Algorithms for Simple Polygons." Journal of computing and information technology 8, br. 4 (2000): 319-331. https://doi.org/10.2498/cit.2000.04.07
Harvard
Žalik, B., i Lamot, M. (2000). 'A Contribution to Triangulation Algorithms for Simple Polygons', Journal of computing and information technology, 8(4), str. 319-331. https://doi.org/10.2498/cit.2000.04.07
Vancouver
Žalik B, Lamot M. A Contribution to Triangulation Algorithms for Simple Polygons. Journal of computing and information technology [Internet]. 2000 [pristupljeno 28.02.2021.];8(4):319-331. https://doi.org/10.2498/cit.2000.04.07
IEEE
B. Žalik i M. Lamot, "A Contribution to Triangulation Algorithms for Simple Polygons", Journal of computing and information technology, vol.8, br. 4, str. 319-331, 2000. [Online]. https://doi.org/10.2498/cit.2000.04.07

Sažetak
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 the common 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’s randomized incremental algorithm. An analysis concerning speed, the quality of the output triangles and the ability to handle holes is done at the end.

Hrčak ID: 44830

URI
https://hrcak.srce.hr/44830

Posjeta: 2.394 *