A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788)

From MaRDI portal
Revision as of 21:41, 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
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
scientific article

    Statements

    A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (English)
    0 references
    0 references
    0 references
    16 December 2004
    0 references
    Voronoi diagrams
    0 references

    Identifiers