论文信息 - A note on point location in arrangements of hyperplanes

A note on point location in arrangements of hyperplanes

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+e) bound of Meiser's algorithm [Inform. and Control 106 (1993) 286] that has a similar running time.

Ding Liu

[1] Bernard Chazelle,et al. Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[2] Jirí Matousek. Cutting hyperplane arrangements , 1991, Discret. Comput. Geom..

[3] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[4] S. Meiser,et al. Point Location in Arrangements of Hyperplanes , 1993, Inf. Comput..

[5] Jirí Matousek,et al. Cutting hyperplane arrangements , 1990, SCG '90.

[6] Kenneth L. Clarkson,et al. A probabilistic algorithm for the post office problem , 1985, STOC '85.