"An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon."

Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack (1989)

> Home

Details and statistics

DOI: 10.1007/BFB0028976

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/DjidjevLS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DjidjevLS89
Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107

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.