A simple linear algorithm for intersecting convex polygons (Q1822240): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:48, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple linear algorithm for intersecting convex polygons |
scientific article |
Statements
A simple linear algorithm for intersecting convex polygons (English)
0 references
1985
0 references
Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple \(O(m+n)\) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.
0 references
computational geometry
0 references
geometric algorithms
0 references
convex polygons
0 references
intersection
0 references
convex hulls
0 references
triangulations of polygons
0 references
