Open AccessPosted Content
Orthogonal Compaction Using Additional Bends
TL;DR: In this article, a one-dimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results is presented, which can reduce the total edge length and the drawing area, but at the expense of additional bends.
read more
Abstract: Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing area, but at the expense of additional bends.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Network Flows: Theory, Algorithms, and Applications
Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin +2 more
- 01 Jan 1993
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
•Book
Combinatorial Algorithms for Integrated Circuit Layout
Thomas Lengauer
- 07 Sep 1990
TL;DR: This paper will concern you to try reading combinatorial algorithms for integrated circuit layout as one of the reading material to finish quickly.
1.1K
An experimental comparison of four graph drawing algorithms
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu +5 more
TL;DR: An extensive experimental study comparing four general-purpose graph drawing algorithms, which take as input general graphs and construct orthogonal grid drawings, which are widely used in software and database visualization applications.
206
•Proceedings Article
The Open Graph Drawing Framework (OGDF)
Markus Chimani,Carsten Gutwenger,Michael Jünger,Gunnar W. Klau,Karsten Klein,Petra Mutzel +5 more
- 01 Jan 2012
TL;DR: Cluster Layout Planarity testing Booth/Lueker and Boyer/Myrvold Cluster (Feng et al.), Upward (Bertolazzi et al.) Customizable planarization method Edge insertion (fixed & variable embedding) Crossing.
198
Accelerated Bend Minimization
TL;DR: In this article, the authors presented an O(n 3/2 )-time algorithm for the min-cost flow problem on a planar bidirected graph with bounded costs and face sizes.