Dynamic maintenance of shortest path trees in simple polygons

DOI10.1007/3-540-62034-6_43MaRDI QIDQ6567762zbMATH OpenFDO

Authors Sanjiv Kapoor, Tripurari Singh

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-62034-6_43

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Dynamic algorithms for shortest paths in planar graphs
• Maintenance of a minimum spanning forest in a dynamic plane graph
• scientific article; zbMATH DE number 219245

Cites work

• A data structure for dynamic trees
• Euclidean shortest paths in the presence of rectilinear barriers
• scientific article; zbMATH DE number 177567 (Why is no real title available?)

This page was built for publication: Dynamic maintenance of shortest path trees in simple polygons

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