Abstract
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 curve’s length is defined to be that of the minimum-length polygonal curve (MLP) fully contained and complete in the tube of the curve. So far only one general algorithm called rubber-band algorithm was known for the approximative calculation of such an MLP. A proof that this algorithm always converges to the correct curve, is still an open problem. This paper proves that the rubber-band algorithm is correct for the family of first-class simple cube-curves.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bülow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence 24, 962–970 (2002)
Klette, R., Rosenfeld, A.: Digital Geometery: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Sloboda, F., Zaťko, B., Klette, R.: On the topology of grid continua. In: SPIE Vision Geometry VII, vol. 3454, pp. 52–63 (1998)
Sloboda, F., Zaťko, B., Stoer, J.: On approximation of planar one-dimensional grid continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113–160. Springer, Singapore (1998)
Jonas, A., Kiryati, N.: Length estimation in 3-D using cube quantization. J. Math. Imaging and Vision 8, 215–238 (1998)
Li, F., Klette, R.: Minimum-length polygon of a simple cube-curve in 3D space. In: Klette, R., Žunić, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 502–511. Springer, Heidelberg (2004)
Li, F., Klette, R.: The class of simple cube-curves whose MLPs cannot have vertices at grid points. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 183–194. Springer, Heidelberg (2005)
Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. IEEE Conf. Foundations Computer Science, pp. 49–60 (1987)
Choi, J., Sellen, J., Yap, C.-K.: Approximate Euclidean shortest path in 3-space. In: Proc. ACM Conf. Computational Geometry, pp. 41–48. ACM Press, New York (1994)
Douglass, S.A.: Introduction to Mathematical Analysis. Addison-Wesley Publishing Company, Reading (1996)
Wachsmuth, B.G.: Interactive Real Analysis (2000), http://www.shu.edu/projects/reals/index.html
Moore, T.O.: Elementary General Topology. Prentice-Hall, Inc., Englewood Cliffs (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, F., Klette, R. (2005). Minimum-Length Polygons of First-Class Simple Cube-Curves. In: Gagalowicz, A., Philips, W. (eds) Computer Analysis of Images and Patterns. CAIP 2005. Lecture Notes in Computer Science, vol 3691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556121_40
Download citation
DOI: https://doi.org/10.1007/11556121_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28969-2
Online ISBN: 978-3-540-32011-1
eBook Packages: Computer ScienceComputer Science (R0)