On the detection of a common intersection of k convex subjects in the plane (Q1111021)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the detection of a common intersection of k convex subjects in the plane |
scientific article; zbMATH DE number 4074478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the detection of a common intersection of k convex subjects in the plane |
scientific article; zbMATH DE number 4074478 |
Statements
On the detection of a common intersection of k convex subjects in the plane (English)
0 references
1988
0 references
An O(k) algorithm is given to decide whether k disks have a point in common. To detect a common intersection of k convex n-gons we present an O(k \(log^ 2 n)\) algorithm which can be modified to evaluate an extremal point of the common intersection with the same complexity.
0 references
computational geometry
0 references
convex polygon
0 references
disks
0 references
common intersection
0 references
complexity
0 references
0 references
