Graph compact orthogonal layout algorithm

DOI10.1007/978-3-319-09174-7_22MaRDI QIDQ3195336zbMATH OpenOpenAlexFDO

Authors Karlis Freivalds, Jans Glagoļevs

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.09368

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Abstract: There exist many orthogonal graph drawing algorithms that minimize edge crossings or edge bends, however they produce unsatisfactory drawings in many practical cases. In this paper we present a grid-based algorithm for drawing orthogonal graphs with nodes of prescribed size. It distinguishes by creating pleasant and compact drawings in relatively small running time. The main idea is to minimize the total edge length that implicitly minimizes crossings and makes the drawing easy to comprehend. The algorithm is based on combining local and global improvements. Local improvements are moving each node to a new place and swapping of nodes. Global improvement is based on constrained quadratic programming approach that minimizes the total edge length while keeping node relative positions.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Graph compact orthogonal layout algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195336)