A note on point location in arrangements of hyperplanes

Authors:
Ding Liu
Affiliations:
Department of Computer Science, Princeton University, Princeton, NJ
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 1

A probabilistic algorithm for the post office problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Cutting hyperplane arrangements

Discrete & Computational Geometry
Cutting hyperplanes for divide-and-conquer

Discrete & Computational Geometry
Point location in arrangements of hyperplanes

Information and Computation

Efficient evaluation of specific queries in constraint databases

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give an algorithm for point location in an arrangement of n hyperplanes in Ed with running time poly(d, log n) and space O(nd). The space improves on the O(nd+ε) bound of Meiser's algorithm [Inform. and Control 106 (1993) 286] that has a similar running time.