Article

Free access

Randomized graph drawing with heavy-duty preprocessing

Authors:

Meir SardasAuthors Info & Claims

AVI '94: Proceedings of the workshop on Advanced visual interfaces

Pages 19 - 33

https://doi.org/10.1145/192309.192319

Published: 01 June 1994 Publication History

Abstract

We present a graph drawing system for general undirected graphs with straight-line edges. It carries out a rather complex set of preprocessing steps, designed to produce a topologically good, but not necessarily nice-looking layout, which is then subjected to Davidson and Harel's simulated annealing beautification algorithm. The intermediate layout is planar for planar graphs and attempts to come close to planar for nonplanar graphs. The system's results are significantly better, and much faster, than what the annealing approach is able to achieve on its own.

References

[1]

Di Battista, G., P. Eades, R. Tammassia and I. G. Tollis, "Algorithms fcr Automatic Graph Drawing: An Annotated Bibliography", Technical Report, Dept. of Computer Science, Brown IJniversity, Providence, 1993.

[2]

Berge, C., Graphs and Hypergmphs, North- Holland, Amsterdam, 1973.

Digital Library

[3]

Booth, K.S. and G.S. Lueker, "Testing for the Consecutive Ones Property, Interval Graphs, ant1 Graph Planarity Using PQ- tree Algorithms", J. Comput. Syst. Sci. 13 (1976), 335-879.

Digital Library

[4]

Chiba, N., T. Nishizeki, S. Abe, and T. Ozawa, "A Linea.r Algorithm for Embedding Planar Graphs Using PQ-trees", J. Comput. .Syst. Sci. 30: 1 (1985), 54.-76.

Digital Library

[5]

Chrobak, M. and T.H. Payne, "A Linear Time Algorithm for Drawing a F'lanar Graph on a Grid", Technical Report IJCR-CSS-90-2, Dept. of Math. and Camp. Science, IJniversity of California, Riverside, CA, 1990.

[6]

Davidson R. and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing", Technical report, The Weizmann Institute of Science, Rehovot, Israel, 1989; revised 1992, 1993; Comm. Assoc. Gomput. Mach., to appear.

[7]

Eades, P., "A Heuristic for Graph Drawing", Gong. Nurner 42 (1984), 149-160.

[8]

Fraysseix, H. de, J. Path, and R. Pollack, "Small Sets Supporting F&ry Embeddings of Planar Graphs", In Proc. 20th ACM Sytnp. on Theory of Comput., pp. 426-483, 1988.

Digital Library

[9]

Harel, D., "On Visual Formalisms", Comm. Assoc. Compul. Mach. 31 (1988), 514-530.

Digital Library

[10]

Harel, D. and M. Sardas, "An Incremental Drawing Algorithm for Planar Graphs", in preparation.

[11]

Jayakumar, R., K. Thulasiraman and M.N.S. Swamy, "O(n') Algorithm for Graph Planarization", IEEE Trans. on Computer-Aided Design 83 (1989), 257- 267.

[12]

Kamada, T., and S. Kawai, "An Algorithm for Drawing General IJndirected Graphs", If. Proc. Lett. 31 (1989), 7-15.

Digital Library

[13]

Kant, G., "An O(n') Maximal Planarization Algorithm Rased on PQ-trees", Technical Report RUU-CS-92-03, Dept. of C:omputer Science, IJtrecht IJniversity, The Netherlands, 1992.

[14]

Laarhoven, P.J.M. van and E.H.L. Aarts, Sitrlulated Annealing: Theory and Applications, D. Reidel Publishing C:o., Dortrecht, 1987.

Digital Library

[15]

Lempel, A., S. Even and I. Gderbaum, "An Algorithm for Planarity Testing of Graphs", In Theory of Graphs: International Symposiutn (P. Rosenstiehl, Ed.), Gordon and Rreach, New York, 1967, pp. 215-232.

[16]

Read, R.C:., "A New Method for Drawing a Planar Graph Given the Order of Edges at Each Vertex", Gong. Nutner. 56 (1987), 31-44.

[17]

Sardas, M ., "Drawing Graphs Nicely on the Plane", M.Sc. Thesis, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1993.

Cited By

Dwyer TMarriott KWybrow M(2007)Integrating Edge Routing into Force-Directed LayoutGraph Drawing10.1007/978-3-540-70904-6_3(8-19)Online publication date: 2007
https://doi.org/10.1007/978-3-540-70904-6_3
Dwyer TMarriott KWybrow M(2006)Integrating edge routing into force-directed layoutProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758617(8-19)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758617
Gutwenger CMutzel PWeiskircher RKosaraju S(2001)Inserting an edge into a planar graphProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365455(246-255)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365455

Index Terms

Randomized graph drawing with heavy-duty preprocessing
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
  2. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Randomized Graph Drawing with Heavy-Duty Preprocessing
Randomized Graph Drawing with Heavy-Duty Preprocessing
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02: Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science

A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z ³ and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

AVI '94: Proceedings of the workshop on Advanced visual interfaces

June 1994

249 pages

ISBN:0897917332

DOI:10.1145/192309

Editors:
Maria F. Costabile
Univ. di Bari, Bari, Italy
,
Tiziana Catarci
Univ. di Roma “La Sapienza”, Roma, Italy
,
Stefano Levialdi
Univ. di Roma “La Sapienza”, Roma, Italy
,
Giuseppe Santucci
Univ. di Roma “La Sapienza”, Roma, Italy

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCHI: ACM Special Interest Group on Computer-Human Interaction

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

AVI94

Sponsor:

SIGCHI

AVI94: Workshop on Advanced Visual Interfaces

June 1 - 4, 1994

Bari, Italy

Acceptance Rates

Overall Acceptance Rate 128 of 490 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
372
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)12

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dwyer TMarriott KWybrow M(2007)Integrating Edge Routing into Force-Directed LayoutGraph Drawing10.1007/978-3-540-70904-6_3(8-19)Online publication date: 2007
https://doi.org/10.1007/978-3-540-70904-6_3
Dwyer TMarriott KWybrow M(2006)Integrating edge routing into force-directed layoutProceedings of the 14th international conference on Graph drawing10.5555/1758612.1758617(8-19)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.5555/1758612.1758617
Gutwenger CMutzel PWeiskircher RKosaraju S(2001)Inserting an edge into a planar graphProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365455(246-255)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365455

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents