Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 03:47, 12 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
