Abstract
We propose in this paper an arithmetical definition of 3-D discrete lines as well as an efficient construction algorithm. From this notion, an algorithm of 3-D discrete lines segmentation has been developed. It is then used to calculate the length of a discrete curve. Ap roof of the multigrid convergence of length estimators is presented.
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
J. Amanatides and A. Woo. A fast voxel traversal algorithm for ray tracing. In Eurographic’s 87, pages 3–12, 1987.
E. Andres. Le plan discret. In Colloque en géométrie discrète en imagerie: fondements et applications, Septembre 1993.
T. Asano, Y. Kawamura, R. Klette, and K. Obokata. A new approximation scheme for digital objects and curve length estimations. Technical Report CITR-TR-65, Computer Science Departement of The University of Auckland, September 2000.
J. E. Bresenham. Algorithm for computer control of a digital plotter. In IBM System Journal, volume 4, pages 25–30, 1965.
D. Cohen and A. Kaufman. Scan-conversion algorithms for linear and quadratic objects. In IEEE Computer Society Press, Los Alamitos, Calif, pages 280–301, 1991.
D. Cohen-Or and A. Kaufman. 3d line voxelization and connectivity control. In IEEE Computer Graphics and Applications, pages 80–87, 1997.
I. Debled-Rennesson. Etude et reconnaissance des droites et plans discrets. PhD thesis, Thèse. Université Louis Pasteur, Strasbourg, 1995.
I. Debled-Rennesson and J. P. Reveillès. A new approach to digital planes. In In Vision Geometry III, SPIE, Boston, volume 2356, pages 12–21, 1994.
I. Debled-Rennesson and J. P. Reveillès. A linear algorithm for segmentation of digital curves. In International Journal of Pattern Recognition and Artificial Intelligence, volume 9, pages 635–662, 1995.
L. Dorst and A. W. M. Smeulders. Length estimators for digitized contours. Computer Vision, Graphics, and Image Processing, 40(3):311–333, December 1987.
L. Dorst and A. W. M. Smeulders. Decomposition of discrete curves into piecewise straight segments in linear time. In Contemporary Mathematics, volume 119, 1991.
O. Figueiredo and J. P. Reveillès. Acon tribution to 3d digital lines. In Proc. DCGI’5, pages 187–198, 1995.
A. Jonas and N. Kiryati. Digital representation schemes for 3d curves. Pattern Recognition, 30(11):1803–1816, 1997.
A. Kaufman. An algorithm for 3-d scan conversion of polygons. In Proc. Eurographic’s87, pages 197–208, 1987.
A. Kaufman. Efficient algorithms for 3-d scan conversion of parametric curves, surfaces, volumes. In Computer Graphic 21, 4, pages 171–179, 1987.
A. Kaufman and E. Shimony. 3-d scan conversion algorithms for voxel-based graphics. In ACM Workshop on Interactive 3D Graphics, ACM Press, NY, pages 45–75, 1986.
C. E. Kim. Three-dimensional digital line segments. In IEEE Transactions on Pattern Analysis and Machine Intelligence, volume 5, pages 231–234, 1983.
N. Kiryati and A. Jonas. Length estimation in 3d using cube quantization. Journal of Mathematical Imaging and Vision, 8:215–2138, 1998.
N. Kiryati and O. Kubler. On chain code probabilities and length estimators for digitized three dimensional curves. 1995.
R. Klette and T. Bülow. Minimum-length polygons in simple cube-curves. Discrete Geometry for Computer Imagery, pages 467–478, 2000.
R. Klette, V. Kovalevsky, and B. Yip. Lenth estimation of digital curves. In Vision Geometry VIII-SPIE, pages 117–129, Denver, July 1999.
R. Klette and J. Zunic. Convergence of calculated features in image analysis. Technical Report CITR-TR-52, Computer Science Departement of The University of Auckland, 1999.
J. Koplowitz and A. M. Bruckstein. Design of perimeter estimators for digitized planar shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-11(6):611–622, jun 1989.
V. Kovalevsky and S. Fuchs. Theoritical and experimental analysis of the accuracy of perimeter estimates. In Robust Computer Vision, pages 218–242, 1992.
M. Lindenbaum and A. Bruckstein. On recursive, o(n) partitioning of a digitized curve into digital straigth segments. IEEE Transactions on PatternAnalysis and Machine Intelligence, PAMI-15(9):949–953, september 1993.
J. P. Reveillés. Géométrie discrète, calculs en nombre entiers et algorithmique. PhD thesis, Thèse d’état, Université Louis Pasteur, Strasbourg, 1991.
F. Sloboda, B. Zatko, and P. Ferianc. Advances in Digital and Computational Geometry, chapter On approximation of planar one-dimensional continua. Springer, 1998.
F. Sloboda, B. Zatko, and R. Klette. On the topology of grid continua. In Vision Geometry VII, volume SPIE Volume 3454, pages 52–63, San Diego, July 1998.
I. Stojmenović and R. Tosić. Digitization schemes and the recognition of digital straight lines, hyperplanes and flats in arbitrary dimensions. In Vision Geometry, contemporary Mathematics Series, volume 119, pages 197–212, American Mathematical Society, Providence, RI, 1991.
A. Vialard. Geometrical parameters extraction from discrete paths. Discrete Geometry for Computer Imagery, 1996.
B. Vidal. Vers un lancer de rayon discret. PhD thesis, Thèse de Doctorat, Lille, 1992.
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
Coeurjolly, D., Debled-Rennesson, I., Teytaud, O. (2001). Segmentation and Length Estimation of 3D Discrete 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_18
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