Minimum-Length Polygon of a Simple Cube-Curve in 3D Space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3322, Issue , 2004, Pages 502-511

  Li, Fajie ^a   Klette, Reinhard ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; RUBBER; IMAGE ANALYSIS; ITERATIVE METHODS;

3D GRID; 3D SPACES; ALTERNATIVE ALGORITHMS; GRID OF CELLS; ITERATIVE ALGORITHM; POLYGONAL CURVE; POLYHEDRALLY BOUNDED SET; RUBBER BANDS; SIMPLE++; SPECIAL CLASS; 3-D SPACE;

ITERATIVE METHODS; GEOMETRY;

EID: 35048848942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30503-3_36     Document Type: Article

References (5)

1. T. Bülow and R. Klette. Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence, 24:962-970, 2002.
2. R.L. Burden and J.D. Faires. BF Numerical Analysis. 7th edition, Brooks Cole, Pacific Grove, 2000.
3. A. Jonas and N. Kiryati. Length estimation in 3-D using cube quantization. J. Mathematical Imaging Vision, 8:215-238, 1998.
4. F. Sloboda, B. Zat̂ko, and R. Klette. On the topology of grid continua. SPIE Vision Geometry VII, 3454:52-63, 1998.
5. F. Sloboda, B. Zat̂ko, and J. Stoer. On approximation of planar one-dimensional continua. In R. Klette, A. Rosenfeld, and F. Sloboda, editors, Advances in Digital and Computational Geometry, pages 113-160. Springer, Singapore, 1998.