The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263)

From MaRDI portal
Revision as of 20:55, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128028533, #quickstatements; #temporary_batch_1723663638014)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
scientific article

    Statements

    The implementation of an algorithm to find the convex hull of a set of three-dimensional points (English)
    0 references
    0 references
    1990
    0 references
    object modelling
    0 references
    divide and conquer
    0 references
    edge structure
    0 references
    tetrahedron
    0 references
    triangulation
    0 references
    implementation in Pascal
    0 references
    three-dimensional convex hull algorithm
    0 references

    Identifiers