Point location in zones of \(k\)-flats in arrangements
From MaRDI portal
Publication:1917049
DOI10.1016/0925-7721(95)00021-6zbMath0849.68126OpenAlexW2117998491WikidataQ56970829 ScholiaQ56970829MaRDI QIDQ1917049
Mark T. de Berg, Jack Scott Snoeyink, Otfried Schwarzkopf, Marc J. van Kreveld
Publication date: 14 July 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00021-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On ray shooting in convex polytopes
- \(\epsilon\)-nets and simplex range queries
- Cutting hyperplane arrangements
- Small-dimensional linear programming and convex hulls made easy
- Reporting points in halfspaces
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- On the zone of a surface in a hyperplane arrangement
- Point location among hyperplanes and unidirectional ray-shooting
- Applications of random sampling in computational geometry. II
- Lines in space: Combinatorics and algorithms
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- On k-Hulls and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- A Randomized Algorithm for Closest-Point Queries
- On the Zone Theorem for Hyperplane Arrangements
- On lazy randomized incremental construction
This page was built for publication: Point location in zones of \(k\)-flats in arrangements
