The class of simple cube-curves whose MLPs cannot have vertices at grid points

Lecture Notes in Computer Science

Volumn 3429, Issue , 2005, Pages 183-194

  Li, Fajie ^a   Klette, Reinhard ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

GRID OF CELLS; GRID VERTEX; POLYGONAL CURVE; POLYHEDRALLY BOUNDED SET;

CURVE FITTING;

EID: 24344454366     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31965-8_18     Document Type: Conference Paper

References (8)

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. Klette and A. Rosenfeld. Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco, 2004., 2004.
3. F. Sloboda, B. Zatko, and R. Klette. On the topology of grid continua. SPIE Vision Geometry VII, 3454:52-63, 1998.
4. F. Sloboda, B. Zatko, and J. Stoer. On approximation of planar one-dimensional grid continua. In R. Klette, A. Rosenfeld, and F. Sloboda, editors, Advances in Digital and Computational Geometry, pages 113-160. Springer, Singapore, 1998.
5. A. Jonas and N. Kiryati. Length estimation in 3-D using cube quantization, J. Math. Imaging and Vision, 8: 215-238, 1998.
6. F. Li and R. Klette. Minimum-length polygon of a simple cube-curve in 3D space. In Proceedings IWCIA2004, LNCS3322 (to appear).
7. J. Canny and J.H. Reif. New lower bound techniques for robot motion planning problems. Proc. IEEE Conf. Foundations Computer Science, pages 49-60, 1987.
8. J. Choi, J. Sellen, and C.-K. Yap. Approximate Euclidean shortest path in 3-space. Proc. ACM Conf. Computational Geometry, ACM Press, pages 41-48, 1994.