Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon


Given an n-vertex convex polygon, we show that a shortest Hamiltonian path visiting all vertices without imposing any restriction on the starting and ending vertices of the path can be found in O(nlogn) time and Θ(n) space. The time complexity increases to O(nlog2 n) for computing this path inside an n-vertex simple polygon. The previous best algorithms for… (More)
DOI: 10.1007/s00453-011-9603-5


4 Figures and Tables