Abstract
This demonstration presents a computer system to generate symmetric drawings of certain classes of planar graphs.
Research supported by the National Science Foundation under Grant CCR-9202807
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Aho, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
P. Eades: A Heuristic for Drawing Graphs. Congressus Numerantium 42 (1984) 149–160
D. Knuth, J. Morris, V. Pratt: Fast Pattern Matching in Strings. SIAM Journal on Computing 6 (1977) 323–350
R. Lipton, S. North, J. Sandberg: A Method for Drawing Graphs. Proceedings of the ACM Symposium on Computational Geometry 1 (1986) 153–160
J. Manning, M. Atallah: Fast Detection and Display of Symmetry in Trees. Congressus Numerantium 64 (1988) 159–169
J. Manning, M. Atallah: Fast Detection and Display of Symmetry in Outerplanar Graphs. Discrete Applied Mathematics 39 (1992) 13–35
J. Manning: Computational Complexity of Geometric Symmetry Detection in Graphs. Lecture Notes in Computer Science 507 (1991) 1–7
J. Manning: Geometric Symmetry in Graphs. Ph.D. Thesis, Purdue University (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manning, J., Atallah, M., Cudjoe, K., Lozito, J., Pacheco, R. (1995). A system for drawing graphs with geometric symmetry. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_378
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_378
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive