A simple linear algorithm for intersecting convex polygons (Q1822240): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polygons Have Ears / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new linear algorithm for intersecting convex polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons / rank | |||
Normal rank | |||
Latest revision as of 19:41, 17 June 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
