Boundary recovery for three dimensional conforming Delaunay triangulation (Q704459): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cma.2003.12.058 / rank
Normal rank
 
Property / cites work
 
Property / cites work: ASPECTS OF 2-D DELAUNAY MESH GENERATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integrity of geometrical boundaries in the two-dimensional delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic mesh generation over intersecting surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric surface meshing using a combined advancing-front generalized Delaunay approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL DELAUNAY POINT INSERTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Delaunay triangulation in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic three‐dimensional mesh generation by the finite octree technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of three‐dimensional unstructured grids by the advancing‐front method / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3D Delaunay mesh generation coupled with an advancing-front approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic mesh generator with specified boundary / 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 refinement algorithms for triangular mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation of arbitrary polyhedra to support automatic mesh generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of three‐dimensional constrained Delaunay meshing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CMA.2003.12.058 / rank
 
Normal rank

Latest revision as of 01:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Boundary recovery for three dimensional conforming Delaunay triangulation
scientific article

    Statements

    Boundary recovery for three dimensional conforming Delaunay triangulation (English)
    0 references
    0 references
    0 references
    13 January 2005
    0 references
    The authors present an algorithm which combines local transformations with a modified Delaunay refinement to recover the boundary constraints in a conforming manner. A theoretical proof for the convergence of the method is given. Several preliminary meshing examples are also given to demonstrate the effectiveness and robustness of the presented boundary recovery algorithm [cf. \textit{P. L. George, F. Hecht}, and \textit{E. Saltel}, Comput. Methods. Appl.. Mech.. Eng. 92, No. 3, 269--288 (1991; Zbl 0756.65133)].
    0 references
    0 references
    Delaunay triangulation
    0 references
    boundary recovery
    0 references
    mesh generation
    0 references
    numerical examples
    0 references
    convergence
    0 references
    algorithm
    0 references

    Identifiers