Decomposing a Simple Polygon into Trapezoids

9 years 8 months ago
Decomposing a Simple Polygon into Trapezoids
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.
Fajie Li, Reinhard Klette
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CAIP
Authors Fajie Li, Reinhard Klette
Comments (0)