COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233)

From MaRDI portal
Revision as of 20:36, 30 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1526827
Language Label Description Also known as
English
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
scientific article; zbMATH DE number 1526827

    Statements

    COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (English)
    0 references
    7 November 2000
    0 references
    polygon
    0 references
    weak visibility
    0 references
    external visibility
    0 references
    shortest visible line segment
    0 references

    Identifiers