Abstract
The boundary of 3-D tomographic objects is modelled by polygons for the purpose of visualization. At first boundary faces of 3-D regions are detected and transformed into a list of small edges. The detection step is solved by the boundary tracking algorithm of Artzy et al.[1] Next in a polygon growing step adjacent coplanar edges are merged into planar loops. The advantages of independent subscene analysis in relation to the implementation of Frieder et al. [2] are also discussed.
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
Artzy E.,Frieder G.,Herman G.T.: The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm, CGiP, 15 (1981), No.1, 11–24.
Frieder G., Herman G.T., Meyer C., Udupa J.: Large Software Problems for Small Computers. An Example from Medical Imaging, IEEE Software, 2 (1985), No. 5, 37–47.
Jaman K.A.,Gordon R.,Rangayyan R.M.: Display of 3D Anisotropic Images from Limited-View Computed Tomograms, CVGIP, 30 (1985), 345–361.
Meagher D.: Geometric modeling using octree encoding, CGIP, 19 (1982), No.2, 129–147.
Herman G.T., Udupa I.K.: Display of 3-D digital images: computational foundations and medical applications, IEEE CG A, 3 (1983), No. 5, 39–46.
Gordon D., Udupa J.K.: Fast Surface Tracking in Three- Dimensional Binary Images, CVGIP, 45 (1989), 196–214.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasprzak, W. (1989). A Two-Step Modelling Algorithm for Tomographic Scenes. In: Burkhardt, H., Höhne, K.H., Neumann, B. (eds) Mustererkennung 1989. Informatik-Fachberichte, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75102-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-75102-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51748-1
Online ISBN: 978-3-642-75102-8
eBook Packages: Springer Book Archive