Buffon Needle Problem Over Convex Sets
M. Dannenberg, W. Hagerstrom, G. Hart, A. Iosevich, T. Le, I. Li, N., Skerrett

TL;DR
This paper investigates the probability that a randomly oriented needle of length l, originating within a convex set, remains entirely inside, and shows that the disk maximizes this probability among sets with equal perimeter.
Contribution
It introduces a novel variant of the Buffon Needle problem for convex sets and proves an isoperimetric inequality related to this probability.
Findings
The disk maximizes the probability among convex sets with the same perimeter.
An isoperimetric inequality is established using convex geometry techniques.
The probability depends on the perimeter and shape of the convex set.
Abstract
We solve a variant of the classical Buffon Needle problem. More specifically, we inspect the probability that a randomly oriented needle of length originating in a bounded convex set lies entirely within . Using techniques from convex geometry, we prove an isoperimetric type inequality, showing that among sets with equal perimeter, the disk maximizes this probability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities
