Connect-the-dots: A new heuristic

DOI10.1016/S0734-189X(87)80169-XzbMath0657.68118OpenAlexW2030874518MaRDI QIDQ3805971

Heather Booth, Richard Washington, Joseph O'Rourke

Publication date: 1987

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0734-189x(87)80169-x

zbMATH Keywords

search heuristicsimple polygonminimal spanning Voronoi tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Related Items (11)

Onion polygonizations ⋮ Non-convex contour reconstruction ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ An upper bound on the shortness exponent of inscribable polytopes ⋮ On polyhedra induced by point sets in space ⋮ Reconstructing curves with sharp corners ⋮ \(r\)-regular shape reconstruction from unorganized points ⋮ Toughness and Delaunay triangulations ⋮ Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited ⋮ Algorithms for ordering unorganized points along parametrized curves ⋮ A workbench for computational geometry

This page was built for publication: Connect-the-dots: A new heuristic