Point location in arrangements of hyperplanes
From MaRDI portal
Publication:690248
Recommendations
- scientific article; zbMATH DE number 4074477
- A note on point location in arrangements of hyperplanes
- Point location among hyperplanes and unidirectional ray-shooting
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Dynamic point location in arrangements of hyperplanes
Cited in
(44)- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- An algorithm for generalized point location and its applications
- Subquadratic algorithms for algebraic 3SUM
- On approximate nearest neighbors under \(l_\infty\) norm
- Evaluating geometric queries using few arithmetic operations
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
- Cell-probe lower bounds for the partial match problem
- Quadratic stabilization of a nonlinear aeroelastic system using a novel neural-network-based controller
- Computation of gamma-linear projected barcodes for multiparameter persistence
- Approximating nearest neighbor among triangles in convex position
- Point location among hyperplanes and unidirectional ray-shooting
- The point-location problem for three-dimensional space
- On the multisource hyperplanes location problem to fitting set of points
- scientific article; zbMATH DE number 4074477 (Why is no real title available?)
- Proximate planar point location
- Efficient evaluation of specific queries in constraint databases
- Topological complexity of the range searching
- Enumerating projections of integer points in unbounded polyhedra
- An affine invariant \(k\)-nearest neighbor regression estimate
- Systems of coordinates associated with points scattered in the plane
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Near neighbor search via efficient average distortion embeddings
- Conic nearest neighbor queries and approximate Voronoi diagrams
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Index structures for fast similarity search for real-valued vectors. I
- Locating lines and hyperplanes. Theory and algorithms
- Finding a vector orthogonal to roughly half a collection of vectors
- IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING
- Range minima queries with respect to a random permutation, and approximate range counting
- Anchored hyperplane location problems
- Approximating Minimization Diagrams and Generalized Proximity Search
- Data-driven stabilization of unknown nonlinear dynamical systems using a cognition-based framework
- scientific article; zbMATH DE number 6387618 (Why is no real title available?)
- Generalized comparison trees for point-location problems
- Nearly sharp complexity bounds for multiprocessor algebraic computations
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- A note on point location in arrangements of hyperplanes
- A lower bound for randomized algebraic decision trees
- Improved algebraic degeneracy testing
- A new coding-based algorithm for finding closest pair of vectors
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- On 3SUM-hard problems in the decision tree model
- Robust region elimination for piecewise affine control laws
This page was built for publication: Point location in arrangements of hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690248)
