ON GEOMETRIC PATH QUERY PROBLEMS

DOI10.1142/S0218195901000675MaRDI QIDQ4682151zbMATH OpenFDO

Authors Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk

Publication date 10 June 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195901000675

zbMATH Keywords

mapoptimal pathvisibility graphgatewayGeometric path query

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On geometric path query problems
• scientific article; zbMATH DE number 1302178
• L₁ shortest path queries among polygonal obstacles in the plane
• scientific article; zbMATH DE number 1305410
• Two-point \(L_1\) shortest path queries in the plane

Cites work

• A new data structure for shortest path queries in a simple polygon
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Applications of a Planar Separator Theorem
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• Minimum-link paths among obstacles in the plane
• On graphs preserving rectilinear shortest paths in the presence of obstacles
• On parallel rectilinear obstacle-avoiding paths
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Parallel rectilinear shortest paths with rectangular obstacles
• Rectilinear paths among rectilinear obstacles
• Rectilinear short path queries among rectangular obstacles
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• \(L_ 1\) shortest paths among polygonal obstacles in the plane

Cited in

(9)

• Structured discrete shape approximation: theoretical complexity and practical algorithm
• On geometric path query problems
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• scientific article; zbMATH DE number 7559259 (Why is no real title available?)
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• Minimum-link shortest paths for polygons amidst rectilinear obstacles
• Computing shortest paths in the plane with removable obstacles
• Towards space efficient two-point shortest path queries in a polygonal domain
• Reachable region query and its applications

This page was built for publication: ON GEOMETRIC PATH QUERY PROBLEMS

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