Abstract
We give an overview of the problems for global polyhedrization in 3D digital images and present a solution by using our results of flatness analysis. We take both analytical and combinatorial topological approaches to define our flatness measurement which enable us to measure the degree of flatness for each point on a discretized object surface.
Thanks to JSPS Postdoctoral Fellowships for Research Abroad from 2000. A part of this work was supported by JSPS Grant-in-Aid for Encouragement of Young Scientists (12780207).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Françon, J., Papier, L.: Polyhedrization of the boundary of a voxel object. Discrete Geometry for Computer Imagery. LNCS 1568 Springer-Verlag, Berlin Heidelberg (1999) 425–434
Klette, R., Hao, J. S.: A new global polyhedrization algorithm for digital regular solids. Proceedings of IVCNZ’00 (2000) 150–155
Lorensen, W. E., Cline, H. E.: Marching cubes: a high-resolution 3d surface construction algorithm. Computer Graphics (SIGGRAPH’ 87) 21(4) (1987) 163–169
Kenmochi, Y., Klette, R.: Surface area estimation for digitized regular solids. Vision Geometry IX. Proceedings of SPIE 4117 (2000) 100–111
Françon, J., Schramm, J. M., Tajine, M.: Recognizing arithmetic straight lines and planes. Discrete Geometry for Computer Imagery. LNCS 1176 Springer-Verlag, Berlin Heidelberg (1996) 141–150
Debled-Rennesson, I., Reveillés, J.P.: Incremental algorithm for recognizing pieces of digital planes. Vision Geometry V. Proceedings of SPIE 2826 (1996) 140–151
Kenmochi, Y., Imiya, A., Ichikawa, A.: Boundary extraction of discrete objects. Computer Vision and Image Understanding 71(3) (1998) 281–293
Aleksandrov, P.S.: Combinatorial topology I. Graylock Press, Rochester N.Y. (1956)
Kenmochi, Y., Imiya, A.: Naive planes as discrete combinatorial surfaces. Discrete Geometry for Computer Imagery. LNCS 1953 Springer-Verlag, Berlin Heidelberg (2000) 249–261
Kovalevsky, V.: A topological method of surface representation: Discrete Geometry for Computer Imagery. LNCS 1568 Springer-Verlag, Berlin Heidelberg (1999) 118–135
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kenmochi, Y., Chunyan, L., Kotani, K. (2001). Flatness Analysis of Three-Dimensional Images for Global Polyhedrization. In: Skarbek, W. (eds) Computer Analysis of Images and Patterns. CAIP 2001. Lecture Notes in Computer Science, vol 2124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44692-3_59
Download citation
DOI: https://doi.org/10.1007/3-540-44692-3_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42513-7
Online ISBN: 978-3-540-44692-7
eBook Packages: Springer Book Archive