Abstract
This paper discusses the application of another type of subdivision pattern, namely, the subdivision surfaces work as a mesh surface approximation of the original data, thus the grid data is resampled by using sub-sampling points. Specifically, in a number of algorithms based on edge collapse or triangle, the triangle is removed to a new edge collapse or vertex, the algorithm presented with the segmentation method to calculate the new vertex location to replace the traditional quadratic surface fitting algorithm or direct averaging method of calculation. polyhedral mesh simplification, especially triangular mesh simplification has been for nearly a decade, during which a large number of proposed algorithm, also published a number of reviews, here for a comprehensive review will not only simplify the background needed for the grid and make a brief review of related work, the rest of the content of the proposed algorithm is described.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ochiai, Y., Yasutomi, Z.: Improved method generating a free-form surface using integral equations. CAGD 17(3), 233–245 (2000)
Peters, J., Reif, U.: Analysis of algorithms generalizing B-spline subdivision. SIAM Journal on Numerical Analysis 35(2), 728–748 (1998)
Peters, J., Umlauf, G.: Gaussian and mean curvature of subdivision surfaces. TR 2000-01, CISE, University of Florida
Popovic, J., Hoppe, H.: Progressive simplicial complexes. In: Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, pp. 217–224 (1997)
Prautzsch, H.: Analysis of-subdivision surfaces at extraordinary points. Oberwolfach (1995)
Prautzsch, H., Umlauf, G.: A-subdivision algorithm. In: Farin, G., Bieri, H., Brunnet, G., DeRose, T. (eds.) Geometric Modeling, Computing Suppl., vol. 13, pp. 217–224. Springer-Verlag (1998)
Prautzsch, H., Umlauf, G.: Improved triangular subdivision schemes. In: Wolter, F.-E., Patrikalakis, N.M. (eds.) Proceedings of the CGI 1998, Hannover, pp. 626–632 (1998)
Prautzsch, H., Umlauf, G.: A and a subdivision scheme for triangular nets. Int. J. Shape Modelling 6(1), 21–35 (2000)
Qin, H., Mandal, C., Vemuri, B.C.: Dynamic Catmull-Clark subdivision surfaces. IEEE Transactions on Visualization and Computer Graphics 4(3), 215–229 (1998)
Reif, U.: A unified approach to subdivision algorithms near extraordinary vertices. CAGD 12(2), 153–174 (1995)
Riesenfeld, R.F.: On Chaikin’s algorithm. Computer Graphics and Image Processing 4, 153–174 (1975)
Sanglikar, M.A., Koparkar, P., Joshi, V.N.: Modelling rolling ball blends for CAGD. CAGD 7(5), 399–414 (1990)
Vani, M.P.: Computer Aided Interactive Process of Teaching Statistics Methodology – III Evaluation Questionnaire for LearnersThrough statistical display using Bar chart. IEIT Journal of Adaptive & Dynamic Computing 2011(4), 9–14 (2011), DOI=10.5813/www.ieit-web.org/IJADC/20114.2
Ye, Y.H., Liu, W.P., Dao, B.: BIM-Based Durability Analysis for RC Structures. IEIT Journal of Adaptive & Dynamic Computing 2011(4), 15–24 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jingsong, C. (2013). Research on the Application Subdivision Pattern in Triangular Mesh Simplification. In: Du, Z. (eds) Proceedings of the 2012 International Conference of Modern Computer Science and Applications. Advances in Intelligent Systems and Computing, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33030-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-33030-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33029-2
Online ISBN: 978-3-642-33030-8
eBook Packages: EngineeringEngineering (R0)