Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions

DOI10.1016/j.comgeo.2012.11.003zbMath1269.65021OpenAlexW2150031840MaRDI QIDQ1947986

Evan VanderZee, Anil N. Hirani, Vadim Zharnitsky, Damrong Guoy, Edgar A. Ramos

Publication date: 29 April 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.11.003

zbMATH Keywords

finite element methodmesh generationacute triangulationsdiscrete exterior calculuscircumcentric dualwell-centered mesheswell-centered simpliceswell-centered triangulations

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (8)

Computing Geometric Feature Sizes for Algebraic Manifolds ⋮ Face-to-face partition of 3D space with identical well-centered tetrahedra. ⋮ Existence of well-centered simplicial face-to-face tiling of five-dimensional space ⋮ Upwind Schemes for Scalar Advection-Dominated Problems in the Discrete Exterior Calculus ⋮ Discrete advection-diffusion equations on graphs: maximum principle and finite volumes ⋮ Convergence of discrete exterior calculus approximations for Poisson problems ⋮ A Convergent Numerical Method for the Full Navier--Stokes--Fourier System in Smooth Physical Domains ⋮ Duality of isosceles tetrahedra

Uses Software

• PyDEC
• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acute triangulations of polyhedra and \(\mathbb R^N\)
• A stitching method for the generation of unstructured meshes for use with co-volume solution techniques
• There is no face-to-face partition of \(R^5\) into acute simplices
• Maximum principle and uniform convergence for the finite element method
• PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD
• Well-Centered Triangulation
• PyDEC
• On Nonobtuse Simplicial Partitions
• Computing geodesic paths on manifolds
• Direct Discretization of Planar Div-Curl Problems
• Algorithms in real algebraic geometry

This page was built for publication: Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions