Sciweavers

1265 search results - page 21 / 253
» Algorithms for Drawing Media
Sort
View
GD
2007
Springer
15 years 6 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee
SOFSEM
2007
Springer
15 years 5 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...
GD
2004
Springer
15 years 5 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
15 years 3 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
CVPR
2004
IEEE
16 years 1 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang