Finding a shortest Hamiltonian path inside a simple polygon

DOI10.1016/0020-0190(96)00103-2zbMath1023.68682OpenAlexW2035300099MaRDI QIDQ671605

Muhammad H. Alsuwaiyel

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00103-2

zbMATH Keywords

computational geometryHamiltonian pathsimple polygonwatchman route

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimum watchman routes
• Finding the shortest watchman route in a simple polygon
• Minimal link visibility paths inside a simple polygon

This page was built for publication: Finding a shortest Hamiltonian path inside a simple polygon