Efficiently approximating polygonal paths in three and higher dimensions (Q1601006)

From MaRDI portal
Revision as of 23:32, 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
Efficiently approximating polygonal paths in three and higher dimensions
scientific article

    Statements

    title
    Efficiently approximating polygonal paths in three and higher dimensions (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    17 June 2002
    0 references
    zbMATH Keywords
    min-\# problem
    0 references
    author
    Gill Barequet
    0 references
    Danny Z. Chen
    0 references
    Ovidiu Daescu
    0 references
    Michael T. Goodrich
    0 references
    Jack Scott Snoeyink
    0 references

    Identifiers

    zbMATH DE Number
    1756779
    0 references
    OpenAlex ID
    W1981507524
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1601006&oldid=32404961"
    Powered by MediaWiki