Sciweavers

514 search results - page 23 / 103
» Drawing a Graph in a Hypercube
Sort
View
GD
2005
Springer
15 years 3 months ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
GD
2003
Springer
15 years 2 months ago
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Na...
COMGEO
2004
ACM
14 years 9 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
GD
2003
Springer
15 years 2 months ago
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...
Ulrik Brandes, Tim Dwyer, Falk Schreiber
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
15 years 3 months ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...