138 search results - page 16 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— We introduce an algorithm which detects and traces a specified level set of a scalar field (a contour) on a plane. A network of static sensor nodes with limited communication...
IEEECSA
2009
13 years 5 months ago
2009
In this paper, we present a fine-grained localization algorithm for wireless sensor networks using a mobile beacon node. The algorithm is based on distance measurement using RSSI. ...
CAD
2005
Springer
13 years 7 months ago
2005
Springer
This paper presents a robust and efficient surface flattening approach based on fitting a woven-like mesh model on a 3D freeform surface. The fitting algorithm is based on tendon ...
FOCS
2008
IEEE
14 years 2 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 ...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...