A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
From MaRDI portal
Recommendations
- Tetrahedral grid refinement
- Local mesh refinement in 2 and 3 dimensions
- Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- Local refinement of simplicial grids based on the skeleton
Cited in
(49)- An automatic strategy for adaptive tetrahedral mesh generation
- Lepp-bisection algorithms, applications and mathematical properties
- 3D mesh refinement in compliance with a specified node spacing function
- Symbolic local refinement of tetrahedral grids
- Relationship between tetrahedron shape measures
- Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching.
- r-refinement grid adaptation algorithms and issues
- On the adjacencies of triangular meshes based on skeleton-regular partitions
- Refinement strategies related to cubic tetrahedral meshes
- A three-dimensional adaptive method based on the iterative grid redistribution
- Tetrahedral grid refinement
- Mesh quality control for multiply-refined tetrahedral grids
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Local refinement of simplicial grids based on the skeleton
- Refinement based on longest-edge and self-similar four-triangle partitions
- Adaptive unstructured volume remeshing. I: The method
- 3D anisotropic mesh adaptation by mesh modification
- Geometry-guided computation of 3D electrostatics for large biomolecules
- A comparative study between some bisection based partitions in 3D
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- Error estimates and adaptive finite element methods. A bibliography (1990--2000)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- On numerical regularity of trisection-based algorithms in 3D
- An algorithm for mesh refinement and un-refinement in fast transient dynamics
- Terminal star operations algorithm for tetrahedral mesh improvement
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- Selective refinement/derefinement algorithms for sequences of nested triangulations
- Computational aspects of the refinement of 3D tetrahedral meshes
- An error-estimate-free and remapping-free variational mesh refinement and coarsening method for dissipative solids at finite strains
- scientific article; zbMATH DE number 27646 (Why is no real title available?)
- Multithread parallelization of LEPP-bisection algorithms
- 3D adaptive mesh refinement
- scientific article; zbMATH DE number 1225284 (Why is no real title available?)
- A MEMORY-EFFICIENT UNSTRUCTURED GRID REFINEMENT ALGORITHM FOR COMPUTATION OF 3D STEADY VISCOUS FLOWS
- USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
- scientific article; zbMATH DE number 1174967 (Why is no real title available?)
- scientific article; zbMATH DE number 1534435 (Why is no real title available?)
- The limit property for the interior solid angles of some refinement schemes for simplicial meshes
- scientific article; zbMATH DE number 2088258 (Why is no real title available?)
- scientific article; zbMATH DE number 849031 (Why is no real title available?)
- Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
- A multi-level adaptive mesh refinement method for level set simulations of multiphase flow on unstructured meshes
- On local and global bisection-type mesh refinements in C programming language
- An \textit{hp}-adaptive sampling algorithm for dispersion relation reconstruction of 3D photonic crystals
- Longest-edge \(n\)-section algorithms: properties and open problems
- A novel variational algorithmic formulation for wrinkling at finite strains based on energy minimization: application to mesh adaption
- Space-filling curves for 2-simplicial meshes created with bisections and reflections.
- Stability of the 8-tetrahedra shortest-interior-edge partitioning method
- Fast intersections on nested tetrahedrons (FINT): An algorithm for adaptive finite element based distributed parameter estimation
This page was built for publication: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015082)
