A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622)

From MaRDI portal
Revision as of 19:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
scientific article

    Statements

    A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (English)
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    computer graphics
    0 references
    computational geometry
    0 references
    linear-time algorithm
    0 references
    strong hidden-line problem
    0 references
    weakly visible
    0 references
    shortest paths
    0 references
    triangulation
    0 references
    0 references