Drawing Graphs with Right Angle Crossings
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 206-217
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the maximum number of edges in quasi-planar graphsJournal of Combinatorial Theory, Series A, 2007
- Improving the Crossing Lemma by Finding More Crossings in Sparse GraphsDiscrete & Computational Geometry, 2006
- Relaxing Planarity for Topological GraphsLecture Notes in Computer Science, 2003
- Effective information visualisation: a study of graph drawing aesthetics and algorithmsInteracting with Computers, 2000
- Efficient Orthogonal Drawings of High Degree GraphsAlgorithmica, 2000
- Triangles in Euclidean ArrangementsDiscrete & Computational Geometry, 1999
- Quasi-planar graphs have a linear number of edgesCombinatorica, 1997
- The Maximum Number of Triangles in Arrangements of PseudolinesJournal of Combinatorial Theory, Series B, 1996
- Representations of Planar GraphsSIAM Journal on Discrete Mathematics, 1993
- Planar grid embedding in linear timeIEEE Transactions on Circuits and Systems, 1989