The one-local-maximum-per-way conjecture for polygon fillings
Statement
Let be the polygonal domain under consideration, and let be its medial axis divided into pieces. A way is a distribution of discs over these pieces, written
with and when the -th piece is a junction point.
One-local-maximum-per-way conjecture. There is at most one local maximum per way.
If true, an optimal -disc filling could be found by generating a maximum for every way; this would reduce the search to a finite collection whose size is of order when of the pieces are junctions. Whether a way can support multiple local maxima is not resolved in the supplied text.
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.