GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

GD

2004

Springer

13 years 10 months ago
2004

Springer

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 ...

GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

Large graphs are diﬃcult 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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months ago
2004

Springer

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...

GD

2004

Springer

13 years 10 months 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...