138 search results - page 6 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
IJRA
2011
13 years 2 months ago
2011
We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
FOCS
1999
IEEE
14 years 5 days ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
GIS
2006
ACM
14 years 9 months ago
2006
ACM
Location information gathered from a variety of sources in the form of sensor data, video streams, human observations, and so on, is often imprecise and uncertain and needs to be ...
DIMACS
2001
13 years 9 months ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...