32 search results - page 2 / 7 » Coverage Diameters of Polygons |
DCG
2006
13 years 4 months ago
2006
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract— We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity...
TJS
2002
13 years 4 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
JCT
2011
12 years 11 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
ALENEX
2007
13 years 6 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...