On geometric path query problems

DOI10.1007/3-540-63307-3_64MaRDI QIDQ5096943zbMATH OpenOpenAlexFDO

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

Publication date 19 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63307-3_64

zbMATH Keywords

path queryoptimal pathSteiner pointvisibility complexquery point

Mathematics Subject Classification ID

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
• Two-point \(L_1\) shortest path queries in the plane
• scientific article; zbMATH DE number 1305410

Cites work

• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 1263244 (Why is no real title available?)
• scientific article; zbMATH DE number 1182917 (Why is no real title available?)
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Finding level-ancestors in trees
• Matrix searching with the shortest path metric
• Minimum-link paths among obstacles in the plane
• On Some Distance Problems in Fixed Orientations
• Rectilinear Path Problems among Rectilinear Obstacles Revisited
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• THE VISIBILITY COMPLEX
• Topologically sweeping visibility complexes via pseudotriangulations

Cited in

(4)

• Evaluating geometric queries using few arithmetic operations
• ON GEOMETRIC PATH QUERY PROBLEMS
• Straight-path queries in trajectory data
• Shortest Path Queries in Polygonal Domains

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 Q5096943)