Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Michiel H. M. Smid / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68U05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52B55 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6594009 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational geometry | |||
| Property / zbMATH Keywords: computational geometry / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
data structures | |||
| Property / zbMATH Keywords: data structures / rank | |||
Normal rank | |||
Revision as of 21:33, 27 June 2023
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
