Steiner-point free edge cutting of tetrahedral meshes with applications in fracture
| dc.contributor.author | Areias, P | |
| dc.date.accessioned | 2018-03-01T16:27:52Z | |
| dc.date.available | 2018-03-01T16:27:52Z | |
| dc.date.embargo | 2017 | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Realistic 3D finite strain analysis and crack propagation with tetrahedral meshes require mesh refinement/division. In this work, we use edges to drive the division process. Mesh refinement and mesh cutting are edge-based. This approach circumvents the variable mapping procedure adopted with classical mesh adaptation algorithms. The present algorithm makes use of specific problem data (either level sets, damage variables or edge deformation) to perform the division. It is shown that global node numbers can be used to avoid the Schönhardt prisms. We therefore introduce a nodal numbering that maximizes the trapezoid quality created by each mid-edge node. As a by-product, the requirement of determination of the crack path using a crack path criterion is not required. To assess the robustness and accuracy of this algorithm, we propose 4 benchmarks. In the knee-lever example, crack slanting occurs as part of the solution. The corresponding Fortran 2003 source code is provided. | por |
| dc.identifier.authoremail | pmaa@uevora.pt | |
| dc.identifier.doi | https://doi.org/10.1016/j.finel.2017.05.001 | por |
| dc.identifier.scientificarea | 287 | por |
| dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0168874X16306333 | |
| dc.identifier.uri | http://hdl.handle.net/10174/22699 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.rights | restrictedAccess | por |
| dc.title | Steiner-point free edge cutting of tetrahedral meshes with applications in fracture | por |
| dc.type | article | por |
| rcaap.description.embargofct | Realistic 3D finite strain analysis and crack propagation with tetrahedral meshes require mesh refinement/division. In this work, we use edges to drive the division process. Mesh refinement and mesh cutting are edge-based. This approach circumvents the variable mapping procedure adopted with classical mesh adaptation algorithms. The present algorithm makes use of specific problem data (either level sets, damage variables or edge deformation) to perform the division. It is shown that global node numbers can be used to avoid the Schönhardt prisms. We therefore introduce a nodal numbering that maximizes the trapezoid quality created by each mid-edge node. As a by-product, the requirement of determination of the crack path using a crack path criterion is not required. To assess the robustness and accuracy of this algorithm, we propose 4 benchmarks. In the knee-lever example, crack slanting occurs as part of the solution. The corresponding Fortran 2003 source code is provided. | por |