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 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 language | English |
|---|---|
| Title of host publication | Graph Drawing - Symposium on Graph Drawing, GD 1996, Proceedings |
| Editors | Stephen North |
| Publisher | Springer |
| Pages | 217-232 |
| Number of pages | 16 |
| ISBN (Print) | 3540624953, 9783540624950 |
| DOIs | |
| Publication status | Published - 1 Jan 1997 |
| Event | Graph Drawing 1996 - Berkeley, United States of America Duration: 18 Sep 1996 → 20 Sep 1996 Conference number: 4th https://link.springer.com/book/10.1007/3-540-62495-3 (Proceedings) |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1190 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | Graph Drawing 1996 |
|---|---|
| Abbreviated title | GD 1996 |
| Country | United States of America |
| City | Berkeley |
| Period | 18/09/96 → 20/09/96 |
| Internet address |
|