Deformable spanners and applications

DMCA

Deformable spanners and applications (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jie Gao , Leonidas J. Guibas , An Nguyen

Venue:	In Proc. of the 20th ACM Symposium on Computational Geometry (SoCG’04
Citations:	49 - 6 self

BibTeX

@INPROCEEDINGS{Gao04deformablespanners,
    author = {Jie Gao and Leonidas J. Guibas and An Nguyen},
    title = {Deformable spanners and applications},
    booktitle = {In Proc. of the 20th ACM Symposium on Computational Geometry (SoCG’04},
    year = {2004},
    pages = {179--199}
}

OpenURL

Abstract

For a set S of points in R d,ans-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidean distance between the points. In this paper we propose a new sparse (1 + ε)-spanner with O(n/ε d) edges, where ε is a specified parameter. The key property of this spanner is that it can be efficiently maintained under dynamic insertion or deletion of points, as well as under continuous motion of the points in both the kinetic data structures setting and in the more realistic blackbox displacement model we introduce. Our deformable spanner succinctly encodes all proximity information in a deforming point cloud, giving us efficient kinetic algorithms for problems such as the closest pair, the near neighbors of all points, approximate nearest neighbor search (aka approximate Voronoi diagram), well-separated pair decomposition, and approximate k-centers. 1

Keyphrases

deformable spanner specified parameter continuous motion total length euclidean distance key property near neighbor kinetic data structure deforming point cloud new sparse realistic blackbox displacement model dynamic insertion approximate k-centers neighbor search well-separated pair decomposition efficient kinetic algorithm aka approximate voronoi diagram proximity information

DMCA