A simple linear algorithm for intersecting convex polygons (Q1822240)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4001478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear algorithm for intersecting convex polygons |
scientific article; zbMATH DE number 4001478 |
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
0.9518207907676696
0 references
0.8816955089569092
0 references
0.850233793258667
0 references
