Finding simple paths on given points in a polygonal region

DOI10.1007/978-3-319-08016-1_21MaRDI QIDQ3188851zbMATH OpenOpenAlexFDO

Authors Bo Jiang, Xuehou Tan

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_21

zbMATH Keywords

computational geometryDijkstra paradigmshortest pathssimple pathsvisibility graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Computing simple paths from given points inside a polygon
• Computing Simple Paths on Points in Simple Polygons
• Computing simple paths among obstacles
• Query-points visibility constraint minimum link paths in simple polygons
• Shortest path between two simple polygons

Cited in

(7)

• Computing simple paths among obstacles
• Computing simple paths from given points inside a polygon
• scientific article; zbMATH DE number 1256695 (Why is no real title available?)
• Query-points visibility constraint minimum link paths in simple polygons
• Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
• Constructing pairwise disjoint paths with few links
• Computing Simple Paths on Points in Simple Polygons

This page was built for publication: Finding simple paths on given points in a polygonal region

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