Sciweavers

514 search results - page 19 / 103
» Drawing a Graph in a Hypercube
Sort
View
VLC
2002
93views more  VLC 2002»
13 years 8 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
MVA
1994
13 years 9 months ago
Robust Line Drawing Understanding Incorporating Efficient Closed Symbols Extraction
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
Shin'ichi Satoh, Hiroshi Mo, Masao Sakauchi
JGAA
1998
116views more  JGAA 1998»
13 years 8 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
VISSYM
2007
13 years 11 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal
SOFSEM
2005
Springer
14 years 2 months ago
Volumes of 3D Drawings of Homogenous Product Graphs
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...
Lubomir Torok