---
res:
  bibo_abstract:
  - A generalization of the convex hull of a finite set of points in the plane is
    introduced and analyzed. This generalization leads to a family of straight-line
    graphs, " \alpha -shapes," which seem to capture the intuitive notions of "fine
    shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs
    of the closest point or furthest point Delaunay triangulation. Relying on this
    result an optimal O(n \log n) algorithm that constructs \alpha -shapes is developed.@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: David
      foaf_name: Kirkpatrick, David
      foaf_surname: Kirkpatrick
  - foaf_Person:
      foaf_givenName: Raimund
      foaf_name: Seidel, Raimund
      foaf_surname: Seidel
  bibo_doi: '10.1109/TIT.1983.1056714 '
  bibo_issue: '4'
  bibo_volume: 29
  dct_date: 1983^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0018-9162
  - http://id.crossref.org/issn/1558-0814
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: On the shape of a set of points in the plane@
...