Sciweavers

GD
2004
Springer
13 years 10 months ago
Layout Volumes of the Hypercube
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
Lubomir Torok, Imrich Vrto
GD
2004
Springer
13 years 10 months ago
Visualization and ILOG CPLEX
Georg Sander, Adrian Vasiliu
GD
2004
Springer
13 years 10 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
GD
2004
Springer
13 years 10 months ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood
GD
2004
Springer
13 years 10 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
GD
2004
Springer
13 years 10 months ago
3D Visualization of Semantic Metadata Models and Ontologies
Abstract. We propose an algorithm for the 3D visualization of general ontology models used in many applications, such as semantic web, entity-relationship diagrams and other databa...
Charalampos Papamanthou, Ioannis G. Tollis, Martin...
GD
2004
Springer
13 years 10 months ago
Intersection Reverse Sequences and Geometric Applications
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
Adam Marcus, Gábor Tardos
GD
2004
Springer
13 years 10 months ago
Long Alternating Paths in Bicolored Point Sets
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
Jan Kyncl, János Pach, Géza Tó...
GD
2004
Springer
13 years 10 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
GD
2004
Springer
13 years 10 months ago
The Three Dimensional Logic Engine
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...
Matthew Kitching, Sue Whitesides