Computing Simple Paths on Points in Simple Polygons

DOI10.1007/978-3-540-89550-3_5MaRDI QIDQ5302737zbMATH OpenOpenAlexFDO

Authors Ovidiu Daescu, Jun Luo

Publication date 13 January 2009

Published in Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89550-3_5

Mathematics Subject Classification ID

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

Recommendations

• Computing simple paths from given points inside a polygon
• Finding simple paths on given points in a polygonal region
• Computing simple paths among obstacles
• Shortest paths in the plane with convex polygonal obstacles
• Finding a shortest Hamiltonian path inside a simple polygon

Cites work

• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Computing simple paths among obstacles
• Computing the visibility graph of points within a polygon
• Generating random polygons with given vertices
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• Polygons Have Ears

Cited in

(4)

• Computing simple paths among obstacles
• Computing simple paths from given points inside a polygon
• Computing a maxian point of a simple rectilinear polygon
• Finding simple paths on given points in a polygonal region

This page was built for publication: Computing Simple Paths on Points in Simple Polygons

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