Central points for sets in ℝn (or: The chocolate ice-cream problem)

S. Hoory*, N. Linial

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Let A be a subset of the unit ball in ℝn, and let 0 < r < 1 be real. Find a point x for which the intersection of the r-neighborhood of x with A has a large measure. Tight bounds on this measure are found.

Original languageAmerican English
Pages (from-to)467-479
Number of pages13
JournalDiscrete and Computational Geometry
Volume15
Issue number4
DOIs
StatePublished - Jun 1996

Fingerprint

Dive into the research topics of 'Central points for sets in ℝn (or: The chocolate ice-cream problem)'. Together they form a unique fingerprint.

Cite this