POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 18:31, 7 February 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references