Bisection-based triangulations of nested hypercubic meshes
From MaRDI portal
Cites work
- A unified framework for primal/dual quadrilateral subdivision schemes
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Conformal refinement of unstructured quadrilateral meshes
- Efficient hexahedral mesh generation for complex geometries using an improved set of refinement templates
- Foundations of multidimensional and metric data structures.
- scientific article; zbMATH DE number 1343370 (Why is no real title available?)
- scientific article; zbMATH DE number 849030 (Why is no real title available?)
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Local level set method in high dimension and codimension
- Octrees with near optimal cost for ray-shooting
- On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
- Provably good mesh generation
- Right-triangulated irregular networks
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
This page was built for publication: Bisection-based triangulations of nested hypercubic meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444270)