Skip to main content
Springer Nature Link
Log in

Simplification of FEM-Models on Cell BE

  • Conference paper
Mathematical Methods for Curves and Surfaces (MMCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5862))

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference, pp. 307–314 (1968)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Owens, J., Houston, M., Luebke, D., Green, S., Stone, J., Phillips, J.: GPU computing. Proceedings of the IEEE 96(5), 879–899 (2008)

    Article  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Kobbelt, L., Campagna, S., peter Seidel, H.: A general framework for mesh decimation. In: Proceedings of Graphics Interface, pp. 43–50 (1998)

    Google Scholar 

  8. 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)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Hjelmervik, J., Léon, J.C.: GPU-accelerated shape simplification for mechanical-based applications. In: Shape Modeling International, pp. 91–102 (2007)

    Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. 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)

    Google Scholar 

  16. 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)

    Google Scholar 

  17. IBM: Software development kit for multicore acceleration version 3.1: Programmers guide (August 2008)

    Google Scholar 

  18. Véron, P., Léon, J.C.: Shape preserving polyhedral simplification with bounded error. Computers & Graphics 22(5), 565–585 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sintef ICT, Pb. 124, N-0134, Blindern, Oslo

    Jon Mikkelsen Hjelmervik

  2. Grenoble Institute of Technology, G-SCOP Laboratory, Grenoble Universités, 46 av. Félix, Viallet, F-38000

    Jon Mikkelsen Hjelmervik & Jean-Claude Léon

Authors
  1. Jon Mikkelsen Hjelmervik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Claude Léon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Oslo, Norway

    Morten Dæhlen  & Tom Lyche  & 

  2. Department of Informatics and Centre of Mathematics for Applications, University of Oslo, Norway

    Michael Floater

  3. INSA de Rennes, Rennes, France

    Jean-Louis Merrien

  4. Department of Informatics and Centre of Mathematics for Applications, University of Oslo, Oslo, Norway

    Knut Mørken

  5. Department of Mathematics, Vanderbilt University, 37240, Nashville, TN, USA

    Larry L. Schumaker

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics