Termination of the point-to-edge matching uncrossing algorithm
Statement
Let be points and let be edges of a convex hull, with each point matched to one edge and the resulting triangles considered as in the preceding heuristic. Termination conjecture. The algorithm described above always terminates. This is presented as an observation relevant to the matching problem in the discussion, but no proof or resolution is given 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.