A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit <a rel="external noopener" href="http://www.ads.tuwien.ac.at:80/publications/bib/pdf/mch04TechReport.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Non-planar Orthogonal Drawings with Fixed Topology
[chapter]
<span title="">2005</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
We present a procedure for calculating the bend minimal shape of non-planar graphs with given topology. The method is an extension of the Simple-Kandinsky drawing standard -a simplification of the more complex Kandinsky standard. For both models, algorithms exist that guarantee bend minimality for planar graphs with given topology. They generate orthogonal drawings with equal node size where multiple edges can be attached to a single side of a node. In contrast to Kandinsky, Simple-Kandinsky
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30577-4_13">doi:10.1007/978-3-540-30577-4_13</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d732fxv47bgothe6eplysc7deq">fatcat:d732fxv47bgothe6eplysc7deq</a>
</span>
more »
... certain restrictions on the split up of such bundles. In this paper we extend the drawing standard to the class of non-planar graphs and present an algorithm that computes provably bend-minimal drawings within this standard. The extension treats edge crossings in a special way by letting them share identical grid points where appropriate. Hence it allows crossings of whole bundles of edges instead of single edges only. Besides having a reduced number of bends, drawings computed by our algorithm are easier to read and consume less area than those produced by the traditional approaches. Furthermore, we show a sharp upper bound of the bend count for the heuristic use of Simple-Kandinsky for non-planar graphs and present an extension of the new method that is able to draw non-planar clustergraphs.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060211223610/http://www.ads.tuwien.ac.at:80/publications/bib/pdf/mch04TechReport.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/e3/7fe3477260951f4b1909b77abd6fd2dcb7bff785.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30577-4_13">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>