Finding Rectangle Intersections by Divide-and-Conquer (Q3323293): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ralf Hartmut Gueting / rank | |||
Property / author | |||
Property / author: Derick Wood / rank | |||
Property / author | |||
Property / author: Ralf Hartmut Gueting / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Derick Wood / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:44, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding Rectangle Intersections by Divide-and-Conquer |
scientific article |
Statements
Finding Rectangle Intersections by Divide-and-Conquer (English)
0 references
1984
0 references
computational geometry
0 references
divide-and-conquer algorithms
0 references
pairwise intersections
0 references
line segments
0 references
points
0 references
rectangles
0 references