February 6, 2020 Conference paper Open Access

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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.3653420</identifier>
  <creators>
    <creator>
      <creatorName>Marot, Célestin</creatorName>
      <givenName>Célestin</givenName>
      <familyName>Marot</familyName>
      <affiliation>Université catholique de Louvain</affiliation>
    </creator>
    <creator>
      <creatorName>Verhetsel, Kilian</creatorName>
      <givenName>Kilian</givenName>
      <familyName>Verhetsel</familyName>
      <affiliation>Université catholique de Louvain</affiliation>
    </creator>
    <creator>
      <creatorName>Remacle, Jean-François</creatorName>
      <givenName>Jean-François</givenName>
      <familyName>Remacle</familyName>
      <affiliation>Université catholique de Louvain</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Reviving the Search for Optimal Tetrahedralizations</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2020</publicationYear>
  <subjects>
    <subject>SPR</subject>
    <subject>reconnection</subject>
    <subject>mesh generation</subject>
    <subject>topological transformation</subject>
    <subject>optimal triangulation</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2020-02-06</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3653420</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3653419</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/imr28</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&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;</description>
  </descriptions>
</resource>