Conforming Delaunay triangulations in 3D (Q598238): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4217293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for conforming Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation / rank
 
Normal rank

Latest revision as of 19:12, 6 June 2024

scientific article
Language Label Description Also known as
English
Conforming Delaunay triangulations in 3D
scientific article

    Statements

    Conforming Delaunay triangulations in 3D (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    The authors present an algorithm to construct a Delaunay triangulation for a generated piecewise linear complex in three-dimensional space. The implementation shows that a relatively small number of Steine points are generated by the algorithm.
    0 references
    0 references
    0 references
    conforming Delaunay triangulation
    0 references
    piecewise linear complex
    0 references
    algorithms
    0 references
    Steine points
    0 references
    0 references