"An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay ..."

Gary M. Shute, Linda L. Deneen, Clark D. Thomborson (1991)

> Home

Details and statistics

DOI: 10.1007/BF01759042

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ShuteDT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ShuteDT91
Gary M. Shute, Linda L. Deneen, Clark D. Thomborson:
An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations. Algorithmica 6(2): 207-221 (1991)

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.