---
res:
  bibo_abstract:
  - In 1979 Kirpatrick obtained a practically feasible algorithm for planar regionlocation
    working in linear space and logarithmic time, provided the regions are bounded
    by straight line segments. No algorithm requiring only linear space and log-polynomial
    time was known, so far, for general planar regionlocation, i.e. for the case where
    regions are bounded by curves more complicated than straight line segments. As
    main result of this paper such an algorithm is presented.@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: Hermann
      foaf_name: Maurer, Hermann
      foaf_surname: Maurer
  bibo_doi: 10.1016/0304-3975(81)90103-1
  bibo_issue: '3'
  bibo_volume: 16
  dct_date: 1981^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0304-3975
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: A space-optimal solution of general region location@
...