A new approach to rectangle intersections part I (Q3659158): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168308803364 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068587771 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting and Reporting Intersections of d-Ranges / rank | |||
Normal rank | |||
Latest revision as of 08:20, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approach to rectangle intersections part I |
scientific article |
Statements
A new approach to rectangle intersections part I (English)
0 references
1983
0 references
computational geometry
0 references
rectilinearly-oriented rectangle
0 references
searching
0 references
data structure
0 references
concrete complexity
0 references
