12 search results - page 1 / 3 » Approximation of 3D Shortest Polygons in Simple Cube Curves |
56
Voted
DAGSTUHL
2000
14 years 11 months ago
2000
94
Voted
IWCIA
2004
Springer
15 years 2 months ago
2004
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
CAIP
2005
Springer
15 years 3 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
PAMI
2002
14 years 9 months ago
2002
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...