---
res:
  bibo_abstract:
  - 'Let P be a set of n points in the Euclidean plane and let C be a convex figure.
    We study the problem of preprocessing P so that for any query point q, the points
    of P in C+q can be retrieved efficiently. If constant time sumces for deciding
    the inclusion of a point in C, we then demonstrate the existence of an optimal
    solution: the algorithm requires O(n) space and O(k + log n) time for a query
    with output size k. If C is a disk, the problem becomes the wellknown fixed-radius
    neighbour problem, to which we thus provide the first known optimal solution.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Bernard
      foaf_name: Chazelle, Bernard
      foaf_surname: Chazelle
  - 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
  bibo_doi: 10.1016/S0747-7171(85)80028-6
  bibo_issue: '1'
  bibo_volume: 1
  dct_date: 1985^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0747-7171
  - http://id.crossref.org/issn/1095-855X
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Optimal solutions for a class of point retrieval problems@
...