Abstract
Existing graph drawing systems imply the use of specific algorithms for each kind of data structures. This paper provide a description of the Adocs program. The program is based on a generic description of the structures, and thus allows to draw structures of an infinite number of classes. It can be used in order to produce graphical output for Gaïa, an uniform random generator of combinatorial structures. It could be used with other programs and is well suited for drawing compound objects.
Chapter PDF
References
Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1–2):1–35, 1994.
Eades Peter D. Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5(2):10–36, 1992.
Edward M. Reingold and John S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223–228, March 1981.
Paul Zimmermann. Gaïa: a package for the random generation of combinatorial structures. MapleTech, 1(1):38–46, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertault, F. (1996). Adocs: a drawing system for generic combinatorial structures. In: Brandenburg, F.J. (eds) Graph Drawing. GD 1995. Lecture Notes in Computer Science, vol 1027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021787
Download citation
DOI: https://doi.org/10.1007/BFb0021787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60723-6
Online ISBN: 978-3-540-49351-8
eBook Packages: Springer Book Archive