---
res:
  bibo_abstract:
  - This paper presents a randomized incremental algorithm for computing a single
    face in an arrangement of n line segments in the plane that is fairly simple to
    implement. The expected running time of the algorithm is O(nα(n)log n). The analysis
    of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor
    analysis technique [in Discrete Comput. Geom., 4(1989), pp. 387-421]. A few extensions
    of the technique, obtaining efficient randomized incremental algorithms for constructing
    the entire arrangement of a collection of line segments and for computing a single
    face in an arrangement of Jordan arcs are also presented.@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
  - foaf_Person:
      foaf_givenName: Leonidas
      foaf_name: Guibas, Leonidas
      foaf_surname: Guibas
  - foaf_Person:
      foaf_givenName: Micha
      foaf_name: Sharir, Micha
      foaf_surname: Sharir
  - foaf_Person:
      foaf_givenName: Jack
      foaf_name: Snoeyink, Jack
      foaf_surname: Snoeyink
  bibo_doi: '10.1137/0222077 '
  bibo_issue: '6'
  bibo_volume: 22
  dct_date: 1993^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0097-5397
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: Computing a face in an arrangement of line segments and related problems@
...