Pages that link to "Item:Q5368723"
From MaRDI portal
The following pages link to Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings (Q5368723):
Displaying 12 items.
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Affine invariants of generalized polygons and matching under affine transformations (Q340532) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- (Q3035141) (← links)
- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids (Q3066140) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- (Q5115770) (← links)
- Algorithm 825 (Q5461063) (← links)