The following pages link to Cutting hyperplane arrangements (Q1176317):
Displaying 35 items.
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- The power of parallel projection (Q685515) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Point location among hyperplanes and unidirectional ray-shooting (Q1330461) (← links)
- Many-face complexity in incremental convex arrangements (Q1336754) (← links)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- A note on point location in arrangements of hyperplanes (Q2390231) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- On range searching with semialgebraic sets (Q5096815) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q5970603) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
