Computing Simple Paths on Points in Simple Polygons

DOI10.1007/978-3-540-89550-3_5zbMath1162.68742OpenAlexW164834647MaRDI QIDQ5302737

Jun Luo, Ovidiu Daescu

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)

Related Items (1)

Computing simple paths from given points inside a polygon

Cites Work

• Unnamed Item
• Computing simple paths among obstacles
• Generating random polygons with given vertices
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Polygons Have Ears
• Computing the visibility graph of points within a polygon

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