Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational aspects of the Hausdorff distance in unbounded dimension
scientific article

    Statements

    0 references
    9 March 2017
    0 references
    computational complexity
    0 references
    Hausdorff distance
    0 references
    Helly-type theorem
    0 references
    polynomial time algorithms
    0 references
    Computational aspects of the Hausdorff distance in unbounded dimension (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references