Abstract
Polygonal models have grown rapidly in complexity over recent years, yet most conventional simplification algorithms were designed to handle modest size datasets of a few tens of thousands of triangles. We present a parallel simplification method for large polygonal models. Our algorithm will partition the original model firstly, send each portion to a slave processor, simplify them concurrently, and merge them together lastly. We give an efficient method to deal with the problem of partition border and portion merging. With parallel implementation, the algorithm can handle extremely large data set, and speed up the execution time. Experiment shows that our algorithm can produce approximations of high quality.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Heckbert, P.S., Garland, M.: Survey of Polygonal Surfaces Simplification Algorithms. Technical report, CS Department, Carnegie Mellon, 1-4 (1997)
Hugues, H., Derose, T., Duchamp, T., McDonald, J., Stuetzlet, W.: Mesh Optimization. In: Proceedings of SIGGRAPH ’93, pp. 19–26 (1993)
Graland, M., Heckbert, P.S.: Surface Simplification using Quadric Error Metrics. In: Proceedings of ACM SIGGRAPH ‘97, pp. 209–216 (1997)
Cohen, J., Varshney, A., Manocha, D., Turk, G.: Simplification Envelopes. In: Proceedings of ACM SIGGRAPH ’96, pp. 119–128 (1996)
Jia, S.X., Song, L.H., Zhang, L.F.: Fast Simplification Algorithm for 3D mesh Based on Edge Collapse. In: The First International Conference on Computer Science & Education, pp. 205–208 (2006)
Chiang, Y.J., Silva, C.T., Schroeder, W.J.: Interactive Out-of-Core Isosurface Extraction. In: Proceedings of IEEE Visualization ’98 Proceedings, pp. 167–174. IEEE Computer Society Press, Los Alamitos (1998)
Lindstrom, P.: Out-of-Core Simplification of Large Polygonal Models. In: Computer Graphics(Proceedings of SIGGRAPH, 34 New York, pp. 259-262 (2000)
Cignoni, P., Rocchini, C., Scopigno, R.: Metro: Measuring Error on Simplified Surfaces. Computer Graphics Forum 17, 167–174 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Tang, X., Jia, S., Li, B. (2007). Simplification Algorithm for Large Polygonal Model in Distributed Environment. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)