Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592)
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: Efficient algorithms for counting and reporting pairwise intersections between convex polygons |
scientific article; zbMATH DE number 6594009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for counting and reporting pairwise intersections between convex polygons |
scientific article; zbMATH DE number 6594009 |
Statements
Efficient algorithms for counting and reporting pairwise intersections between convex polygons (English)
0 references
16 June 2016
0 references
computational geometry
0 references
data structures
0 references
0 references
0.8718392252922058
0 references
0.8282566666603088
0 references
0.8036659359931946
0 references
0.7830245494842529
0 references
