Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar ..."

Asish Mukhopadhyay, Robert L. Scot Drysdale (2006)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ queensu.ca (open access)
- export record
  dblp key:
  - conf/cccg/MukhopadhyayD06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/MukhopadhyayD06
Asish Mukhopadhyay, Robert L. Scot Drysdale:
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. CCCG 2006

a service of

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.