Triangulation automatique d’un polyèdre en dimension $N$

DOI10.1051/m2an/1982160302111zbMath0567.65083OpenAlexW2282797220MaRDI QIDQ3683492

François Hermeline

Publication date: 1982

Published in: RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193398

zbMATH Keywords

finite element methodpolyhedraconvex hullVoronoi diagramDelaunay triangulationvolume computationFORTRAN programsimplicial partitionautomatic triangulation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) 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) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (3) dimensions (including convex surfaces) (52A15) Computer aspects of numerical algorithms (65Yxx) Polytopes and polyhedra (52Bxx)

Related Items

Feature-based and goal-oriented anisotropic mesh adaptation for RANS applications in aeronautics and aerospace, A finite volume method for approximating 3D diffusion operators on general meshes, An attraction-repulsion mesh adaption model for flow solution on unstructured grids, Computational methods for tension-loaded structures, Representing stereo data with the Delaunay triangulation, Discrete Duality Finite Volume Discretization of the Thermal-$P_N$ Radiative Transfer Equations on General Meshes, Shear stresses in orthotropic composite beams, Diagonal swap procedures and characterizations of 2D-Delaunay triangulations, Lagrangian Voronoï meshes and particle dynamics with shocks, Variational Delaunay approach to the generation of tetrahedral finite element meshes, Automatic mesh generator with specified boundary, A finite volume method for the approximation of Maxwell's equations in two space dimensions on arbitrary meshes, Approximating constrained tetrahedrizations, Recent progress in robust and quality Delaunay mesh generation, An automatic adaptive meshing technique for Delaunay triangulations, 3D Delaunay mesh generation coupled with an advancing-front approach, Approximation of 2D and 3D diffusion operators with variable full tensor coefficients on arbitrary meshes, Fast segment insertion and incremental construction of constrained Delaunay triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of Voronoi polyhedra
• Covering space with equal spheres
• A brief review of techniques for generating irregular computational grids
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• On the Angle Condition in the Finite Element Method
• Convex hulls of finite sets of points in two and three dimensions
• A New Convex Hull Algorithm for Planar Sets
• Computing Dirichlet Tessellations in the Plane
• Automatic triangulation of arbitrary planar domains for the finite element method
• Computer cartography point-in-polygon programs