Point location in arrangements of hyperplanes
From MaRDI portal
Publication:690248
DOI10.1006/inco.1993.1057zbMath0781.68121OpenAlexW1997744504WikidataQ56442932 ScholiaQ56442932MaRDI QIDQ690248
Publication date: 20 December 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1057
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (30)
Nearly sharp complexity bounds for multiprocessor algebraic computations ⋮ A note on point location in arrangements of hyperplanes ⋮ Data-driven stabilization of unknown nonlinear dynamical systems using a cognition-based framework ⋮ A lower bound for randomized algebraic decision trees ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ Quadratic stabilization of a nonlinear aeroelastic system using a novel neural-network-based controller ⋮ Unnamed Item ⋮ Range minima queries with respect to a random permutation, and approximate range counting ⋮ Efficient evaluation of specific queries in constraint databases ⋮ An affine invariant \(k\)-nearest neighbor regression estimate ⋮ Robust region elimination for piecewise affine control laws ⋮ Topological complexity of the range searching ⋮ Enumerating Projections of Integer Points in Unbounded Polyhedra ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Finding a vector orthogonal to roughly half a collection of vectors ⋮ Evaluating geometric queries using few arithmetic operations ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Approximating nearest neighbor among triangles in convex position ⋮ POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ Cell-probe lower bounds for the partial match problem ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model ⋮ On approximate nearest neighbors under \(l_\infty\) norm ⋮ On 3SUM-hard problems in the decision tree model
This page was built for publication: Point location in arrangements of hyperplanes
