The following pages link to Connect-the-dots: A new heuristic (Q3805971):
Displaying 11 items.
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- \(r\)-regular shape reconstruction from unorganized points (Q1265284) (← links)
- Algorithms for ordering unorganized points along parametrized curves (Q1316076) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Onion polygonizations (Q1351597) (← links)
- Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited (Q1862125) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- Non-convex contour reconstruction (Q2638822) (← links)
- Reconstructing curves with sharp corners (Q5946435) (← links)
