Static and kinetic geometric spanners with applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 168-176

  Karavelas, Menelaos I ^a   Guibas, Leonidas J ^a  

^a Stanford University   (United States)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049097663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, José Soares, On sparse spanners of weighted graphs, Discrete & Computational Geometry, v.9 n.1, p.81-100, 1993 [doi>10.1007/BF02189308]
2. Baruch Awerbuch, Complexity of network synchronization, Journal of the ACM (JACM), v.32 n.4, p.804-823, Oct. 1985 [doi>10.1145/4221.4227]
3. Hans-Jürgen Bandelt, Andreas Dress, Reconstructing the shape of a trea from observed dissimilarity data, Advances in Applied Mathematics, v.7 n.3, p.309-343, Sept. 1986 [doi>10.1016/0196-8858(86)90038-2]
4. Julien Basch, Leonidas J. Guibas, John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
5. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 47-123. World Scientific, 2nd edition, 1995.
6. Marshall Bern, David Eppstein, John Gilbert, Provably good mesh generation, Journal of Computer and System Sciences, v.48 n.3, p.384-409, June 1994 [doi>10.1016/S0022-0000(05)80059-5]
7. P Chew, There is a planar graph almost as good as the complete graph, Proceedings of the second annual symposium on Computational geometry, p.169-177, June 02-04, 1986, Yorktown Heights, New York, United States [doi>10.1145/10515.10534]
8. G. Das , D. Joseph, Which triangulations approximate the complete graph?, Proceedings of the international symposium on Optimal algorithms, p.168-192, November 1989, Varna, Bulgaria
9. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delannay graphs are almost as good as complete graphs. In 28th Annual Syrup. Found. of Comput. Sci., pages 20-26, 1987.
10. Leonidas J. Guibas, Kinetic data structures: a state of the art report, Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective, p.191-209, August 1998, Houston, Texas, United States
11. John Hershberger, Optimal parallel algorithms for triangulated simple polygons, Proceedings of the eighth annual symposium on Computational geometry, p.33-42, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675.142687]
12. Barry Joe, Construction of three-dimensional Delaunay triangulations using local transformations, Computer Aided Geometric Design, v.8 n.2, p.123-142, May 1991 [doi>10.1016/0167-8396(91)90038-D]
13. J. M. Keil, Approximating the complete Euclidean graph, No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory, p.208-213, January 1988, Halmstad, Sweden
14. J. Mark Keil , Carl A. Gutwin, The Delauney Triangulation Closely Approximates the Complete Euclidean Graph, Proceedings of the Workshop on Algorithms and Data Structures, p.47-56, August 17-19, 1989
15. C. Levcopoulos , A. Lingas, There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees (invited), Proceedings of the international symposium on Optimal algorithms, p.9-13, November 1989, Varna, Bulgaria
16. Andrzej Lingas, Voronoi diagrams with barriers and the shortest diagonal problem, Information Processing Letters, v.32 n.4, p.191-198, Sept 1, 1989 [doi>10.1016/0020-0190(89)90043-4]
17. Scott A. Mitchell, Stephen A. Vavasis, Quality mesh generation in three dimensions, Proceedings of the eighth annual symposium on Computational geometry, p.212-221, June 10-12, 1992, Berlin, Germany [doi>10.1145/142675. 142720]
18. David Peleg , Jeffrey D. Ullman, An optimal synchronizer for the hypercube, SIAM Journal on Computing, v.18 n.4, p.740-747, Aug. 1989 [doi>10.1137/0218050]
19. Fridrich Sloboda , Bedrich Zat'ko, P. Ferianc, The minimum perimeter polygon and its application, Proceedings of the 6th Workshop on Theoretical Foundations of Computer Vision, p.20, March 30-April 03, 1992