A fully dynamic algorithm for planar

DOI10.1145/378583.378660MaRDI QIDQ5361574zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan

Publication date 29 September 2017

Published in Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/378583.378660

Mathematics Subject Classification ID

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

Recommendations

• A fully dynamic algorithm for planar width
• Off-line dynamic maintenance of the width of a planar point set
• A near-optimal planarization algorithm
• An efficient parallel algorithm for planarity
• Parameterized Algorithms for Modular-Width
• Dynamic algorithms for shortest paths in planar graphs
• scientific article; zbMATH DE number 219245
• Fully dynamic planarity testing with applications
• A fully dynamic approximation scheme for shortest paths in planar graphs

Cited in

(8)

• Off-line dynamic maintenance of the width of a planar point set
• A fully dynamic algorithm for planar width
• Two approaches to building time-windowed geometric data structures
• scientific article; zbMATH DE number 1629856 (Why is no real title available?)
• scientific article; zbMATH DE number 1305508 (Why is no real title available?)
• ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE
• Incremental and Decremental Maintenance of Planar Width
• Width of points in the streaming model

This page was built for publication: A fully dynamic algorithm for planar

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