269
click to vote
GD
16 years 9 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...
224
click to vote
GD
16 years 9 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...
208
click to vote
GD
16 years 9 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...
195
click to vote
GD
16 years 9 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...
193
click to vote
GD
16 years 9 days ago
2004 Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
|
Computer Graphics