---
res:
  bibo_abstract:
  - Determining or counting geometric objects that intersect another geometric query
    object is at the core of algorithmic problems in a number of applied areas of
    computer science. This article presents a family of space-efficient data structures
    that realize sublinear query time for points, line segments, lines and polygons
    in the plane, and points, line segments, planes, and polyhedra in three dimensions.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: David
      foaf_name: Dobkin, David
      foaf_surname: Dobkin
  - 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/0196-6774(87)90015-0
  bibo_issue: '3'
  bibo_volume: 8
  dct_date: 1987^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0196-6774
  - http://id.crossref.org/issn/1090-2678
  dct_language: eng
  dct_publisher: Academic Press@
  dct_title: Space searching for intersecting objects@
...