Constrained graph layout

Weiqing He, Kim Marriott

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

11 Citations (Scopus)


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 laced out. We describe three implementations of layout modules which are based on the constrained graph layout model. The first two implementations are for undirected graph layout and the third 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
Title of host publicationGraph Drawing - Symposium on Graph Drawing, GD 1996, Proceedings
EditorsStephen North
Number of pages16
ISBN (Print)3540624953, 9783540624950
Publication statusPublished - 1 Jan 1997
EventGraph Drawing 1996 - Berkeley, United States of America
Duration: 18 Sept 199620 Sept 1996
Conference number: 4th (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceGraph Drawing 1996
Abbreviated titleGD 1996
Country/TerritoryUnited States of America
Internet address

Cite this