GD
2001
Springer
13 years 12 months ago
2001
Springer
Following a workshop on graph data formats held with the 8th Symposium on Graph Drawing (GD 2000), a task group was formed to propose a format for graphs and graph drawings that me...
GD
2001
Springer
13 years 12 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...
GD
2001
Springer
13 years 12 months ago
2001
Springer
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
GD
2001
Springer
13 years 12 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
CONTENT
2001
Springer
13 years 12 months ago
2001
Springer
A development environment for RenderMan shaders has been implemented, allowing the SL programmer to observe the bahaviour of variables in both time and space. By allowing both nov...
CONTENT
2001
Springer
13 years 12 months ago
2001
Springer
The paper will describe research undertaken to investigate how children can be assisted to construct web based 3D worlds. As new technologies become an increasingly important part ...
CONTENT
2001
Springer
13 years 12 months ago
2001
Springer
CONTENT
2001
Springer
13 years 12 months ago
2001
Springer
This paper looks at existing computer games and virtual environments from the perspective of film theory and practice. From this, we will draw conclusions about the ways in which ...
GREC
2009
Springer
14 years 1 days ago
2009
Springer
In this paper, we study the segmentation of sketched engineering drawings into a set of straight and curved segments. Our immediate objective is to produce a benchmarking method fo...
GD
2009
Springer
14 years 1 days ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...