Optimal spanners for axis-aligned rectangles

Computational Geometry: Theory and Applications

Volumn 30, Issue 1, 2005, Pages 59-77

  Asano, Tetsuo ^a   De Berg, Mark ^b   Cheong, Otfried ^c   Everett, Hazel ^d   Haverkort, Herman ^e   Katoh, Naoki ^f   Wolff, Alexander ^g  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^d LORIA   (France)

^e AARHUS UNIVERSITY   (Denmark)

^f KYOTO UNIVERSITY   (Japan)

^g UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Dilation optimization; Geometric spanners; Isothetic rectangles; Manhattan distance

Indexed keywords

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

References (8)

1. M.T. de Berg, S. Carlsson, and M.H. Overmars A general approach to dominance in the plane J. Algorithms 13 1992 274 296
2. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer Berlin
3. L.P. Chew There are planar graphs almost as good as the complete graph J. Comput. Syst. Sci. 39 1989 205 219
4. D. Eppstein Spanning trees and spanners J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Amsterdam 425 461
5. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
6. N. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 1984 373 395
7. N. Megiddo Applying parallel computation algorithms in the design of serial algorithms J. ACM 30 4 1983 852 865
8. D. Peleg, and A. Schäffer Graph spanners J. Graph Theory 13 1989 99 116