Minimizing Distance-to-Sight in Polygonal Domains

DOI10.4230/LIPICS.ISAAC.2018.59OpenAlexW2904659240MaRDI QIDQ5091052FDOQ5091052

Authors: Eunjin Oh 

Publication date: 21 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10007/pdf/LIPIcs-ISAAC-2018-59.pdf/

Recommendations

• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• On Romeo and Juliet problems: minimizing distance-to-sight
• On Romeo and Juliet problems: minimizing distance-to-sight
• scientific article; zbMATH DE number 140463

zbMATH Keywords

visibility in polygonal domainsshortest path in polygonal domains

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Maintenance of configurations in the plane
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Parallel Merge Sort
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• On a class of \(O(n^2)\) problems in computational geometry
• Computational geometry in a curved world
• Computing the visibility polygon of an island in a polygonal domain
• Quickest visibility queries in polygonal domains
• Parallel methods for visibility and shortest-path problems in simple polygons
• Computing shortest paths among curved obstacles in the plane
• Shortest path to a segment and quickest visibility queries
• On Romeo and Juliet problems: minimizing distance-to-sight

Cited In (3)

• Voronoi-based splinegon decomposition and shortest-path tree computation
• On Romeo and Juliet problems: minimizing distance-to-sight
• Title not available (Why is that?)

This page was built for publication: Minimizing Distance-to-Sight in Polygonal Domains

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