arXiv subjects

Lorenzo Diazzi

Publications and source records attributed to Lorenzo Diazzi.

3 recordsLinked to original sources

arXiv2026

Continuous 3D Finite Element Subgrid Basis Functions for Discontinuous Galerkin Methods on Polyhedral Meshes

We present a novel high-order accurate nodal discontinuous Galerkin (DG) method for solving nonlinear hyperbolic systems of partial differential equations (PDEs) on fully unstructured three-dimensional polyhedral meshes. A mesh generator is firstly discussed in detail, which ensures the generation of admissible control volumes. For the first time, we then extend the concept of agglomerated finite element (AFE) basis functions to polyhedral grids. In this context, the discrete solution is represented within each polyhedral element using piecewise continuous polynomials of degree N, defined on an internal tetrahedral subgrid. The AFE basis functions are therefore constructed by agglomerating standard finite element basis functions on each sub-tetrahedron of the computational cell. This allows for the precomputation of universal local matrices (mass and stiffness) on the reference element given by the unit tetrahedron, enabling a quadrature-free implementation that remains efficient even on highly irregular polyhedral meshes. High-order of accuracy in time is achieved using a local spacetime Galerkin predictor as part of the ADER approach, applied independently within each polyhedral element. To ensure robustness in the presence of discontinuities such as shocks, an artificial viscosity limiter is embedded into the numerical scheme, allowing for controlled dissipation and stabilization without compromising the overall accuracy in smooth regions. To demonstrate the robustness and accuracy of the method, we validate it through different three-dimensional benchmark problems for the compressible Euler and Navier-Stokes equations.

math.NA↗

arXiv2023

Constrained Delaunay Tetrahedrization: A Robust and Practical Approach

We present a numerically robust algorithm for computing the constrained Delaunay tetrahedrization (CDT) of a piecewise-linear complex, which has a 100% success rate on the 4408 valid models in the Thingi10k dataset. We build on the underlying theory of the well-known TetGen software, but use a floating-point implementation based on indirect geometric predicates to implicitly represent Steiner points: this new approach dramatically simplifies the implementation, removing the need for ad-hoc tolerances in geometric operations. Our approach leads to a robust and parameter-free implementation, with an empirically manageable number of added Steiner points. Furthermore, our algorithm addresses a major gap in TetGen's theory which may lead to algorithmic failure on valid models, even when assuming perfect precision in the calculations. Our output tetrahedrization conforms with the input geometry without approximations. We can further round our output to floating-point coordinates for downstream applications, which almost always results in valid floating-point meshes unless the input triangulation is very close to being degenerate.

cs.CG↗

arXiv2021

Convex polyhedral meshing for robust solid modeling

We introduce a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface. Our approach is particularly tolerant to defects in the input, which is allowed to self-intersect, to be non-manifold, disconnected, and to contain surface holes and gaps. We guarantee that the input surface is exactly represented as the union of polygonal facets of the output volume mesh. Thanks to our algorithm, traditionally difficult solid modeling operations such as mesh booleans and Minkowski sums become surprisingly robust and easy to implement, even if the input has defects. Our technique leverages on the recent concept of indirect geometric predicate to provide an unprecedented combination of guaranteed robustness and speed, thus enabling the practical implementation of robust though flexible solid modeling systems. We have extensively tested our method on all the 10000 models of the Thingi10k dataset, and concluded that no existing method provides comparable robustness, precision and performances.

cs.GR↗