On the detection of a common intersection of k convex subjects in the plane (Q1111021): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast detection of polyhedral intersection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Weighted Euclidean 1-Center Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank | |||
Normal rank | |||
Latest revision as of 09:46, 19 June 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
0 references
