Point location in arrangements of hyperplanes

DOI10.1006/INCO.1993.1057zbMATH Open0781.68121OpenAlexW1997744504WikidataQ56442932 ScholiaQ56442932MaRDI QIDQ690248FDOQ690248

Authors: M. C. Fu 

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

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

zbMATH Keywords

point location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (41)

• 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
• Approximating nearest neighbor among triangles in convex position
• Point location among hyperplanes and unidirectional ray-shooting
• The point-location problem for three-dimensional space
• Title not available (Why is that?)
• On the multisource hyperplanes location problem to fitting set of points
• Proximate planar point location
• Title not available (Why is that?)
• Efficient evaluation of specific queries in constraint databases
• Topological complexity of the range searching
• 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
• A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
• Conic nearest neighbor queries and approximate Voronoi diagrams
• Index structures for fast similarity search for real-valued vectors. I
• Finding a vector orthogonal to roughly half a collection of vectors
• Locating lines and hyperplanes. Theory and algorithms
• IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING
• Anchored hyperplane location problems
• Range minima queries with respect to a random permutation, and approximate range counting
• Approximating Minimization Diagrams and Generalized Proximity Search
• Data-driven stabilization of unknown nonlinear dynamical systems using a cognition-based framework
• Title not available (Why is that?)
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Nearly sharp complexity bounds for multiprocessor algebraic computations
• A note on point location in arrangements of hyperplanes
• A lower bound for randomized algebraic decision trees
• Enumerating Projections of Integer Points in Unbounded Polyhedra
• 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
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location

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)