A near-linear algorithm for the planar segment-center problem

A. Efrat, M. Sharir

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


Let P be a set of n points in the plane and let e be a segment of fixed length. The segment-center problem is to find a placement of e (allowing translation and rotation) which minimizes the maximum euclidean distance from e to the points of P. We present an algorithm that solves the problem in time O(n1+ε), for any ε > 0, improving the previous solution of Agarwal et al. [3] by nearly a factor of O(n).

Original languageEnglish (US)
Pages (from-to)239-257
Number of pages19
JournalDiscrete and Computational Geometry
Issue number3
StatePublished - Oct 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'A near-linear algorithm for the planar segment-center problem'. Together they form a unique fingerprint.

Cite this