Decomposing a simple polygon into trapezoids

Authors:
Fajie Li;Reinhard Klette
Affiliations:
Computer Science Department, The University of Auckland, Auckland, New Zealand;Computer Science Department, The University of Auckland, Auckland, New Zealand
Venue:
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Year:
2007

Citing 2
Cited 0

Triangulating a simple polygon in linear time

Discrete & Computational Geometry
Finding the shortest path between two points in a simple polygon by applying a rubberband algorithm

PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.