How good are convex hull algorithms? (Q1356937)

From MaRDI portal
Revision as of 04:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
How good are convex hull algorithms?
scientific article

    Statements

    title
    How good are convex hull algorithms? (English)
    0 references
    author
    David Avis
    0 references
    David Bremner
    0 references
    Raimund Seidel
    0 references
    publication date
    8 December 1997
    0 references
    Mathematics Subject Classification ID
    68U05
    0 references
    52B55
    0 references
    65D18
    0 references
    zbMATH DE Number
    1022174
    0 references
    zbMATH Keywords
    convex polytope
    0 references
    convex hull
    0 references
    vertex enumeration problem
    0 references
    facet enumeration problem
    0 references
    Wikidata QID
    Q29542125
    0 references
    describes a project that uses
    Qhull
    0 references
    cdd
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1356937&oldid=26170012"
    Powered by MediaWiki