An algorithm for triangulating smooth three-dimensional domains immersed in universal meshes
From MaRDI portal
Recommendations
- Some Convergence Results for Howard's Algorithm
- Universal meshes: a method for triangulating planar curved domains immersed in nonconforming meshes
- Universal meshes for smooth surfaces with no boundary in three dimensions
- Three-dimensional adaptive domain remeshing, implicit domain meshing, and applications to free and moving boundary problems
- A Triangulation Algorithm for Fast Elliptic Solvers Based on Domain Imbedding
Cites work
- A dihedral acute triangulation of the cube
- A discontinuous-Galerkin-based immersed boundary method
- A novel mesh regeneration algorithm for 2D FEM simulations of flows with moving boundary
- A phase-field description of dynamic brittle fracture
- A Triangulation Algorithm for Fast Elliptic Solvers Based on Domain Imbedding
- Adaptivity with moving grids
- Analysis of a method to parameterize planar curves immersed in triangulations
- Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes
- Anisotropic mesh adaptation for CFD computations
- Automatic three-dimensional mesh generation by the modified-octree technique
- Automatic three‐dimensional mesh generation by the finite octree technique
- Ball-map: homeomorphism between compatible surfaces
- Considerations on the spring analogy
- Domain Deformation Mapping: Application to Variational Mesh Generation
- Fictitious domain finite element methods using cut elements. I: A stabilized Lagrange multiplier method
- Finite Element Methods with B-Splines
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- scientific article; zbMATH DE number 3880275 (Why is no real title available?)
- scientific article; zbMATH DE number 1322812 (Why is no real title available?)
- scientific article; zbMATH DE number 1501432 (Why is no real title available?)
- scientific article; zbMATH DE number 2174316 (Why is no real title available?)
- scientific article; zbMATH DE number 5239226 (Why is no real title available?)
- scientific article; zbMATH DE number 2221424 (Why is no real title available?)
- Interpolation to boundary data in tetrahedra with applications to compatible finite elements
- Local optimization-based simplicial mesh untangling and improvement
- Localmaximum-entropy approximation schemes: a seamless bridge between finite elements and meshfree methods
- Meshless methods: An overview and recent developments
- NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
- On the resolution of certain discrete univariate max-min problems
- On the Shape of Tetrahedra from Bisection
- Optimal Isoparametric Finite Elements and Error Estimates for Domains Involving Curved Boundaries
- Provably robust directional vertex relaxation for geometric mesh optimization
- Quality Mesh Generation in Higher Dimensions
- Shape optimization with a level set based mesh evolution method
- Smooth interpolation in triangles
- Stabilized mixed methods for the Stokes problem
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations
- The fixed-mesh ALE approach for the numerical approximation of flows in moving domains
- The immersed boundary method
- Tiling space and slabs with acute tetrahedra.
- Torsional springs for two-dimensional dynamic unstructured fluid meshes
- Transfinite element methods: Blending-function interpolation over arbitrary curved element domains
- Universal meshes for smooth surfaces with no boundary in three dimensions
- Universal meshes: a method for triangulating planar curved domains immersed in nonconforming meshes
Cited in
(2)
This page was built for publication: An algorithm for triangulating smooth three-dimensional domains immersed in universal meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6555263)
