eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-06-20
17:1
17:15
10.4230/LIPIcs.SoCG.2017.17
article
Reachability in a Planar Subdivision with Direction Constraints
Binham, Daniel
Manhaes de Castro, Pedro Machado
Vigneron, Antoine
Given a planar subdivision with n vertices, each face having a cone of possible directions of travel, our goal is to decide which vertices of the subdivision can be reached from a given starting point s. We give an O(n log n)-time algorithm for this problem, as well as an Omega(n log n) lower bound in the algebraic computation tree model. We prove that the generalization where two cones of directions per face are allowed is NP-hard.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol077-socg2017/LIPIcs.SoCG.2017.17/LIPIcs.SoCG.2017.17.pdf
Design and analysis of geometric algorithms
Path planning
Reachability