No-common-edge shortest paths conjecture for multitriangulations
No-common-edge shortest paths conjecture for multitriangulations
Let and be -triangulations of the -gon, and let be their flip graph. A -relevant edge is an edge eligible to occur in a -triangulation.
No-common-edge shortest paths conjecture.
- A shortest path in between and never flips a common edge of and .
- If is a -relevant edge of , is the unique bisector of the two -stars of containing , and is an edge of , then some shortest path from to first flips .
The source says the first assertion is known for ordinary triangulations and presents these statements as open in the multitriangulation setting.
Sources & referencesView supporting material
Primary source
Vincent Pilaud, “Multitriangulations, pseudotriangulations and some problems of realization of polytopes”, arXiv:1009.1605 (2010).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.