Sciweavers

112
Voted
IVC
2007
102views more  IVC 2007»
15 years 8 days ago
Analysis of the rubberband algorithm
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
110
Voted
IWCIA
2004
Springer
15 years 5 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
97
Voted
DGCI
2005
Springer
15 years 5 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
93
Voted
CAIP
2005
Springer
107views Image Analysis» more  CAIP 2005»
15 years 6 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