138 search results - page 2 / 28 » K-Guarding Polygons on the Plane |
75
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
82
Voted
DCC
2000
IEEE
14 years 10 months ago
2000
IEEE
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...