Searching for "Point Location in Arrangements of Hyperplanes" – sorted by Relevance.
-
Lower Bounds Are not Easier over the Reals: Inside PH
- as outstanding open problems from discrete complexity theory. 2 Point location in an arrangement of hyperplanes
- Cited by 2 (0 self) – Add To MetaCart
-
Nearest Neighbor Search in Multidimensional Spaces
- diagram can also be viewed as a special case of point location in an arrangement of hyperplanes A
- Cited by 7 (0 self) – Add To MetaCart
-
Cuttings and Applications
- the same as the 'stan- dard method' for point location in arrangements of hyperplanes. We compute a Cutting
- Cited by 13 (0 self) – Add To MetaCart
-
Two Algorithms for Nearest-Neighbor Search in High Dimensions
- general problem of point location in an arrangement of hyperplanes); it obtains a query time of O(d 5
- Cited by 132 (0 self) – Add To MetaCart
-
The discrepancy method in computational geometry
- with respect to Pi. Point location: Preprocess an arrangement of n hyperplanes in R d so that, given a query
- Cited by 1 (0 self) – Add To MetaCart
-
Lower bounds for high dimensional nearest neighbor search and related problems
- of point location in arrangements of hyperplanes and obtains the storage bound O ` nd+δ´ where n
- Cited by 39 (2 self) – Add To MetaCart
-
Cell-Probe Lower Bounds for the Partial Match Problem
- lower bound of other geometric data structures problems is also improved. These include point location
- Cited by 6 (0 self) – Add To MetaCart
-
Counting complexity classes over the reals I: The additive case
- Heide’s (nonuniform) construction of small depth linear decision trees for point location
- Cited by 1 (1 self) – Add To MetaCart
-
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- search and the more general problem of point location in an arrangement of hyperplanes. We dare
- Cited by 143 (9 self) – Add To MetaCart
-
Dimensionality Reductions that Preserve Volumes and Distance to Affine Spaces, and their Algorithmic Applications
- in the literature. Combining Meiser's result for point location in arrangements of hyperplanes, with our result
- Cited by 15 (0 self) – Add To MetaCart

