A simple unstructured tetrahedral mesh generation algorithm for complex geometries (Q1362260): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Interpolation from Random Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive grid-design methods for finite element analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems / 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: Automatic triangulation of arbitrary planar domains for the finite element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new mesh generation scheme for arbitrary planar domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface grid generation with a linkage to geometric generation / 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: An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ co‐ordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing Delaunay triangulations in the plane / 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: Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for generating irregular computational grids in multiply connected planar domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressible flowfield solutions with unstructured grids generated by Delaunay triangulation / 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 using the Delaunay-Voronoï principle / 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: Selective refinement: A new strategy for automatic node placement in graded triangular meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structured tri-tree search method for generation of optimal unstructured finite element grids in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust boundary triangulation and delaunay triangulation of arbitrary planar domains / 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

Latest revision as of 17:54, 27 May 2024

scientific article
Language Label Description Also known as
English
A simple unstructured tetrahedral mesh generation algorithm for complex geometries
scientific article

    Statements

    A simple unstructured tetrahedral mesh generation algorithm for complex geometries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 1998
    0 references
    0 references
    geometric searching strategies
    0 references
    0 references
    0 references