Computing simple paths from given points inside a polygon

DOI10.1016/j.dam.2018.09.020zbMath1403.68319OpenAlexW2898478485WikidataQ129049088 ScholiaQ129049088MaRDI QIDQ1630775

Bo Jiang, Xue-Hou 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

shortest pathscomputational geometryvisibility graphsimple pathsDijkstra paradigm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• A new data structure for shortest path queries in a simple polygon
• Computing simple paths among obstacles
• Optimal shortest path queries in a simple polygon
• Generating random polygons with given vertices
• Computing Simple Paths on Points in Simple Polygons
• Computing the visibility graph of points within a polygon

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