Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-optimal upper bounds for simplex range searching and new zone theorems |
scientific article |
Statements
Quasi-optimal upper bounds for simplex range searching and new zone theorems (English)
0 references
17 January 1993
0 references
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.
0 references
computational geometry
0 references
range searching
0 references
complexity
0 references
