The eight-tetrahedra longest-edge partition and Kuhn triangulations

DOI10.1016/j.camwa.2007.01.023zbMath1138.65022OpenAlexW2037436576MaRDI QIDQ2460599

Ángel Plaza

Publication date: 12 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.023

zbMATH Keywords

subdivisiontetrahedronbisectionright-type tetrahedroneight-tetrahedra longest-edge partitionKuhn triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Hamiltonian triangular refinements and space-filling curves ⋮ Simulation of processes and structures in the synapse in the context of tetrahedral mesh quality ⋮ Stability of the 8-tetrahedra shortest-interior-edge partitioning method ⋮ The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube ⋮ Optimization methods for Dirichlet control problems ⋮ The 8T-LE partition applied to the obtuse triangulations of the 3D-cube ⋮ Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra

Cites Work

• Tetrahedral grid refinement
• Local refinement of simplicial grids based on the skeleton
• A comparative study between some bisection based partitions in 3D
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Design and data structure of fully adaptive, multigrid, finite-element software
• Some Combinatorial Lemmas in Topology
• Optimal Multilevel Iterative Methods for Adaptive Grids
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Unnamed Item

This page was built for publication: The eight-tetrahedra longest-edge partition and Kuhn triangulations