Dynamic planar point location in optimal time

DOI10.1145/3406325.3451100MaRDI QIDQ6065227zbMATH OpenOpenAlexFDO

Authors Yakov Nekrich

Publication date 14 November 2023

Published in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

computational geometrydynamic data structurespoint location

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• scientific article; zbMATH DE number 1617272 (Why is no real title available?)
• scientific article; zbMATH DE number 1779434 (Why is no real title available?)
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Nearly time-optimal kernelization algorithms for the line-cover problem with big data
• Dynamic planar point location with optimal query time

This page was built for publication: Dynamic planar point location in optimal time

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