<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Generalizing CGAL periodic Delaunay triangulations</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Georg F</namePart>
  <namePart type="family">Osang</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">464B40D6-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-8882-5116</description></name>
<name type="personal">
  <namePart type="given">Mael</namePart>
  <namePart type="family">Rouxel-Labbé</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Monique</namePart>
  <namePart type="family">Teillaud</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">HeEd</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>ESA: European Symposium on Algorithms</namePart>
</name>



<name type="corporate">
  <namePart>Alpha Shape Theory Extended</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. </abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2020_LIPIcs_Osang.pdf">https://research-explorer.ista.ac.at/download/8703/8712/2020_LIPIcs_Osang.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2020</dateIssued><place><placeTerm type="text">Virtual, Online; Pisa, Italy</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>28th Annual European Symposium on Algorithms</title></titleInfo>
  <identifier type="issn">1868-8969</identifier>
  <identifier type="isbn">9783959771627</identifier><identifier type="doi">10.4230/LIPIcs.ESA.2020.75</identifier>
<part><detail type="volume"><number>173</number></detail>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/9056</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<apa>Osang, G. F., Rouxel-Labbé, M., &amp;#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In &lt;i&gt;28th Annual European Symposium on Algorithms&lt;/i&gt; (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.75&quot;&gt;https://doi.org/10.4230/LIPIcs.ESA.2020.75&lt;/a&gt;</apa>
<short>G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.</short>
<chicago>Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In &lt;i&gt;28th Annual European Symposium on Algorithms&lt;/i&gt;, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.75&quot;&gt;https://doi.org/10.4230/LIPIcs.ESA.2020.75&lt;/a&gt;.</chicago>
<ieee>G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in &lt;i&gt;28th Annual European Symposium on Algorithms&lt;/i&gt;, Virtual, Online; Pisa, Italy, 2020, vol. 173.</ieee>
<mla>Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” &lt;i&gt;28th Annual European Symposium on Algorithms&lt;/i&gt;, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.75&quot;&gt;10.4230/LIPIcs.ESA.2020.75&lt;/a&gt;.</mla>
<ama>Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: &lt;i&gt;28th Annual European Symposium on Algorithms&lt;/i&gt;. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.75&quot;&gt;10.4230/LIPIcs.ESA.2020.75&lt;/a&gt;</ama>
<ista>Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 173, 75.</ista>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>8703</recordIdentifier><recordCreationDate encoding="w3cdtf">2020-10-25T23:01:18Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-04-08T07:01:29Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
