@inproceedings{240b0dbabd44424d9629674be5f695bc,
title = "Near-linear algorithm for the planar segment center problem",
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).",
author = "Alon Efrat and Micha Sharir",
year = "1994",
language = "English (US)",
isbn = "0898713293",
series = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",
publisher = "Publ by ACM",
pages = "87--97",
booktitle = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",
note = "Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms ; Conference date: 23-01-1994 Through 25-01-1994",
}