Topology Preserving Constrained Graph Layout

Dwyer, Tim; Marriott, Kim; Wybrow, Michael

doi:10.1007/978-3-642-00219-9_22

Cited by 41 publications

(50 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6. Embedding quality We measure this using the P-stress function [8], a variant of stress [9] that does not penalise unconnected nodes being more than their desired distance apart. It measures the separation between each pair of nodes u, v ∈ V in the drawing and their ideal distance d uv proportional to the graph theoretic path between them: where M (θ) is an "M-shaped function" over [0, π/2] that highly penalizes edges which are almost but not quite axis-aligned and gives a lower penalty for edges midway between horizontal and vertical.…”

Section: Aesthetic Criteriamentioning

confidence: 99%

Incremental Grid-Like Layout Using Soft and Hard Constraints

et al. 2013

Self Cite

View full text Add to dashboard Cite

Abstract. We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout-with predominantly axis-aligned edges-that is more flexible than previous grid-like layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical Notation). Furthermore, the layout is easily able to respect user-defined constraints and adapt to interaction in online systems and diagram editors such as Dunnart.

show abstract

Section: Aesthetic Criteriamentioning

confidence: 99%

Incremental Grid-Like Layout Using Soft and Hard Constraints

et al. 2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [10] and [12] we experimented with augmentation of the goal function to simulate other types of constraint. Simply adding terms to the goal function, however, does not provide the strict "rigidity" of real constraints.…”

Section: Separation Constraint Projectionmentioning

confidence: 99%

Layout with Circular and Other Non-linear Constraints Using Procrustes Projection

Dwyer

Robertson

2010

Graph Drawing

Self Cite

View full text Add to dashboard Cite

Abstract. Recent work on constrained graph layout has involved projection of simple two-variable linear equality and inequality constraints in the context of majorization or gradient-projection based optimization. While useful classes of containment, alignment and rectangular non-overlap constraints could be built using this framework, a severe limitation was that the layout used an axis-separation approach such that all constraints had to be axis aligned. In this paper we use techniques from Procrustes Analysis to extend the gradient-projection approach to useful types of non-linear constraints. The constraints require subgraphs to be locally fixed into various geometries-such as circular cycles or local layout obtained by a combinatorial algorithm (e.g. orthogonal or layered-directed)-but then allow these sub-graph geometries to be integrated into a larger layout through translation, rotation and scaling.

show abstract

“…Gansner and North [9]). Recent work such as [6,7] has proposed force-directed methods which are able to preserve the topology of a given edge routing, but a feasible initial routing must still be found using a standard routing algorithm. As described in Section 2, for graphs with hundreds of nodes, the quadratic (in the number of nodes) or worse cost of constructing the visibility graph can be too slow, especially for interactive applications where the layout is changing significantly from iteration to iteration.…”

Section: Introductionmentioning

confidence: 99%

Fast Edge-Routing for Large Graphs

Dwyer

Nachmanson

2010

Graph Drawing

Self Cite

View full text Add to dashboard Cite

Abstract.To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of nodes. In this paper we explore two ideas for achieving faster edge routing using approximate shortest-path techniques.

show abstract

Topology Preserving Constrained Graph Layout

Cited by 41 publications

References 18 publications

Incremental Grid-Like Layout Using Soft and Hard Constraints

Incremental Grid-Like Layout Using Soft and Hard Constraints

Layout with Circular and Other Non-linear Constraints Using Procrustes Projection

Fast Edge-Routing for Large Graphs

Contact Info

Product

Resources

About