Dynamic point location in arrangements of hyperplanes
Ketan Mulmuley, Sandeep Sen · 1991
We present algorithms for maintaining data structures supporting fast point location queries in arrangements of hyperplanes with dimension less than or equal to four.This data structure allows for ity which is likely to have further applications to other dynamic algorithms.