On the Shape of Tetrahedra from Bisection
From MaRDI portal
Publication:4305978
DOI10.2307/2153566zbMath0815.51016OpenAlexW2092410065MaRDI QIDQ4305978
Publication date: 28 June 1995
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.3842
Three-dimensional polytopes (52B10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Nonlinear algebraic or transcendental equations (65H99)
Related Items
On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\), Relationship between tetrahedron shape measures, Tetrahedral mesh generation using Delaunay refinement with non-standard quality measures, Space-filling curves for 2-simplicial meshes created with bisections and reflections., On the resolution of certain discrete univariate max-min problems, Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes, Provably Robust Directional Vertex Relaxation for Geometric Mesh Optimization, Local element operations for curved simplex meshes, No acute tetrahedron is an 8-reptile, On global and local mesh refinements by a generalized conforming bisection algorithm, Guaranteed quality tetrahedral Delaunay meshing for medical images, Stability of the 8-tetrahedra shortest-interior-edge partitioning method, Computer geometry: rep-tiles with a hole, A mesh adaptation framework for dealing with large deforming meshes, Variational method for untangling and optimization of spatial meshes, Adaptive unstructured volume remeshing. I: The method, An analysis of simplex shape measures for anisotropic meshes, 3D anisotropic mesh adaptation by mesh modification, Metric tensors for anisotropic mesh generation, Analysis of triangle quality measures, \texttt{ColDICE}: A parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation, Longest-edge \(n\)-section algorithms: properties and open problems, A comparative study between some bisection based partitions in 3D, Non-degeneracy study of the 8-tetrahedra longest-edge partition, On generalized bisection of 𝑛-simplices, On the adjacencies of triangular meshes based on skeleton-regular partitions
Cites Work
- Unnamed Item
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- On the Bisection Method for Triangles
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- A grid generator based on 4-triangles conforming mesh-refinement algorithms
- On Faster Convergence of the Bisection Method for all Triangles
- Which Tetrahedra Fill Space?
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
