Two algorithms for constructing a Delaunay triangulation (Q3883495): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583229, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4092750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Subdivisions of Space into Crystals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation of planar regions with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Interpolation from Random Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous planar Poisson point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of congruent spheres in a strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: A triangulation algorithm for arbitrary planar domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise Quadratic Approximations on Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Polygons into Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Patterns from Sample Data / rank
 
Normal rank

Revision as of 04:50, 13 June 2024

scientific article
Language Label Description Also known as
English
Two algorithms for constructing a Delaunay triangulation
scientific article

    Statements

    Two algorithms for constructing a Delaunay triangulation (English)
    0 references
    1980
    0 references
    Delaunay triangulation
    0 references
    divide-and-conquer
    0 references
    Voronoi tessellation
    0 references
    computational geometry
    0 references
    analysis of algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references