Pages that link to "Item:Q4706226"
From MaRDI portal
The following pages link to Semi-Online Maintenance of Geometric Optima and Measures (Q4706226):
Displaying 14 items.
- An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Dynamic data structures for approximate Hausdorff distance in the word RAM (Q680153) (← links)
- Dynamic coresets (Q834605) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- (Q5088951) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
