The eventual junction-occupation conjecture for optimal polygon fillings
Statement
Let be the polygonal domain under consideration and let be its medial axis, including its junction points. An optimal filling solution is a filling by discs maximizing the paper's filling measure.
Eventual junction-occupation conjecture. For a given and , there is an such that for , the junction points are always occupied in the optimal filling solutions.
If true, sufficiently large optimal fillings would occupy every junction point. The supplied text uses this claim to justify eventual self-correction of the heuristic algorithm, but provides no proof or resolution status.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.