264 search results - page 16 / 53 » Subdivision for Line Drawings |
ENDM
2008
14 years 11 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
CCCG
2007
15 years 1 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
GD
2009
Springer
15 years 4 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
GD
2003
Springer
15 years 5 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
54
Voted
CHI
2002
ACM
16 years 3 days ago
2002
ACM
Graphical user interfaces rely heavily on the tool metaphor. In most drawing systems, for example, functions are organized as they might be on a workbench; buttons associated with...