Drawing graphs with right angle crossings
Authors:
- Walter DidimoWDWalter Didimo
- Peter EadesPEPeter Eades
- Giuseppe LiottaGLGiuseppe Liotta
- 1 September 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (39) , 5156-5166
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Maximizing the Total Resolution of GraphsLecture Notes in Computer Science, 2011
- Topology-Driven Force-Directed Algorithms2011
- On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing AnglesLecture Notes in Computer Science, 2011
- A characterization of complete bipartite RAC graphsInformation Processing Letters, 2010
- Graph visualization techniques for conceptual Web site traffic analysis2010
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph DrawingsLecture Notes in Computer Science, 2010
- Drawing Graphs with Right Angle Crossings2009
- On the maximum number of edges in quasi-planar graphsJournal of Combinatorial Theory, Series A, 2007
- Quasi-planar graphs have a linear number of edgesCombinatorica, 1997
- Representations of Planar GraphsSIAM Journal on Discrete Mathematics, 1993