Greedy drawings of triangulations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 102-111

  Dhandapani, Raghavan ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEODESY; GRAPH THEORY; PHOTOCOPYING; TREES (MATHEMATICS); TRIANGULATION;

EUCLIDEAN DISTANCE (ED); KURATOWSKI;

ROUTING ALGORITHMS;

ALGORITHMS; MATHEMATICS; REPROGRAPHY; TREES; TRIANGULATION;

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

References (25)

1. Nicolas Bonichon, Stefan Felsner, and Mohamed Mosbah. Convex drawings of 3-connected planar graphs. Algorithmica, 47:399-420, 2007.
2. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In DIALM '99: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, pages 48-55, New York, NY, USA, 1999. ACM Press.
3. E. Brehm. 3-orientations and schnyder 3-tree decompositions. Diplomarbeit, Freie Universitat, Berlin, 2000.
4. Hubert de Fraysseix, János Pach, and Richard Pollack. Small sets supporting fáry embeddings of planar graphs. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 426-433, New York, NY, USA, 1988. ACM Press.
5. S. Felsner. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order, 18:19-37, 2001.
6. S. Felsner. Geometric Graphs and Arrangements. Vieweg Verlag, 2004.
7. Eric Fusy, Dominique Poulalhon, and Gilles Schaeffer. Dissections and trees, with applications to optimal mesh encoding and to random sampling. In SODA '05: Proceedings of the sixteenth annual AG'M-SIAM symposium on Discrete algorithms, pages 690-699, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
8. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, and An Zhu. Geometric spanner for routing in mobile networks. In MobiHoc '01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, pages 45-55, New York, NY, USA, 2001. ACM Press.
9. J. Hopcroft and R. Tarjan. Efficient planarity testing. Journal of the ACM, 21(4):549-568, 1974.
10. G. Kant. Drawing planar graphs using the lmcordering. In Foundations of Computer Science, Proceedings., 33rd Annual Symposium on, pages 101-110, 1992.
11. Brad Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Mobi-Com '00: Proceedings of the 6th annual international conference on Mobile computing and networking, pages 243-254, New York, NY, USA, 2000. ACM Press.
12. Robert Kleinberg. Personal communication. 2006.
13. Robert Kleinberg. Geographic routing in hyperbolic space. In Workshop on Parallelism in Algorithms and Architectures. University of Maryland, College Park, May 12, 2006.
14. B. Knaster, C. Kuratowski, and C. Mazurkiewicz. Ein Beweis des Fixpunktsatzes fur n-dimensionale Simplexe. Fundamenta Mathematicae, 14:132-137, 1929.
15. Fabian Kuhn, Roger Wattenhofer, Yan Zhang, and Aaron Zollinger. Geometric ad-hoc routing: of theory and practice. In PODC '03: Proceedings of the twentysecond annual symposium on Principles of distributed computing, pages 63-72, New York, NY, USA, 2003. ACM Press.
16. N. Linial, L. Lovasz, and A. Wigderson. Rubber bands, convex embeddings and graph connectivity. Combinatorica, 8(1):91-102, 1988.
17. Petar Maymounkov. Greedy embeddings, trees, and euclidean vs. lobachevsky geometry. Submitted, 2006.
18. Takao Nishizeki and Dr Md Saidur Rahman. Planar Graph Drawing. World Scientific Publishing, 2004.
19. Christos H. Papadimitriou and David Ratajczak. On a conjecture related to geometric routing. Theor. Comput. Sci., 344(1):3-14, 2005.
20. Ananth Rao, Christos Papadimitriou, Scott Shenker, and Ion Stoica. Geographic routing without location information. In Mobi Com '03: Proceedings of the 9th annual international conference on Mobile computing and networking, pages 96-108, New York, NY, USA, 2003. ACM Press.
21. Gunter Rote. Strictly convex drawings of planar graphs. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 728-734, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
22. Walter Schnyder. Embedding planar graphs on the grid. In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 138-148, Philadelphia, PA, USA, 1990. Society for Industrial and Applied Mathematics.
23. Ioannis G. Tollis, Giuseppe Di Battista, Peter Eades, and Roberto Tamassia. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998.
24. W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99-116, 1956.
25. W.T. Tutte. Convex representations of graphs. In Proceedings of the London Mathematical Society, pages 304-320, 1960.