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)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Unnamed Item, An improved algorithm for Klee's measure problem on fat boxes, Minimum-sum dipolar spanning tree in \(\mathbb R^3\), Dynamic data structures for approximate Hausdorff distance in the word RAM, Dynamic coresets, Approximating the volume of unions and intersections of high-dimensional geometric objects, Dynamic connectivity for axis-parallel rectangles, A (slightly) faster algorithm for Klee's measure problem, Minimizing the diameter of a spanning tree for imprecise points, Dynamic geometric data structures via shallow cuttings, The discrete and mixed minimax 2-center problems, REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION, The Discrete and Mixed Minimax 2-Center Problem