Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746): Difference between revisions

This is a fundamental study of range searching in fixed dimensional Euclidean space. The basic problem is to count or report points lying inside a given query simplex (preprocessing is allowed and required). Algorithms with almost tight complexity bounds are developed in fixed \(d\) dimensions, and fine-tuned in 2- and 3-space. As a consequence new improved zone theorems on hyperplane arrangements are obtained in two and three dimensions.