Abstract
We propose a polygonal surface simplification algorithm that can preserve semantic features without user control. The semantic features of a model are important for human perception, which are insensitive to small geometric errors. Using an edge detects: Its three kinds of maps are employed to extract these features. First, an image map is generated boundary lines represent changes of chroma in the texture image by using edge detector. Second, the discrete curvatures at 3D vertices are mapped to the curvature map, and their data is also analyzed by an edge detector. Finally, a feature map is generated by combining the image and curvature maps. By finding areas of the 2D map that correspond to areas of the 3D model, semantic features can be preserved after simplification. We demonstrate this experimentally.
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
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. In: VisMath 2002, Berlin (2002)
Desbrun, M., Meyer, M., Schroder, P., Barr, A.: Discrete Differential Geometry Operators for Triangulated 2-manifolds, 2nd edn. Springer, Heidelberg
Dyn, N., Hormann, K., Kim, S.-J., Levin, D.: Optimizing 3D Triangulations Using Discrete Curvature Analysis. Mathematical Methods for Curves and Surface, 135–146 (2001)
Dyn, N., Levin, D., Rippa, S.: Numerical Procedures for Surface Fitting of Scattered Data by Radial Functions. In: Proceedings of SIAM, pp. 639–659 (1986)
Floater, M.S.: Parameterization and smooth approximation of surface triangulations. Computer Aided Geometric Design, 231–250 (1997)
Garland, M., Heckbert, P.S.: Simplifying surfaces with color and texture using quadric error metrics. In: Proceedings of IEEE Visualization 1998, pp. 263–269 (1998)
Gonzalez, R., Woods, R.: Digital Image Processing, pp. 414–428. Addison Wesley, Reading (1992)
Hoppe, H.: New Quadric Metric for simplifying Meshes with Appearance Attributes. In: Proceedings of IEEE Visualization, pp. 59–66 (1999)
Hubeli, A., Gross, M.: Multiresolution Feature Extraction from Unstructured Meshes. In: Proceedings of IEEE Visualization 2001 (2001)
Kim, S.-J., Kim, S.-K., Kim, C.-H.: Discrete Differential Error Metric For Surface Simplification. In: Proceedings of Pacific Graphics 2002, pp. 276–283 (October 2002)
Kim, S.-J., Levin, D., Kim, C.-H.: Surface Simplification Using Discrete Curvature Norm. Computers & Graphics (2002)
Kho, Y., Garland, M.: User-Guided Simplification. In: Proceedings of ACM Symposium on Interactive 3D Graphics (2003)
Levy, B.: Constrained Texture Mapping for Polygonal Meshes. In: Proceedings of SIGGRAPH, pp. 417–424 (2003)
Lindstrom, P., Turk, G.: Fast and memory efficient polygonal simplification. In: Proceedings of IEEE Visualization 1998, pp. 279–286 (1998)
Pojar, E., Schmalstieg, D.: User-controlled creation of multiresolution meshes. In: Proceedings of ACM Symposium on Interactive 3D Graphics, pp. 127–130 (2003)
Rossignac, J., Borrel, P.: Multi-resolution 3D approximations for rendering complex scenes. In: Modeling in Computer Graphics: Methods and Application, pp. 455–465 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SK., Lee, J., Lim, CS., Kim, CH. (2005). Surface Simplification with Semantic Features Using Texture and Curvature Maps. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_116
Download citation
DOI: https://doi.org/10.1007/11424857_116
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)