IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-22244-3_6.html
   My bibliography  Save this book chapter

Tree Based Voxelization of STL Data

In: High Performance Computing on Vector Systems 2011

Author

Listed:
  • Daniel F. Harlacher

    (German Research School for Simulation Sciences GmbH, and RWTH)

  • Manuel Hasert

    (German Research School for Simulation Sciences GmbH, and RWTH)

  • Harald Klimach

    (German Research School for Simulation Sciences GmbH, and RWTH)

  • Simon Zimny

    (German Research School for Simulation Sciences GmbH, and RWTH)

  • Sabine Roller

    (German Research School for Simulation Sciences GmbH, and RWTH)

Abstract

This work presents a mesh generation strategy for large scale distributed parallel computations.29pc]Please provide affiliations for authors “Manuel Hasert, Harald Klimach, Simon Zimny and Sabine Roller”. The mesh generation algorithm based on an octree decomposition of arbitrarily complex geometries is presented and the format used to store the mesh data is detailed. The resulting mesh data encoding the complete tree information is very compact and mostly requires only 16 bytes per element. The format is well suited for parallel processing, especially parallel IO to avoid serialization all over the simulation, even in initialization. It is highly portable by the usage of simple 8 byte signed integer numbers only. As input to the mesh generator the widely used STL data format is chosen for geometry representations. The described software Seeder is available under an open source license.

Suggested Citation

  • Daniel F. Harlacher & Manuel Hasert & Harald Klimach & Simon Zimny & Sabine Roller, 2011. "Tree Based Voxelization of STL Data," Springer Books, in: Michael Resch & Xin Wang & Wolfgang Bez & Erich Focht & Hiroaki Kobayashi & Sabine Roller (ed.), High Performance Computing on Vector Systems 2011, pages 81-92, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-22244-3_6
    DOI: 10.1007/978-3-642-22244-3_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-22244-3_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.