An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours.
From MaRDI portal
Publication:1418245
DOI10.1016/S0045-7825(03)00240-8zbMath1119.74605OpenAlexW1977235008MaRDI QIDQ1418245
Publication date: 19 January 2004
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0045-7825(03)00240-8
Finite element methods applied to problems in solid mechanics (74S05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items
Automatic merging of tetrahedral meshes ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain
Cites Work
- Unnamed Item
- A marching method for the triangulation of surfaces
- Analysis and verification of the boundary surfaces of solid objects
- Automatic 3D surface meshing to address today's industrial needs
- Regridding surface triangulations
- GENERALIZED 3-D PAVING: AN AUTOMATED QUADRILATERAL SURFACE MESH GENERATION ALGORITHM
- Finite element mesh generation over curved surfaces
- Automatic three‐dimensional mesh generation by the finite octree technique
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Finite element mesh generation over analytical curved surfaces
- Automatic Adaptive Finite Element Mesh Generation Over Rational B-spline Surfaces
- Surface triangulation over intersecting geometries
- Parametric surface meshing using a combined advancing-front generalized Delaunay approach
- Automatic adaptive mesh generation using metric advancing front approach
- Automatic mesh generation over intersecting surfaces
- Intersecting and trimming parametric meshes on finite element shells
- Triangulating the surface of a molecule
