Orthogonal Compaction Using Additional Bends
Data Structures and Algorithms
2017-06-21 v1
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.
Cite
@article{arxiv.1706.06514,
title = {Orthogonal Compaction Using Additional Bends},
author = {Michael Jünger and Petra Mutzel and Christiane Spisla},
journal= {arXiv preprint arXiv:1706.06514},
year = {2017}
}
Comments
Submitted to 25th International Symposium on Graph Drawing & Network Visualization