"An O(n log n) Algorithm for Finding a Shortest Central Link Segment."

Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack (2000)

> Home

Details and statistics

DOI: 10.1142/S0218195900000103

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcga/AleksandrovDS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/AleksandrovDS00
Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. 10(2): 157-188 (2000)

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.