The 4-triangles longest-side partition of triangles and linear refinement algorithms
Geometric constructions in real or complex geometry (51M15) Geometry of classical groups (51N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
- Local refinement based on the 7-triangle longest-edge partition
- Some aspects of adaptive grid technology related to boundary and interior layers.
- On the adjacencies of triangular meshes based on skeleton-regular partitions
- Average adjacencies for tetrahedral skeleton-regular partitions
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Hexahedral constraint-free finite element method on meshes with hanging nodes
- There are simple and robust refinements (almost) as good as Delaunay
- A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Refinement based on longest-edge and self-similar four-triangle partitions
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Four-triangles adaptive algorithms for RTIN terrain meshes
- On the Fibonacci \(k\)-numbers
- Residual-based a posteriori error estimates of nonconforming finite element method for elliptic problems with Dirac delta source terms
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
- Golden triangulations
- Parallel triangular mesh refinement by longest edge bisection
- Propagation of longest-edge mesh patterns in local adaptive refinement
- The propagation problem in the four-triangle longest-edge refinement
- Local refinement based on the 7-triangle longest-edge partition
- Natural hierarchical refinement for finite element methods
- A weak compatibility condition for newest vertex bisection in any dimension
- Red-green refinement of simplicial meshes in \(d\) dimensions
- Constraint-free adaptive FEMs on quadrilateral nonconforming meshes
- Improved maximum angle estimate for longest-edge bisection
- Non-equivalent partitions of \(d\)-triangles with Steiner points
- Adaptive meshing in a mixed regime hydrologic simulation model
- The metallic ratios as limits of complex valued transformations
- On local and global bisection-type mesh refinements in C programming language
- An adaptive polygonal finite volume element method based on the mean value coordinates for anisotropic diffusion problems
- Block-balanced meshes in iterative uniform refinement
- A geometric diagram and hybrid scheme for triangle subdivision
- Triangulation refinement by using edge subdivision
- Longest-edge \(n\)-section algorithms: properties and open problems
- Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems
This page was built for publication: The 4-triangles longest-side partition of triangles and linear refinement algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718402)
