18 search results - page 3 / 4 » Convexifying Monotone Polygons |
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
If a smooth, closed, and embedded curve is deformed along its normal vector field at a rate proportional to its curvature, it shrinks to a circular point. This curve evolution is ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
HYBRID
2009
Springer
13 years 10 months ago
2009
Springer
This paper proposes a distributed coordination algorithm for robotic sensor networks to detect boundaries that separate areas of abrupt change of spatial phenomena. We consider an ...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...