Efficient algorithms for computing the maximum distance between two finite planar sets (Q4747526)

From MaRDI portal
Revision as of 18:50, 9 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3804871
Language Label Description Also known as
English
Efficient algorithms for computing the maximum distance between two finite planar sets
scientific article; zbMATH DE number 3804871

    Statements

    Efficient algorithms for computing the maximum distance between two finite planar sets (English)
    0 references
    1983
    0 references
    maximum euclidean distance
    0 references
    finite planar sets
    0 references

    Identifiers