"An O(n²log n) Time Algorithm for the MinMax Angle Triangulation."

Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch (1990)

> Home

Details and statistics

DOI: 10.1145/98524.98535

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/EdelsbrunnerTW90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/EdelsbrunnerTW90
Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch:
An O(n²log n) Time Algorithm for the MinMax Angle Triangulation. SCG 1990: 44-52

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.