Finding an approximate minimum-link visibility path inside a simple polygon (Q672401)

From MaRDI portal
Revision as of 00:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding an approximate minimum-link visibility path inside a simple polygon
scientific article

    Statements

    Finding an approximate minimum-link visibility path inside a simple polygon (English)
    0 references
    0 references
    28 February 1997
    0 references
    computational geometry
    0 references
    approximation algorithms
    0 references
    simple polygon
    0 references
    visibility path
    0 references
    minimum link path
    0 references

    Identifiers