Chazelle's triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon). This paper provides an alternative method for subdividing a simple polygon into "basic shapes", using trapezoids instead of triangles. The authors consider the presented method as being substantially simpler than the linear-time triangulation method. However, it requires a sorting step (of a subset of vertices of the given simple polygon); all the other subprocesses are linear time. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Li, F., & Klette, R. (2007). Decomposing a simple polygon into trapezoids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 726–733). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_90
Mendeley helps you to discover research relevant for your work.