ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the polygonal domain under consideration and let M(G)M(G) be its medial axis, including its junction points. An optimal filling solution is a filling by NN discs maximizing the paper's filling measure.

Eventual junction-occupation conjecture. For a given GG and M(G)M(G), there is an N′N' such that for N≥N′N\geq N', 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.