179 search results - page 8 / 36 » On Approximating the Average Distance Between Points |
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
WG
2010
Springer
13 years 5 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
CCCG
2007
13 years 8 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
TSMC
1998
13 years 7 months ago
1998
—In this paper, we propose the volume between two surfaces normalized by the surface area (interpreted as average distance between two surfaces) as an invariant quantitative meas...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...