PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (Q4017520)

From MaRDI portal
scientific article
Language Label Description Also known as
English
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
scientific article

    Statements

    PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    visibility
    0 references
    CREW PRAM
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references