Semi-Online Maintenance of Geometric Optima and Measures
From MaRDI portal
Publication:4706226
DOI10.1137/S0097539702404389zbMath1046.68111MaRDI QIDQ4706226
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (14)
Dynamic coresets ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ The discrete and mixed minimax 2-center problems ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ An improved algorithm for Klee's measure problem on fat boxes ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Dynamic geometric data structures via shallow cuttings ⋮ REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION ⋮ Dynamic data structures for approximate Hausdorff distance in the word RAM ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ Unnamed Item ⋮ Dynamic connectivity for axis-parallel rectangles ⋮ A (slightly) faster algorithm for Klee's measure problem
This page was built for publication: Semi-Online Maintenance of Geometric Optima and Measures
