Sciweavers

109 search results - page 4 / 22
» Straight-Line Drawing Algorithms for Hierarchical Graphs and...
Sort
View
SMA
2009
ACM
219views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Log-aesthetic space curve segments
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...
Norimasa Yoshida, Ryo Fukuda, Takafumi Saito
GD
2004
Springer
14 years 26 days ago
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
Carsten Görg, Peter Birke, Mathias Pohl, Step...
ICFCA
2004
Springer
14 years 26 days ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
GD
2005
Springer
14 years 1 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong