Covering a disc with n equilateral triangles · n = 8
Continuously cover the unit disc with n congruent equilateral triangles. Overlap and protrusion are allowed; minimise the common side.
Formal definition
- ContainerThe closed disc D = {(x,y) : (x−1)² + (y−1)² ≤ 1}
- SubmissionA common side s and exactly n {x,y,turn,down} placements, each independently rotatable and flippable
- CoverEvery point of D belongs to at least one closed covering triangle
- Exact continuous verificationThe 3n edges are extended to lines; on each face of that arrangement every triangle's membership is constant, so the disc is covered exactly when no face meeting the open disc is empty. Faces are sampled as trapezoids in vertical strips, all arithmetic in Q(√3); the circle enters only as whether a trapezoid meets the open disc, which is a rational comparison. No pixel sampling and no epsilon anywhere
- ScoreThe side s shared by every covering triangle; smaller is better
- ObjectiveMinimise s over all legal covers