Document Open Access Logo

Reachability in a Planar Subdivision with Direction Constraints

Authors Daniel Binham, Pedro Machado Manhaes de Castro, Antoine Vigneron

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2017.17.pdf
  • Filesize: 0.61 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • Design and analysis of geometric algorithms
  • Path planning
  • Reachability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron. Reachability in a Planar Subdivision with Direction Constraints. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.SoCG.2017.17

Author Details

Daniel Binham
Pedro Machado Manhaes de Castro
Antoine Vigneron

References

  1. Michael Ben-Or. Lower bounds for algebraic computation trees. In Proc. 15th ACM Symposium on Theory of Computing, pages 80-86, 1983. URL: http://dx.doi.org/10.1145/800061.808735.
  2. Siu-Wing Cheng and Jiongxin Jin. Approximate shortest descending paths. In Proc. 24th ACM-SIAM Symposium on Discrete Algorithms, pages 144-155, 2013. Google Scholar
  3. Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, and Yajun Wang. Approximate shortest paths in anisotropic regions. SIAM Journal on Computing, 38(3):802-824, 2008. Google Scholar
  4. Mark de Berg, Herman J. Haverkort, and Constantinos P. Tsirogiannis. Implicit flow routing on terrains with applications to surface networks and drainage structures. In Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms, pages 285-296, 2011. Google Scholar
  5. Mark de Berg and Marc J. van Kreveld. Trekking in the alps without freezing or getting tired. Algorithmica, 18(3):306-323, 1997. URL: http://dx.doi.org/10.1007/PL00009159.
  6. John H. Reif and Zheng Sun. Movement planning in the presence of flows. Algorithmica, 39(2):127-153, 2004. URL: http://dx.doi.org/10.1007/s00453-003-1079-5.
  7. Zheng Sun and John H. Reif. On finding energy-minimizing paths on terrains. IEEE Transactions on Robotics, 21(1):102-114, 2005. URL: http://dx.doi.org/10.1109/TRO.2004.837232.
  8. Robert Endre Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1983. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact