Abstract
In this paper we present a fast algorithm that constructs a parameterization of certain classes of simply connected three-dimensional digital objects. A local search strategy is used to increase the convexity of the object without destroying neighborhood relations of the surface. The resulting object is easily parameterized and by a pull-back of this parameterization, we can approximate the original object in terms of spherical harmonic functions. Finally, limitations of the method as well as different directions for future research are discussed.
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
Blane, M.M., Lei, Z., Civi, H., Cooper, D.B.: The 3L Algorithm for Fitting Implicit Polynomial Curves and Surfaces to Data. Pattern Analysis and Machine Intelligence 22(3), 298–313 (2001)
Borgefors, G.: On Digital Distance Transforms in Three Dimensions. Computer Vision and Image Understanding 64(3), 368–376 (1996)
Borgefors, G., Sanniti di Baja, G.: Analyzing non-convex 2D and 3D patterns. Computer Vision and Image Understanding 63(1), 145–157 (1996)
Bransden, B.H., Joachain, C.J.: Introduction to Quantum Mechanics. Addison Wesley Longman Limited, Amsterdam (1989)
Brechbühler, C., Gerig, G., Kübler, O.: Parametrization of Closed Surfaces for 3-D Shape Description. Computer Vision and Image Understanding 61(2), 154–170 (1995)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Kovalevsky, V.: Interlaced Spheres and Multidimensional Tunnels, Report University of Rostock, Germany (2000)
Udupa, J.K., Ajjangadde, V.G.: Boundary and object labelling in threedimensional images. Computer Vision Graphics and Image Processing 51(3), 355–369 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weistrand, O. (2003). A Fast Algorithm for Constructing Parameterizations of Three-Dimensional Simply Connected Digital Objects. In: Petkov, N., Westenberg, M.A. (eds) Computer Analysis of Images and Patterns. CAIP 2003. Lecture Notes in Computer Science, vol 2756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45179-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-45179-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40730-0
Online ISBN: 978-3-540-45179-2
eBook Packages: Springer Book Archive