Conference paper Open Access

Reviving the Search for Optimal Tetrahedralizations

Marot, Célestin; Verhetsel, Kilian; Remacle, Jean-François


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">SPR</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">reconnection</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">mesh generation</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">topological transformation</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">optimal triangulation</subfield>
  </datafield>
  <controlfield tag="005">20200207072049.0</controlfield>
  <controlfield tag="001">3653420</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">October 14-17, 2019</subfield>
    <subfield code="g">IMR</subfield>
    <subfield code="a">28th International Meshing Roundtable</subfield>
    <subfield code="c">Buffalo, New York, USA</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Université catholique de Louvain</subfield>
    <subfield code="a">Verhetsel, Kilian</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Université catholique de Louvain</subfield>
    <subfield code="a">Remacle, Jean-François</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">4242648</subfield>
    <subfield code="z">md5:7aaaed664a43938967892d7ea73ebe26</subfield>
    <subfield code="u">https://zenodo.org/record/3653420/files/22-Marot.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">http://imr.sandia.gov</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-02-06</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-imr28</subfield>
    <subfield code="o">oai:zenodo.org:3653420</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Université catholique de Louvain</subfield>
    <subfield code="a">Marot, Célestin</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Reviving the Search for Optimal Tetrahedralizations</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-imr28</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;This paper revisits a local mesh modification method known as the Small Polyhedron Reconnection (SPR) [1]. The core of the SPR operation is a branch and bound algorithm which computes the best 3D triangulation (tetrahedralization) of a polyhedron through an efficient exploration of the set of all its triangulations. The search can accomodate for additional geometric constraints and will inevitably find the highest quality triangulation of the polyhedron if a triangulation exists. This paper focuses on the design of an optimized SPR operator and its application to improving the quality of finite element meshes. Compared to the original algorithm, a speed-up of 10 million is obtained by changing the heuristics determining the search space exploration order. This enables the integration of the SPR operator into standard mesh generation procedures. We show quality improvements obtained by applying this operation to meshes that have already been optimized using smoothing and edge removal techniques.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.3653419</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.3653420</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
158
165
views
downloads
All versions This version
Views 158158
Downloads 165165
Data volume 700.0 MB700.0 MB
Unique views 143143
Unique downloads 145145

Share

Cite as