---
res:
  bibo_abstract:
  - It is shown that a triangulation of a set of n points in the plane that minimizes
    the maximum angle can be computed in time O(n2 log n) and space O(n). The algorithm
    is fairly easy to implement and is based on the edge-insertion scheme that iteratively
    improves an arbitrary initial triangulation. It can be extended to the case where
    edges are prescribed, and, within the same time- and space-bounds, it can lexicographically
    minimize the sorted angle vector if the point set is in general position. Experimental
    results on the efficiency of the algorithm and the quality of the triangulations
    obtained are included.@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: Tiow
      foaf_name: Tan, Tiow
      foaf_surname: Tan
  - foaf_Person:
      foaf_givenName: Roman
      foaf_name: Waupotitsch, Roman
      foaf_surname: Waupotitsch
  bibo_doi: 10.1137/0913058
  bibo_issue: '4'
  bibo_volume: 13
  dct_date: 1992^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0097-5397
  - http://id.crossref.org/issn/1095-7111
  dct_language: eng
  dct_publisher: Society for Industrial and Applied Mathematics @
  dct_title: An O(n^2 log n) time algorithm for the MinMax angle triangulation@
...