Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Michiel H. M. Smid / rank | |||
| 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 | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3997899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4225298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3772828 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for counting and reporting pairwise intersections between convex polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient partition trees / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066537884 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
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
