Finding a shortest Hamiltonian path inside a simple polygon

DOI10.1016/0020-0190(96)00103-2MaRDI QIDQ671605zbMATH OpenOpenAlexFDO

Authors M. 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)

Recommendations

• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
• The shortest path in a simple polygon with obstacles
• Shortest paths in simple polygons with polygon-meet constraints
• Finding the shortest watchman route in a simple polygon
• Shortest path in a polygon using sublinear space
• Shortest Path in a Polygon using Sublinear Space.
• Shortest path between two simple polygons
• Optimal shortest path queries in a simple polygon
• Shortest paths in the plane with polygonal obstacles
• Finding an approximate minimum-link visibility path inside a simple polygon

Cites work

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

Cited in

(3)

• Every longest Hamiltonian path in even \(n\)-gons
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
• Computing Simple Paths on Points in Simple Polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671605)