Deformable spanners and applications

Computational Geometry: Theory and Applications

Volumn 35, Issue 1-2 SPEC. ISS., 2006, Pages 2-19

  Gao, Jie ^a   Guibas, Leonidas J ^b   Nguyen, An ^b  

^a Stony Brook University   (United States)

^b Stanford University   (United States)

Author keywords

Approximate nearest neighbor; Collision detection; Geometric k center; Kinetic data structures; Proximity maintenance; Spanner graphs; Well separated pair decomposition

Indexed keywords

EID: 33646785086     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.10.001     Document Type: Conference Paper

References (36)

1. P. Agarwal, J. Basch, L. Guibas, J. Hershberger, and L. Zhang Deformable free space tilings for kinetic collision detection Internat. J. Robot. Res. 21 3 2002 179 197
2. S. Arya, G. Das, D.M. Mount, J.S. Salowe, M. Smid, Euclidean spanners: Short, thin, and lanky, in: Proc. 27th ACM Symposium on Theory Computing, 1995, pp. 489-498
3. S. Arya, T. Malamatos, Linear-size approximate Voronoi diagrams, in: Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 147-155
4. S. Arya, T. Malamatos, D.M. Mount, Space-efficient approximate Voronoi diagrams, in: Proc. of the 34th ACM Symposium on Theory of Computing, 2002, pp. 721-730
5. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu An optimal algorithm for approximate nearest neighbor searching fixed dimensions J. ACM 45 6 1998 891 923
6. S. Arya, D.M. Mount, M. Smid, Randomized and deterministic algorithms for geometric spanners of small diameter, in: Proc. 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 703-712
7. S. Arya, and M. Smid Efficient construction of a bounded-degree spanner with low weight Algorithmica 17 1997 33 54
8. J. Basch, L. Guibas, and J. Hershberger Data structures for mobile data J. Alg. 31 1 1999 1 28
9. Callahan, Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, in: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 291-300
10. P.B. Callahan, Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, in: Proc. 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 332-340
11. P.B. Callahan, S.R. Kosaraju, Algorithms for dynamic closest-pair and n-body potential fields, in: Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 263-272
12. P.B. Callahan, and S.R. Kosaraju A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields J. ACM 42 1995 67 90
13. M.T. Dickerson, R.L. Drysdale, and J.R. Sack Simple algorithms for enumerating interpoint distances and finding k nearest neighbors Internat. J. Comput. Geom. Appl. 2 3 1992 221 239
14. D. Eppstein Spanning trees and spanners J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science Publishers B.V., North-Holland Amsterdam 425 461
15. J. Erickson, Dense point sets have sparse Delaunay triangulations, in: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 125-134
16. T. Feder, D.H. Greene, Optimal algorithms for approximate clustering, in: Proc. 20th Annu. ACM Symposium on Theory Comput., 1988, pp. 434-444
17. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu Discrete mobile centers Discrete Comput. Geom. 30 1 2003 45 63
18. J. Gao, L.J. Guibas, A. Nguyen, Distributed proximity maintenance in ad hoc mobile networks, in: Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), 2005, pp. 4-19
19. T. Gonzalez Clustering to minimize the maximum intercluster distance Theoret. Comput. Sci. 38 1985 293 306
20. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, M. Smid, Approximate distance oracles for geometric graphs, in: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 828-837
21. L. Guibas, A. Nguyen, D. Russel, L. Zhang, Collision detection for deforming necklaces, in: Proc. 18th ACM Symposium on Computational Geometry, 2002, pp. 33-42
22. L.J. Guibas Kinetic data structures - a state of the art report P.K. Agarwal, L.E. Kavraki, M. Mason, Proc. Workshop Algorithmic Found. Robot. 1998 A.K. Peters Wellesley, MA 191 209
23. A. Gupta, R. Krauthgamer, J.R. Lee, Bounded geometries, fractals, and low-distortion embeddings, in: Proc. the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 534-543
24. J. Hershberger, Smooth kinetic maintenance of clusters, in: Proc. ACM Symposium on Computational Geometry, 2003, pp. 48-57
25. P. Indyk, R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, in: Proc. 30th Annu. ACM Sympos. Theory Comput., 1998, pp. 604-613
26. R. Krauthgamer, and J.R. Lee Navigating nets: Simple algorithms for proximity search Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2004 Society for Industrial and Applied Mathematics 798 807
27. H.P. Lenhof, and M. Smid Sequential and parallel algorithms for the k closest pairs problem Internat. J. Comput. Geom. Appl. 5 1995 273 288
28. C. Levcopoulos, G. Narasimhan, and M.H.M. Smid Improved algorithms for constructing fault-tolerant spanners Algorithmica 32 1 2002 144 156
29. M.C. Lin, J.F. Canny, A fast algorithm for incremental distance calculation, in: IEEE International Conference on Robotics and Automation, 1991, pp. 1008-1014
30. I. Lotan, F. Schwarzer, D. Halperin, J.-C. Latombe, Efficient maintenance and self-collision testing for kinematic chains, in: Proc. of the 18th ACM Symposium on Computational Geometry, 2002, pp. 43-52
31. G. Narasimhan, and M. Smid Approximating the stretch factor of Euclidean graphs SIAM J. Comput. 30 2000 978 989
32. D.K. Pai STRANDS: Interactive simulation of thin solids using Cosserat models Computer Graphics Forum 21 3 2002 347 352
33. D. Peleg Distributed Computing: A Locality Sensitive Approach Monographs on Discrete Mathematics and Applications 2000 SIAM
34. J.S. Salowe Enumerating interdistances in space Internat. J. Comput. Geom. Appl. 2 1992 49 59
35. J.M. Sullivan Sphere packings give an explicit bound for the Besicovitch covering theorem J. Geom. Anal. 2 2 1994 219 230
36. V.V. Vazirani Approximation Algorithms 2001 Universitext Springer-Verlag