Papers › A Lighthouse Illumination Problem
A Lighthouse Illumination Problem
Erhan Tezcan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper discusses a problem that consists of n "lighthouses" which are circles with radius 1, placed around a common center, equidistant at n units away from the placement center. Consecutive lighthouses are separated by the same angle: 360°/n which we denote as α. Each lighthouse "illuminates" facing towards the placement center with the same angle α, also called "Illumination Angle" in this case. As for the light source itself, there are two variations: a single point light source at the center of each lighthouse and point light sources on the arc seen by the illumination angle for each lighthouse. The problem: what is the total dark (not illuminated) area for a given number of lighthouses, and as the number of lighthouses approach infinity? We show that by definition of the problem, neighbor lighthouses do not overlap or be tangent to each other. We propose a solution for the center point light source case and discuss several small cases of n for the arc light source case.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections