Block-balanced meshes in iterative uniform refinement
From MaRDI portal
Publication:733379
DOI10.1016/j.cagd.2006.09.003zbMath1171.65355OpenAlexW1974354208MaRDI QIDQ733379
Publication date: 16 October 2009
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2006.09.003
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometry based triangulation of multiple trimmed NURBS surfaces
- A practical guide to splines
- Converting triangulations to quadrangulations
- On the adjacencies of triangular meshes based on skeleton-regular partitions
- Delaunay refinement algorithms for triangular mesh generation
- A generative classification of mesh refinement rules with lattice transformations
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- Quasi 4--8 subdivision
- 4--8 Subdivision
This page was built for publication: Block-balanced meshes in iterative uniform refinement