Abstract
The decomposition of planar polygons into triangles is a well studied area of Computer Graphics with particular relevance to GIS. Trapezoidation is often performed as a first step to triangulation. Though a linear time algorithm [2] for the decomposition of a simple polygon into triangles exists, it is extremely complicated and in practice O(n log n) algorithms are used. We present a very simple O(n)-time heuristics for the trapezoidation of simple polygons without holes. Such polygons commonly occur in Geographic Information Systems (GIS) databases. © Springer-Verlag 2002.
Cite
CITATION STYLE
Lorenzetto, G. P., & Datta, A. (2002). A linear time heuristics for trapezoidation of GIS polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2331 LNCS, pp. 75–84). Springer Verlag. https://doi.org/10.1007/3-540-47789-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
