Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066537884 / rank | |||
Normal rank |
Latest revision as of 09:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for counting and reporting pairwise intersections between convex polygons |
scientific article |
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