287
click to vote
GD
16 years 29 days 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...
246
click to vote
GD
16 years 29 days 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...
224
click to vote
GD
16 years 29 days 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...
215
click to vote
GD
16 years 29 days ago
2004 Springer 
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
208
click to vote
GD
16 years 29 days ago
2004 Springer
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...
|
Computer Graphics