Computing simple paths from given points inside a polygon

DOI10.1016/J.DAM.2018.09.020MaRDI QIDQ1630775zbMATH OpenOpenAlexWikidataFDO

Authors Bo Jiang, Xuehou Tan

Publication date 10 December 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2018.09.020

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 on Points in Simple Polygons
• Finding simple paths on given points in a polygonal region
• Computing simple paths among obstacles
• Shortest path between two simple polygons
• Query-point visibility constrained shortest paths in simple polygons

Cites work

• A new data structure for shortest path queries in a simple polygon
• Computing simple paths among obstacles
• Computing Simple Paths on Points in Simple Polygons
• Computing the visibility graph of points within a polygon
• Generating random polygons with given vertices
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• Introduction to algorithms.
• Optimal shortest path queries in a simple polygon
• Visibility and intersection problems in plane geometry

Cited in

(3)

• Computing simple paths among obstacles
• Finding simple paths on given points in a polygonal region
• Computing Simple Paths on Points in Simple Polygons

This page was built for publication: Computing simple paths from given points inside a polygon

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