1672 search results - page 307 / 335 » Tightness problems in the plane |
SODA
1997
ACM
13 years 10 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
ADHOCNOW
2009
Springer
13 years 9 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
SMA
2008
ACM
13 years 8 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
IJRR
2002
13 years 8 months ago
2002
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...