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

S. Hoory; N. Linial

doi:10.1007/BF02711520

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

S. Hoory^*, N. Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Let A be a subset of the unit ball in ℝⁿ, 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 language	English
Pages (from-to)	467-479
Number of pages	13
Journal	Discrete and Computational Geometry
Volume	15
Issue number	4
DOIs	https://doi.org/10.1007/BF02711520
State	Published - Jun 1996

Access to Document

10.1007/BF02711520

Cite this

@article{aa82e41882ed44cf931bbda45081add2,

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

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.",

author = "S. Hoory and N. Linial",

year = "1996",

month = jun,

doi = "10.1007/BF02711520",

language = "אנגלית",

volume = "15",

pages = "467--479",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

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

AU - Hoory, S.

AU - Linial, N.

PY - 1996/6

Y1 - 1996/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030526560&partnerID=8YFLogxK

U2 - 10.1007/BF02711520

DO - 10.1007/BF02711520

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0030526560

SN - 0179-5376

VL - 15

SP - 467

EP - 479

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 4

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this