Abstract
The notion of a centerpoint of a finite set of points in two and higher dimensions is a generalization of the concept of the median of a set of reals. In this paper we present a linear-time algorithm for computing a centerpoint of a set ofn points in the plane, which is optimal compared with theO(n log3 n) complexity of the previously best-known algorithm. We use suitable modifications of the hamsandwich cut algorithm in [Me2] and the prune-and-search technique of Megiddo [Me1] to achieve this improvement.
Article PDF
Similar content being viewed by others
References
R. Cole. Slowing down sorting networks to obtain faster sorting algorithms.J. Assoc. Comput. Mach., 34(1):200–208, 1987.
R. Cole, M. Sharir, and C. Yap. Onk-hulls and related problems.SIAM J. Comput., 16: 61–77, 1987.
H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
S. Jadhav and A. Mukhopadhyay. Designing optimal geometric algorithms using partial sorting networks. Technical Report TRCS-93-165, Indian Institute of Technology, Kanpur, 1993. Accepted in the Third National Seminar on Theoretical Computer Science, 1993, Kharagpur, India.
J. Matoušek. Approximations and optimal geometric divide-and-conquer.Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 505–511, 1991.
N. Megiddo. Linear-time algorithms for linear programming in ℜ3 and related problems.SIAM J. Comput., 12(4):759–776, 1983.
N. Megiddo. Partitioning with two lines in the plane.J. Algorithms, 3:430–433, 1985.
Shang-Hua Teng. Center Points and Graph Separators. Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, 1993.
I. M. Yaglom and V. G. Boltyanskii.Convex Figures, Holt, Rinehart and Winston, New York, 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jadhav, S., Mukhopadhyay, A. Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput Geom 12, 291–312 (1994). https://doi.org/10.1007/BF02574382
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574382