Dynamic maximum depth of geometric objects

DOI10.4230/LIPICS.SOCG.2025.77MaRDI QIDQ7312726zbMATH OpenFDO

Authors Subhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2025.77

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A (slightly) faster algorithm for Klee's measure problem
• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
• Decomposable searching problems I. Static-to-dynamic transformation
• Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
• Dynamic Geometric Set Cover and Hitting Set
• Dynamic geometric set cover, revisited
• Efficient partition trees
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• More dynamic data structures for geometric set cover with sublinear update time
• On a circle placement problem
• On Approximating the Depth and Related Problems
• Stabbing pairwise intersecting disks by four points

This page was built for publication: Dynamic maximum depth of geometric objects

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