Why is the 3D Delaunay triangulation difficult to construct? (Q673008): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acyclicity theorem for cell complexes in d dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for constructing a Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable implementations of geometric algorithms using finite precision arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS / rank
 
Normal rank

Revision as of 10:22, 27 May 2024

scientific article
Language Label Description Also known as
English
Why is the 3D Delaunay triangulation difficult to construct?
scientific article

    Statements

    Why is the 3D Delaunay triangulation difficult to construct? (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    Delaunay triangulation
    0 references
    degeneracy
    0 references
    numerical robustness
    0 references
    topological consistency
    0 references

    Identifiers