A fast algorithm for well-spaced points and approximate delaunay graphs (Q5174489)

From MaRDI portal
Revision as of 14:39, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6405138
Language Label Description Also known as
English
A fast algorithm for well-spaced points and approximate delaunay graphs
scientific article; zbMATH DE number 6405138

    Statements

    A fast algorithm for well-spaced points and approximate delaunay graphs (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2015
    0 references
    Delaunay refinement
    0 references
    mesh generation
    0 references
    output sensitive algorithms
    0 references
    Voronoi diagrams
    0 references
    Voronoi refinement
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references