---
res:
  bibo_abstract:
  - 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. @eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Georg F
      foaf_name: Osang, Georg F
      foaf_surname: Osang
      foaf_workInfoHomepage: http://www.librecat.org/personId=464B40D6-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-8882-5116
  - foaf_Person:
      foaf_givenName: Mael
      foaf_name: Rouxel-Labbé, Mael
      foaf_surname: Rouxel-Labbé
  - foaf_Person:
      foaf_givenName: Monique
      foaf_name: Teillaud, Monique
      foaf_surname: Teillaud
  bibo_doi: 10.4230/LIPIcs.ESA.2020.75
  bibo_volume: 173
  dct_date: 2020^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959771627
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Generalizing CGAL periodic Delaunay triangulations@
...