Sciweavers

942 search results - page 17 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
GD
2005
Springer
14 years 2 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
COMGEO
2004
ACM
13 years 8 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...
BMCBI
2010
143views more  BMCBI 2010»
13 years 8 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
CASCON
1992
134views Education» more  CASCON 1992»
13 years 9 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
GD
2004
Springer
14 years 2 months ago
An Interactive Multi-user System for Simultaneous Graph Drawing
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
Stephen G. Kobourov, Chandan Pitta