100 search results - page 13 / 20 » A simple entropy-based algorithm for planar point location |
ICRA
2007
IEEE
14 years 5 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...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
VLDB
2008
ACM
14 years 11 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
COMGEO
2006
ACM
13 years 10 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...