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

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

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

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 method; mesh generation; acute triangulations; discrete exterior calculus; circumcentric dual; well-centered meshes; well-centered simplices; well-centered triangulations

Mathematics Subject Classification ID

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

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