"A shrinking-circle sweep-algorithm to construct the farthest site delaunay ..."

Bruno Adam et al. (1998)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2024-07-02

- view
  - electronic edition @ mcgill.ca (archived)
- export record
  dblp key:
  - conf/cccg/AdamKSS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/AdamKSS98
Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner:
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane. CCCG 1998

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.