228
click to vote
GD
15 years 9 months ago
2004 Springer 
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
153
click to vote
GD
15 years 9 months ago
2004 Springer 
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
139
click to vote
GD
15 years 9 months ago
2004 Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
138
click to vote
GD
15 years 9 months ago
2004 Springer 
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
135
click to vote
GD
15 years 9 months ago
2004 Springer 
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
|
Computer Graphics