Abstract
To obtain reconstruction of surfaces from a given contours stack, this paper presents a new algorithm based on MC-algorithm, which solves the problem that 3D surface model cannot be built because the first/last contour has no previous/next contour information, or there are only isolated contours. Meanwhile, the algorithm is applied to extracting section contour of the 3D model in any cutting plane. The algorithm does not need to do as following: traverse and rebuild each triangle of the 3D model, obtain the points of intersection with the cutting plane, and link all points of intersection to get the contour in cutting plane. The algorithm divides the cutting plane into rectangular grid and gets isoline in each marching rectangle directly, without considering the problem of connections of all points of intersection. The 2D sectional contour can be obtained directly after finishing calculating isoline in the rectangular grid.
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
Fuchs, H., Kedem, Z.M., Uselton, S.P.: Optimal surfaces reconstruction from planar contours. Communication of the ACM 20(10), 693–702 (1977)
Keppel, E.: Approximating complex surfaces by triangulation of contour lines. IBM Journal of Research Development 19(1), 2–11 (1975)
Christiansen, H.N., Sederberg, T.W.: Conversion of complex contour line definitions into polygonal element mosaics. Computer Graphics 12(3), 187–192 (1978)
Ganapathy, S., Dennehy, T.G.: A new general triangulation method for planar contours. Computer Graphics 16(3), 69–75 (1982)
Ekoule, A.B., Peyrin, F.C., Odet, C.L.: A triangulation algorithm from arbitrary shaped multiple planar contours. ACM Transactions on Graphics 10(2), 182–199 (1991)
Meyers, D., Skinner, S.: Surfaces from Contours. ACM Transactions on Graphics 11(3), 228–258 (1992)
Mark, W., Jones, C.M.: A new approach to the construction of surfaces from contour data. Euro Graphics 13(3), 75–84 (1994)
Lorensen, W.E., Cline, H.E.: Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics 21(4), 163–169 (1987)
Nielson, G.M., Hamann, B.: The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes. In: IEEE Proceedings of Visualization, pp. 83–91 (1991)
Lotjonen, J., Reiss man, P.J., Magnin, I.E., et al.: A triangulation method of an arbitrary point set for biomagnetic problems. IEEE Transactions on Magnetics 34(4), 2228–2233 (1998)
Dolenc, A., Makela, L.: Slicing procedures for layered manufacturing techniques. Computer aided Design 26, 119–126 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gong, C., Tang, C., Cheng, Y., Cheng, S., Zhang, J. (2010). An Algorithm for Reconstruction of Surface from Parallel Contours and Its Section Contour Extraction in any Cutting Plane. In: Li, K., Li, X., Ma, S., Irwin, G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE LSMS 2010 2010. Communications in Computer and Information Science, vol 97. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15853-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-15853-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15852-0
Online ISBN: 978-3-642-15853-7
eBook Packages: Computer ScienceComputer Science (R0)