Drawing high degree graphs with low bend numbers
Open Access
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 254-266
- https://doi.org/10.1007/bfb0021809
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Drawing high degree graphs with low bend numbersPublished by Springer Nature ,1996
- On the computational complexity of upward and rectilinear planarity testingPublished by Springer Nature ,1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Angles of planar triangular graphsPublished by Association for Computing Machinery (ACM) ,1993
- Towards the automatic generation of software diagramsIEEE Transactions on Software Engineering, 1991
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- A unified approach to visibility representations of planar graphsDiscrete & Computational Geometry, 1986
- A layout algorithm for data flow diagramsIEEE Transactions on Software Engineering, 1986
- Computer aided layout of entity relationship diagramsJournal of Systems and Software, 1984