Skip to Main content Skip to Navigation
Journal articles

Centerpoint theorems for wedges

Abstract : The Centerpoint Theorem states that, for any set S of n points in R(d), there exists a point p in R(d) such that every closed halfspace containing p contains at least [n/(d + 1)] points of S. We consider generalizations of the Centerpoint Theorem in which halfspaces are replaced with wedges (cones) of angle alpha. In R(2), we give bounds that are tight for all values of ff and give an O(n) time algorithm to find a point satisfying these bounds. We also give partial results for R(3) and, more generally, R(d).
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, May 7, 2014 - 4:16:26 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:35:31 AM


Files produced by the author(s)


  • HAL Id : hal-00988186, version 1



Jeff Erickson, Ferran Hurtado, Pat Morin. Centerpoint theorems for wedges. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (1), pp.45--54. ⟨hal-00988186⟩



Record views


Files downloads