Near-linear algorithm for the planar segment center problem

Alon Efrat, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

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) that minimizes the maximum euclidean distance from e to the points of P. We present an algorithm that solves the problem in time O(n log4 n log log n), improving the previous solution of Agarwal et al. by nearly a factor of O(n).

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
PublisherPubl by ACM
Pages87-97
Number of pages11
ISBN (Print)0898713293
StatePublished - Jan 1 1994
Externally publishedYes
EventProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA
Duration: Jan 23 1994Jan 25 1994

Publication series

NameProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Other

OtherProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
CityArlington, VA, USA
Period1/23/941/25/94

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

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

  • Cite this

    Efrat, A., & Sharir, M. (1994). Near-linear algorithm for the planar segment center problem. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (pp. 87-97). (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms). Publ by ACM.