Abstract
Preparing a CAD model for Finite Element (FE) analysis can be a time-consuming task, where shape and mesh simplifications play an important role. It is important that the simplified model has the same mechanical properties as the original one, and that the deviation from the original stays within a given tolerance.
Most FE mesh simplification algorithms are either fully or partially sequential, and are therefore not suitable for architectures with high levels of parallelism. Furthermore, the use of processors such as GPUs of IBMs Cell BE require algorithms to be adapted to benefit from their computational advantages. Here, we present an algorithm written for parallel processors, and its implementation for the Cell BE.
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
Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference, pp. 307–314 (1968)
Purcell, T.J., Donner, C., Cammarano, M., Jensen, H.W., Hanrahan, P.: Photon mapping on programmable graphics hardware. In: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, pp. 41–50. Eurographics Association (2003)
Owens, J., Houston, M., Luebke, D., Green, S., Stone, J., Phillips, J.: GPU computing. Proceedings of the IEEE 96(5), 879–899 (2008)
Gotsman, C., Gumhold, S., Kobbelt, L.: Simplification and compression of 3d meshes. In: Tutorials on Multiresolution in Geometric Modelling, pp. 319–361. Springer, Heidelberg (2002)
Schroeder, W.J., Zarge, J.A., Lorensen, W.E.: Decimation of triangle meshes. In: SIGGRAPH 18992: Proceedings of the 19th annual conference on Computer graphics and interactive techniques, pp. 65–70. ACM, New York (1992)
Hoppe, H.: View-dependent refinement of progressive meshes. In: SIGGRAPH 1997: Proceedings of the 24th annual conference on Computer graphics and interactive techniques, pp. 189–198. ACM Press/Addison-Wesley Publishing Co., New York (1997)
Kobbelt, L., Campagna, S., peter Seidel, H.: A general framework for mesh decimation. In: Proceedings of Graphics Interface, pp. 43–50 (1998)
Dadoun, N., Kirkpatrick, D.G.: Parallel algorithms for fractional and maximal independent sets in planar graphs. Discrete Appl. Math. 27(1-2), 69–83 (1990)
Karp, R.M., Wigderson, A.: A fast parallel algorithm for the maximal independent set problem. In: STOC 1984: Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp. 266–272. ACM, New York (1984)
Franc, M., Skala, V.: Parallel triangular mesh decimation without sorting. In: SCCG 2001: Proceedings of the 17th Spring conference on Computer graphics, Washington, DC, USA, p. 22. IEEE Computer Society, Los Alamitos (2001)
Botsch, M., Bommes, D., Vogel, C., Kobbelt, L.: GPU-based tolerance volumes for mesh processing. In: PG 2004: Proceedings of the Computer Graphics and Applications, 12th Pacific Conference on (PG 2004), Washington, DC, USA, pp. 237–243. IEEE Computer Society, Los Alamitos (2004)
Hjelmervik, J., Léon, J.C.: GPU-accelerated shape simplification for mechanical-based applications. In: Shape Modeling International, pp. 91–102 (2007)
DeCoro, C., Tatarchuk, N.: Real-time mesh simplification using the GPU. In: I3D 2007: Proceedings of the 2007 symposium on Interactive 3D graphics and games, pp. 161–166. ACM, New York (2007)
Govindaraju, N., Gray, J., Kumar, R., Manocha, D.: GPUTeraSort: high performance graphics co-processor sorting for large database management. In: SIGMOD 2006: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pp. 325–336. ACM, New York (2006)
Inoue, H., Moriyama, T., Komatsu, H., Nakatani, T.: AA-sort: A new parallel sorting algorithm for multi-core SIMD processors. In: PACT 2007: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques, pp. 189–198. IEEE Computer Society, Los Alamitos (2007)
Bader, D.A., Agarwal, V., Madduri, K.: On the design and analysis of irregular algorithms on the Cell processor: A case study of list ranking. In: Proc. of the 21st International Parallel and Distributed Processing Symposium, pp. 1–10. IEEE, Los Alamitos (2007)
IBM: Software development kit for multicore acceleration version 3.1: Programmers guide (August 2008)
Véron, P., Léon, J.C.: Shape preserving polyhedral simplification with bounded error. Computers & Graphics 22(5), 565–585 (1998)
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
Hjelmervik, J.M., Léon, JC. (2010). Simplification of FEM-Models on Cell BE. In: Dæhlen, M., Floater, M., Lyche, T., Merrien, JL., Mørken, K., Schumaker, L.L. (eds) Mathematical Methods for Curves and Surfaces. MMCS 2008. Lecture Notes in Computer Science, vol 5862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11620-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-11620-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11619-3
Online ISBN: 978-3-642-11620-9
eBook Packages: Computer ScienceComputer Science (R0)