Fast algorithms for intersection of non-matching grids using Plücker coordinates
DOI10.1016/j.camwa.2017.01.028zbMath1375.65165OpenAlexW2592735265MaRDI QIDQ2406759
Publication date: 6 October 2017
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2017.01.028
algorithmfinite element methodnon-conforming meshPlücker coordinatesadvancing front methodnon-matching gridmesh intersectionmixed-dimensional mesh
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (6)
Uses Software
Cites Work
- Polyhedral and algebraic methods in computational geometry
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- The mortar finite element method with Lagrange multipliers
- Analysis of a Chimera method
- Analysis of Model Error for a Continuum-Fracture Model of Porous Media Flow
- The extended/generalized finite element method: An overview of the method and its applications
- Algorithm 932
- Numerical modelling of multiphase subsurface flow in the presence of fractures
- Towards a Unified Framework for Scientific Computing
- Efficient Implementation of Finite Element Methods on Nonmatching and Overlapping Meshes in Three Dimensions
- Modeling Fractures and Barriers as Interfaces for Flow in Porous Media
This page was built for publication: Fast algorithms for intersection of non-matching grids using Plücker coordinates