Share Email Print
cover

Proceedings Paper

Efficient barycenter algorithm for drawing hierarchical graphs with minimum edge crossings
Author(s): Alaa A. K. Ismaeel; Pradyumn Kumar Shukla; Hartmut Schmeck
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Graph Drawing is a branch of computer graphics that addresses the problem of constructing geometric representations of conceptual structures that are modeled by graphs. Crossing reduction is one of the crucial problems in drawing networks that are presented in a hierarchical manner which is solved by repeated layer-by-layer techniques or by global ones. In this paper, we introduce a new efficient algorithm for drawing hierarchical graphs based on the well-known barycenter algorithm. Our algorithm improves the existing layer-by-layer techniques by 15-25% and recent global algorithms by 5% further reduction in the number of crossings.

Paper Details

Date Published: 30 September 2011
PDF: 5 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82850A (30 September 2011); doi: 10.1117/12.913044
Show Author Affiliations
Alaa A. K. Ismaeel, Karlsruhe Institute of Technology (Germany)
Pradyumn Kumar Shukla, Karlsruhe Institute of Technology (Germany)
Hartmut Schmeck, Karlsruhe Institute of Technology (Germany)


Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top