Sciweavers

Share
GD
2000
Springer
9 years 1 months ago
FADE: Graph Drawing, Clustering, and Visual Abstraction
Aaron J. Quigley, Peter Eades
GD
2000
Springer
9 years 1 months ago
User Preference of Graph Layout Aesthetics: A UML Study
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
GD
2000
Springer
9 years 1 months ago
Labeling Points with Rectangles of Various Shapes
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyam...
GD
2000
Springer
9 years 1 months ago
GraphXML - An XML-Based Graph Description Format
GraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML mak...
Ivan Herman, M. Scott Marshall
GD
2000
Springer
9 years 1 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren
GD
2000
Springer
9 years 1 months ago
GRIP: Graph dRawing with Intelligent Placement
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
Pawel Gajer, Stephen G. Kobourov
GD
2000
Springer
9 years 1 months ago
An Algorithmic Framework for Visualizing Statecharts
Rodolfo Castelló, Rym Mili, Ioannis G. Toll...
GD
2000
Springer
9 years 1 months ago
Visualization of the Autonomous Systems Interconnections with HERMES
Andrea Carmignani, Giuseppe Di Battista, Walter Di...
GD
2000
Springer
9 years 1 months ago
A User Study in Similarity Measures for Graph Drawing
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...
Stina S. Bridgeman, Roberto Tamassia
books