Drawing Planar Graphs with Circular Arcs-Reference-Cited by-同舟云学术

Drawing Planar Graphs with Circular Arcs

Published:1999 Issue: Volume: Page:117-126
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Cheng C. C.,Duncan C. A.,Goodrich M. T.,Kobourov S. G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46648-7_12

Reference14 articles.

1. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ, 1999.

2. M. Chrobak and T. Payne. A linear-time algorithm for drawing planar graphs. Inform. Process. Lett.,54:241–246, 1995.

3. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41–51, 1990.

4. I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged, 11:229–233, 1948.

5. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, Emo Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. SIAM J. Comput., 22:1035–1052, 1993.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Induced H-packing k-partition of graphs;International Journal of Computer Mathematics: Computer Systems Theory;2021-01-15

2. Triangulations with Circular Arcs;Graph Drawing;2012

3. An algorithm for fitting circular arcs to data using the l 1 norm;Numerical Algorithms;2008-01

4. Planar Straight-Line Drawing in an $\mathcal{O}(n)\times \mathcal{O}(n)$ Grid with Angular Resolution $\it \Omega$ (1/n);SOFSEM 2005: Theory and Practice of Computer Science;2005

5. Curvilinear Graph Drawing Using the Force-Directed Method;Graph Drawing;2005