Sciweavers

12 search results - page 1 / 3
» Approximation of 3D Shortest Polygons in Simple Cube Curves
Sort
View
IWCIA
2004
Springer
13 years 9 months ago
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space
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...
Fajie Li, Reinhard Klette
CAIP
2005
Springer
107views Image Analysis» more  CAIP 2005»
13 years 10 months ago
Minimum-Length Polygons of First-Class Simple Cube-Curves
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...
Fajie Li, Reinhard Klette
DGCI
2005
Springer
13 years 10 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
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...
Fajie Li, Reinhard Klette
PAMI
2002
103views more  PAMI 2002»
13 years 4 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
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 ...
Thomas Bülow, Reinhard Klette