---
res:
  bibo_abstract:
  - For H a set of lines in the Euclidean plane, $A(H)$ denotes the induced dissection,
    called the arrangement of H. We define the notion of a belt in $A(H)$, which is
    bounded by a subset of the edges in $A(H)$, and describe two algorithms for constructing
    belts. All this is motivated by applications to a host of seemingly unrelated
    problems including a type of range search and finding the minimum area triangle
    with the vertices taken from some finite set of points.@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: Emo
      foaf_name: Welzl, Emo
      foaf_surname: Welzl
  bibo_doi: 10.1137/0215019
  bibo_issue: '1'
  bibo_volume: 15
  dct_date: 1986^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0097-5397
  - http://id.crossref.org/issn/1095-7111
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: Constructing belts in two-dimensional arrangements with applications@
...