---
res:
  bibo_abstract:
  - A plane geometric graph C in ℝ2 conforms to another such graph G if each edge
    of G is the union of some edges of C. It is proved that, for every G with n vertices
    and m edges, there is a completion of a Delaunay triangulation of O(m2 n) points
    that conforms to G. The algorithm that constructs the points is also described.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Herbert
      foaf_name: Edelsbrunner, Herbert
      foaf_surname: Edelsbrunner
      foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9823-6833
  - foaf_Person:
      foaf_givenName: Tiow
      foaf_name: Tan, Tiow
      foaf_surname: Tan
  bibo_doi: 10.1007/BF02573974
  bibo_issue: '1'
  bibo_volume: 10
  dct_date: 1993^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0179-5376
  dct_language: eng
  dct_publisher: Springer@
  dct_title: An upper bound for conforming Delaunay triangulations@
...