25 search results - page 1 / 5 » Triangulating a Simple Polygon in Linear Time |
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
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)...
FOCS
1990
IEEE
13 years 8 months ago
1990
IEEE
COMPGEOM
1993
ACM
13 years 8 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
CCCG
2008
13 years 6 months ago
2008
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, w...
SIROCCO
2001
13 years 6 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...