Orthogonal hypergraph routing for improved visibility

Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd

doi:10.1145/988952.989045

Cited by 5 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7] metrics were proposed to quantify the aesthetic quality of diagrams. In [8] the authors show an algorithm minimizing the number of hyperedge crossings. Additionally, in [9] the authors show an approach that dynamically reorders the vertices within the layers to further reduce the number of crossings.…”

Section: Related Workmentioning

confidence: 99%

Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms

Helmke

Goetze

Scheffler

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Schematic diagrams are used in graph-based engineering systems. They focus mainly on the structure of the design object. Graph-based engineering systems help to solve a concrete design task. This is primarily realized by the application of domain-specific languages. The layout of schematic diagrams is of particular importance, and a neat representation is desirable. But automatically generated layouts cannot always fully match the intention of a modeler. To improve automatic layouts and enable a user-specific representation, an algorithm that allows interactive changes of the orthogonal hyperedge geometry was implemented. In this paper, we present this algorithm and give an overview of such interactions. Additionally, several reductions of the hyperedge geometry are shown. Furthermore, a local, automatic routing considering interactions on the hyperedge geometry is presented. The consideration of domain-specific semantics and the possibility of interactive changes is a new approach. All algorithms were implemented in a self-developed software framework.

show abstract

Section: Related Workmentioning

confidence: 99%

Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms

Helmke

Goetze

Scheffler

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Both methods represent vertices as points in space, but while edge-standard uses a representation inspired classical graph drawing (e.g. Sander [San04] and Eschbach et al [EGB04]), subset-standard replaces each hyperedge with an enclosure containing the set of its incident vertices (e.g. Bertault & Eades [BE00]).…”

Section: Introductionmentioning

confidence: 99%

Six methods for transforming layered hypergraphs to apply layered graph layout algorithms

Bartolomeo

Pister

Buono

et al. 2022

Computer Graphics Forum

View full text Add to dashboard Cite

Hypergraphs are a generalization of graphs in which edges (hyperedges) can connect more than two vertices—as opposed to ordinary graphs where edges involve only two vertices. Hypergraphs are a fairly common data structure but there is little consensus on how to visualize them. To optimize a hypergraph drawing for readability, we need a layout algorithm. Common graph layout algorithms only consider ordinary graphs and do not take hyperedges into account. We focus on layered hypergraphs, a particular class of hypergraphs that, like layered graphs, assigns every vertex to a layer, and the vertices in a layer are drawn aligned on a linear axis with the axes arranged in parallel. In this paper, we propose a general method to apply layered graph layout algorithms to layered hypergraphs. We introduce six different transformations for layered hypergraphs. The choice of transformation affects the subsequent graph layout algorithm in terms of computational performance and readability of the results. Thus, we perform a comparative evaluation of these transformations in terms of number of crossings, edge length, and impact on performance. We also provide two case studies showing how our transformations can be applied to real‐life use cases. A copy of this paper with all appendices and supplemental material is available at osf.io/grvwu.

show abstract

“…An integration into an industrial toolset was discussed in [26]. Theoretical results can be found in [13]. These techniques split the process into several steps:…”

Section: Introductionmentioning

confidence: 99%

Orthogonal Hypergraph Drawing for Improved Visibility

Eschbach¹,

Günther²,

Becker³

2006

JGAA

Self Cite

View full text Add to dashboard Cite

Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. In our model we assume that between two consecutive layers every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics.First we assume that the nodes have already been fixed on a layered hypergraph structure. We consider the problem of assigning the hyperedges between two layers to tracks. The idea is to minimize the total number of hyperedge crossings. We prove that finding the best solution is NP-hard. Then, in contrast to many other approaches which route all the wiring after placing all nodes we focus on a new approach which dynamically reorders the nodes within the layers to further reduce the number of hyperedge crossings. An efficient algorithm is presented that minimizes the hyperedge crossings. Experimental results are provided which show that the drawings can be improved significantly while the running time remains moderate.

show abstract

Orthogonal hypergraph routing for improved visibility

Cited by 5 publications

References 11 publications

Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms

Interactive, Orthogonal Hyperedge Routing in Schematic Diagrams Assisted by Layout Automatisms

Six methods for transforming layered hypergraphs to apply layered graph layout algorithms

Orthogonal Hypergraph Drawing for Improved Visibility

Contact Info

Product

Resources

About