Computing a double-ray center for a planar point set

Alex Glozman, Klara Kedem, Gregory Shpitalnik

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


A double-ray configuration is a configuration in the plane consisting of two rays emanating from one point. Given a set 5 of n points in the plane, we want to find a double-ray configuration that minimizes the Hausdorff distance from S to this configuration. We call this problem the double-ray center problem. We present an efficient algorithm for computing the double-ray center for set S of n points in the plane which runs in time O(n3α(n) log2n).

Original languageEnglish
Pages (from-to)109-123
Number of pages15
JournalInternational Journal of Computational Geometry and Applications
Issue number2
StatePublished - 1 Jan 1999


  • Algorithm
  • Center
  • Hausdorff distance
  • Optimization
  • Planar point set

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Computing a double-ray center for a planar point set'. Together they form a unique fingerprint.

Cite this