Constrained graph layout

H. E. Weiqing, Kim Marriott

Research output: Contribution to journalArticleResearchpeer-review

26 Citations (Scopus)

Abstract

Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.

Original languageEnglish
Pages (from-to)289-314
Number of pages26
JournalConstraints
Volume3
Issue number4
DOIs
Publication statusPublished - 1 Oct 1998

Keywords

  • Active set method
  • Constraints
  • Graph layout
  • InteractionGraphics

Cite this

Weiqing, H. E. ; Marriott, Kim. / Constrained graph layout. In: Constraints. 1998 ; Vol. 3, No. 4. pp. 289-314.
@article{2ac323f5329e44fc955395a0f9613443,
title = "Constrained graph layout",
abstract = "Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.",
keywords = "Active set method, Constraints, Graph layout, InteractionGraphics",
author = "Weiqing, {H. E.} and Kim Marriott",
year = "1998",
month = "10",
day = "1",
doi = "10.1023/A:1009771921595",
language = "English",
volume = "3",
pages = "289--314",
journal = "Constraints",
issn = "1383-7133",
publisher = "Springer-Verlag London Ltd.",
number = "4",

}

Constrained graph layout. / Weiqing, H. E.; Marriott, Kim.

In: Constraints, Vol. 3, No. 4, 01.10.1998, p. 289-314.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Constrained graph layout

AU - Weiqing, H. E.

AU - Marriott, Kim

PY - 1998/10/1

Y1 - 1998/10/1

N2 - Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.

AB - Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.

KW - Active set method

KW - Constraints

KW - Graph layout

KW - InteractionGraphics

UR - http://www.scopus.com/inward/record.url?scp=0011777545&partnerID=8YFLogxK

U2 - 10.1023/A:1009771921595

DO - 10.1023/A:1009771921595

M3 - Article

VL - 3

SP - 289

EP - 314

JO - Constraints

JF - Constraints

SN - 1383-7133

IS - 4

ER -