Is the flip graph of tetrahedralizations in 3D connected?
Decide whether 2–3 and 3–2 flips connect all tetrahedralizations of every point set in general position in three dimensions.
File it in the catalog (shoal-catalog 0521c19bbd38)
Browse files+22 −0 scienceslack.json added View file
| @@ -0,0 +1,22 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "topics": [ | |
| 4 | + "computational-geometry", | |
| 5 | + "discrete-geometry" | |
| 6 | + ], | |
| 7 | + "type": "proof", | |
| 8 | + "also": [ | |
| 9 | + "construction" | |
| 10 | + ], | |
| 11 | + "source": { | |
| 12 | + "key": "topp", | |
| 13 | + "name": "The Open Problems Project", | |
| 14 | + "url": "https://topp.openproblem.net/p28", | |
| 15 | + "id": "28", | |
| 16 | + "curator": "Erik D. Demaine, Joseph S. B. Mitchell and Joseph O'Rourke", | |
| 17 | + "poser": "Herbert Edelsbrunner, Franco P. Preparata and Douglas B. West; Barry Joe", | |
| 18 | + "status": "open", | |
| 19 | + "as_of": "2026-10-20", | |
| 20 | + "catalog": "0521c19bbd38" | |
| 21 | + } | |
| 22 | +} | |