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

Alfredo García Olaverri Pedro Jodrá Javier Tejel

Published in: Algorithmica (2013)

Keyphrases

hamiltonian path
simple polygon
minimum length
endpoints
convex hull
medial axis
arc length
graph theoretic
feature selection
similarity measure
euclidean distance