POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166): Difference between revisions
From MaRDI portal
Changed an 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: Applications of Parametric Searching in Geometric Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a class of \(O(n^ 2)\) problems in computational geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The upper envelope of Voronoi surfaces and its applications / rank | |||
Normal rank | |||
Latest revision as of 11:17, 10 June 2024
scientific article; zbMATH DE number 2174817
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD |
scientific article; zbMATH DE number 2174817 |
Statements
POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (English)
0 references
10 June 2005
0 references
Computational complexity
0 references
3SUM-hardness
0 references
polygon containment
0 references
Hausdorff distance
0 references
segment sets
0 references
