25 search results - page 2 / 5 » Triangulating a Simple Polygon in Linear Time |
123
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
121
click to vote
PAMI
2002
15 years 1 months ago
2002
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
114
click to vote
ESA
2010
Springer
15 years 2 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
121
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
117
Voted
IJRR
2002
15 years 1 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...