---
res:
  bibo_abstract:
  - Let S denote a set of n points in the Euclidean plane. A halfplanar range query
    specifies a halfplane h and requires the determination of the number of points
    in S which are contained in h. A new data structure is described which stores
    S in O(n) space and allows us to answer a halfplanar range query in O(nlog2(1+√5)−1)
    time in the worst case, thus improving the best result known before. The structure
    can be built in O(n log n) time.@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.1016/0020-0190(86)90088-8
  bibo_issue: '5'
  bibo_volume: 23
  dct_date: 1986^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0020-0190
  - http://id.crossref.org/issn/1872-6119
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Halfplanar range search in linear space and O(n0.695) query time@
...