Finding Rectangle Intersections by Divide-and-Conquer (Q3323293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding Rectangle Intersections by Divide-and-Conquer |
scientific article; zbMATH DE number 3854445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Rectangle Intersections by Divide-and-Conquer |
scientific article; zbMATH DE number 3854445 |
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
0.8779010772705078
0 references
0.8223200440406799
0 references
0.8052474856376648
0 references
0.7985905408859253
0 references
