Shortest Path Queries in Polygonal Domains

DOI10.1007/978-3-540-68880-8_20MaRDI QIDQ3511429zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack

Publication date 10 July 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68880-8_20

Mathematics Subject Classification ID

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

Recommendations

• Querying two boundary points for shortest paths in a polygonal domain
• Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• scientific article; zbMATH DE number 512835

Cites work

• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• scientific article; zbMATH DE number 1305410 (Why is no real title available?)
• scientific article; zbMATH DE number 5059852 (Why is no real title available?)
• On geometric path query problems
• Optimal Search in Planar Subdivisions
• Optimal shortest path queries in a simple polygon

Cited in

(17)

• Fast computation of shortest watchman routes in simple polygons
• Optimal shortest path queries in a simple polygon
• The polygon burning problem
• Shortest paths in simple polygons with polygon-meet constraints
• Shortest path to a segment and quickest visibility queries
• Approximate Shortest Path Queries Using Voronoi Duals
• Querying Approximate Shortest Paths in Anisotropic Regions
• Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
• The geodesic diameter of polygonal domains
• Querying two boundary points for shortest paths in a polygonal domain
• scientific article; zbMATH DE number 742973 (Why is no real title available?)
• A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
• A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
• Approximate Shortest Paths in Polygons with Violations
• Shortest Path in a Polygon using Sublinear Space.
• Shortest rectilinear path queries to rectangles in a rectangular domain
• Towards space efficient two-point shortest path queries in a polygonal domain

This page was built for publication: Shortest Path Queries in Polygonal Domains

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