Sciweavers

GD
2009
Springer
14 years 3 months ago
Upward Planarization Layout
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
GD
2009
Springer
14 years 3 months ago
Orthogonal Connector Routing
Abstract. Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connect...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
GD
2009
Springer
14 years 3 months ago
4-Labelings and Grid Embeddings of Plane Quadrangulations
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
Lali Barrière, Clemens Huemer
GD
2009
Springer
14 years 3 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson
GD
2009
Springer
14 years 3 months ago
Semi-bipartite Graph Visualization for Gene Ontology Networks
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
Kai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing L...
GD
2009
Springer
14 years 3 months ago
WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations
Traditional network visualization tools inherently suffer from scalability problems, particularly when such tools are interactive and web-based. In this paper we introduce WiGis ...
Brynjar Gretarsson, Svetlin Bostandjiev, John O'Do...
GD
2009
Springer
14 years 3 months ago
On Planar Supports for Hypergraphs
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Be...
GD
2009
Springer
14 years 3 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
GD
2009
Springer
14 years 3 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
GD
2009
Springer
14 years 3 months ago
Port Constraints in Hierarchical Layout of Data Flow Diagrams
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
Miro Spönemann, Hauke Fuhrmann, Reinhard von ...