A geometric diagram and hybrid scheme for triangle subdivision
From MaRDI portal
Publication:733390
DOI10.1016/j.cagd.2006.10.002zbMath1171.65349OpenAlexW2096557106MaRDI QIDQ733390
Graham F. Carey, José P. Suárez, Ángel Plaza
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.10.002
Related Items
On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\), The metallic ratios as limits of complex valued transformations, Properties of triangulations obtained by the longest-edge bisection, Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric, There are simple and robust refinements (almost) as good as Delaunay, A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection, A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes, On the 3-dimensional \(k\)-Fibonacci spirals, Local refinement based on the 7-triangle longest-edge partition, Lepp-bisection algorithms, applications and mathematical properties
Cites Work
- Unnamed Item
- Unnamed Item
- Triangular and quadrilateral surface mesh quality optimization using local parametrization
- Optismoothing: An optimization-driven approach to mesh smoothing
- Incremental topological flipping works for regular triangulations
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Algebraic Mesh Quality Metrics
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- Local optimization-based simplicial mesh untangling and improvement
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
