Discrete & Computational Geometry

, Volume 12, Issue 3, pp 291–312 | Cite as

Computing a centerpoint of a finite planar set of points in linear time

  • S. Jadhav
  • A. Mukhopadhyay


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 log3n) 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C]
    R. Cole. Slowing down sorting networks to obtain faster sorting algorithms.J. Assoc. Comput. Mach., 34(1):200–208, 1987.MathSciNetCrossRefGoogle Scholar
  2. [CSY]
    R. Cole, M. Sharir, and C. Yap. Onk-hulls and related problems.SIAM J. Comput., 16: 61–77, 1987.MATHMathSciNetCrossRefGoogle Scholar
  3. [E]
    H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.MATHCrossRefGoogle Scholar
  4. [JM]
    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.Google Scholar
  5. [Ma]
    J. Matoušek. Approximations and optimal geometric divide-and-conquer.Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 505–511, 1991.Google Scholar
  6. [Me1]
    N. Megiddo. Linear-time algorithms for linear programming in ℜ3 and related problems.SIAM J. Comput., 12(4):759–776, 1983.MATHMathSciNetCrossRefGoogle Scholar
  7. [Me2]
    N. Megiddo. Partitioning with two lines in the plane.J. Algorithms, 3:430–433, 1985.MathSciNetCrossRefGoogle Scholar
  8. [T]
    Shang-Hua Teng. Center Points and Graph Separators. Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, 1993.Google Scholar
  9. [YB]
    I. M. Yaglom and V. G. Boltyanskii.Convex Figures, Holt, Rinehart and Winston, New York, 1961.MATHGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1994

Authors and Affiliations

  • S. Jadhav
    • 1
  • A. Mukhopadhyay
    • 1
  1. 1.Department of Computer ScienceIndian Institute of TechnologyKanpurIndia

Personalised recommendations