100 search results - page 7 / 20 » A simple entropy-based algorithm for planar point location |
STOC
2005
ACM
14 years 11 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
VTC
2008
IEEE
14 years 5 months ago
2008
IEEE
—This paper investigates the potential for future multiple antenna wireless local area network technologies such as 802.11n to perform indoor network-based positioning using angl...
ESA
2008
Springer
14 years 16 days ago
2008
Springer
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
COMGEO
2006
ACM
13 years 10 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...