A fully dynamic algorithm for planar width

DOI10.1007/S00454-003-2923-8MaRDI QIDQ1404528zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan

Publication date 21 August 2003

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-003-2923-8

Mathematics Subject Classification ID

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

Recommendations

• A fully dynamic algorithm for planar
• Incremental and Decremental Maintenance of Planar Width
• scientific article; zbMATH DE number 1305508
• Off-line dynamic maintenance of the width of a planar point set
• scientific article; zbMATH DE number 1629856

Cited in

(12)

• Off-line dynamic maintenance of the width of a planar point set
• Dynamic geometric data structures via shallow cuttings
• 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
• scientific article; zbMATH DE number 7559224 (Why is no real title available?)
• A fully dynamic algorithm for planar
• Dynamically maintaining the widest k-dense corridor
• Constrained two-line center problems
• Dynamic coresets

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

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