A faster circle-sweep Delaunay triangulation algorithm (Q427141)

From MaRDI portal
Revision as of 17:12, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster circle-sweep Delaunay triangulation algorithm
scientific article

    Statements

    title
    A faster circle-sweep Delaunay triangulation algorithm (English)
    0 references
    publication date
    13 June 2012
    0 references
    zbMATH Keywords
    computational geometry
    0 references
    Delaunay triangulation
    0 references
    in-circle test
    0 references
    recursive edge-flipping
    0 references
    sweep-line
    0 references
    sweep-circle
    0 references
    describes a project that uses
    Voronoi
    0 references
    Triangle
    0 references

    Identifiers

    zbMATH DE Number
    6045927
    0 references
    OpenAlex ID
    W2081458114
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q427141&oldid=38344094"
    Powered by MediaWiki