61 search results - page 2 / 13 » Orthogonal 3-D Graph Drawing |
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, a method is proposed to retrieve desired 3D models by measuring the similarity between a user’s freehand sketches and 2D orthogonal views generated from 3D models....
CG
2005
Springer
13 years 5 months ago
2005
Springer
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
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 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...
GD
1995
Springer
13 years 8 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...