Abstract
One possible definition of the length of a digitized curve in 3D is the length of the shortest polygonal curve lying entirely in a cube curve. In earlier work the authors proposed an iterative algorithm for the calculation of this minimal length polygonal curve (MLP). This paper reviews the algorithm and suggests methods to speed it up by reducing the set of possible locations of vertices of the MLP, or by directly calculating MLP-vertices in specific situations. Altogether, the paper suggests an in-depth analysis of 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
Th. Bülow and R. Klette. Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves. In: Proc. 15th Intern. Conf. Pattern Recognition, 2000, vol. 3:551–555.
R. Busemann and W. Feller. Krümmungseigenschaften konvexer Flächen. Acta Mathematica, 66:27–45, 1935.
J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. IEEE Foundations of Computer Science, 28:49–60, 1987.
J. Choi, J. Sellen, C.-K. Yap. Approximate Euclidean shortest path in 3-space. In: Proc. 10th ACM Conf. Computat. Geometry, 41–48, 1994.
D. Coeurjolly, I. Debled-Rennesson, O. Teytaud. Segmentation and length estimation of 3D curves. Chapter in this book.
A. Jonas, N. Kiryati. Length estimation on 3-D using cube quantization. JMIV, 8:215–238, 1998.
R. Klette, V. Kovalevsky, and B. Yip. On the length estimation of digital curves. In: Proc. SPIE Conf. Vision Geometry VIII, 3811:52–63, 1999.
R. Klette and Th. Bülow. Critical edges in simple cube-curves. In: Proc. DGCI’2000, Uppsala December 2000, LNCS 1953, 467–478.
F. Sloboda, B. Zaťko, and P. Ferianc. Minimum perimeter polygon and its application. in: Theoretical Foundations of Computer Vision (R. Klette, W. G. Kropatsch, eds.), Mathematical Research 69, Akademie Verlag, Berlin, 59–70, 1992.
F. Sloboda and Ľ. Bačík. On one-dimensional grid continua in R 3. Report of the Institute of Control Theory and Robotics, Bratislava, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bülow, T., Klette, R. (2001). Approximation of 3D Shortest Polygons in Simple Cube Curves. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43079-7
Online ISBN: 978-3-540-45576-9
eBook Packages: Springer Book Archive