Covering 10 points, a surprisingly tricky puzzle.
A mathematical puzzle is presented asking whether 10 arbitrary points on a 2D plane can always be covered by non-overlapping unit discs (radius 1). The puzzle explores edge cases from covering all points with one disc to requiring individual discs for each point.
Summary
The transcript presents a geometric puzzle involving 10 points placed anywhere on a two-dimensional plane. The challenge is to determine whether these points can always be covered using unit discs (discs with radius 1) that must be completely disjoint - meaning they cannot overlap at all. The speaker provides two illustrative scenarios to frame the problem: if all 10 points are clustered close together, a single unit disc could potentially cover them all; conversely, if the points are spread far apart from each other, each point would require its own individual disc for coverage. The core question posed is whether this covering is always mathematically possible regardless of the spatial configuration of the 10 points, making this a universal feasibility problem in computational geometry.
Key Insights
- The speaker presents a puzzle about covering 10 arbitrary points on a 2D plane with non-overlapping unit discs
- The discs must have a radius of exactly one unit and cannot overlap with each other
- If all 10 points are sufficiently close together, they could potentially be covered by a single disc
- If all points are far away from each other, each point could be covered with its own individual disc
- The central question asks whether disjoint disc coverage is always possible regardless of point configuration
Topics
Full transcript available for MurmurCast members
Sign Up to Access