Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Clan-Based Incremental Drawing
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 1984/2001 |
| Book | Graph Drawing |
| DOI | 10.1007/3-540-44541-2 |
| Copyright | 2001 |
| ISBN | 978-3-540-41554-1 |
| DOI | 10.1007/3-540-44541-2_36 |
| Pages | 384-395 |
| Subject Collection | Computer Science |
| SpringerLink Date | Monday, January 01, 2001 |
| |
|
Clan-Based Incremental Drawing
Fwu-Shan Shieh5 and Carolyn L. McCreary6 
| (5) |
Minolta-QMS, Inc., One Magnum Pass, 36618 Mobile, AL, USA |
| (6) |
Compaq Computer Corporation, 334 South Street, 01545-4112 Shrewsbury, MA, USA |
Abstract
The stability is an essential issue for incremental drawings. To allow stable updating, means to modify graph slightly (such
as adding or deleting an edge or a node) without changing the layout dramatically from previous layout. In this paper, a method
for achieving stable incremental directed graph layout by using clan-based graph decomposition is described. For a given directed
graph, the clan-based decomposition generates a parse tree. The parse tree, which is used for layout, is also employed in
locating changes and maintaining visual stability during incremental drawing. By using the generated parse tree, each incremental
update can be done very efficiently.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|