Fast Delaunay triangulation in three dimensions (Q2564605): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vertex based data dependent triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An apporach to automatic three-dimensional finite element mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully automatic mesh generator for 3D domains of any shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of three‐dimensional constrained Delaunay meshing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulation of non-convex planar domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay's mesh of a convex polyhedron in dimension <i>d.</i> application to arbitrary polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic mesh generator with specified boundary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulation and the convex hull of n points in expected linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of three-dimensional Delaunay triangulations using local transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tetrahedrizing point sets in three dimensions / rank
 
Normal rank

Revision as of 09:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Fast Delaunay triangulation in three dimensions
scientific article

    Statements

    Fast Delaunay triangulation in three dimensions (English)
    0 references
    0 references
    7 April 1997
    0 references
    algorithm
    0 references
    Delaunay triangulation
    0 references
    point insertion technique
    0 references
    acceleration procedures
    0 references
    random walk
    0 references
    triangulation algorithms
    0 references
    tetrahedra generation
    0 references
    randomly generated points
    0 references

    Identifiers