346 search results - page 7 / 70 » Isodiametric Problems for Polygons |
CCCG
2008
13 years 8 months ago
2008
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent ortho...
CCCG
2009
13 years 8 months ago
2009
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
CCCG
2001
13 years 8 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
ALGORITHMICA
2005
13 years 7 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
AAIM
2009
Springer
14 years 2 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...