On the detection of a common intersection of k convex subjects in the plane (Q1111021): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90127-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067487612 / rank | |||
Normal rank | |||
Revision as of 20:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the detection of a common intersection of k convex subjects in the plane |
scientific article |
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
