Mesh quality improvement and other properties in the four-triangles longest-edge partition

Computer Aided Geometric Design

Volumn 21, Issue 4, 2004, Pages 353-369

  Plaza, Ángel ^a   Suárez, José P ^a   Padrón, Miguel A ^a   Falcón, Sergio ^a   Amieiro, Daniel ^a  

^a UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

Author keywords

Longest edge based algorithms; Mesh quality; Refinement; Similarity classes

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED MANUFACTURING; FINITE ELEMENT METHOD; PROBLEM SOLVING;

LONGEST-EDGE BASED ALGORITHMS; MESH QUALITY; REFINEMENT; SIMILARITY CLASSES;

COMPUTER AIDED DESIGN;

EID: 1842558612     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2004.01.001     Document Type: Article

References (19)

1. Arnold D.N., Mukherjee A., Pouly L. Locally adapted tetrahedral meshes using bisection. SIAM J. Sci. Comput. 22:(2):2000;431-448.
2. Bänch E. Local mesh refinement in 2 and 3 dimensions. IMPACT Comput. Sci. Engrg. 3:1991;181-191.
3. Bern M., Eppstein D. Mesh generation and optimal triangulation. Du D.-Z., Hawang F.K. Computing in Euclidean Geometry. second ed. 1995;47-123 World Scientific.
4. Bertram M., Barnes J.C., Hamann B., Joy K.I., Pottmann J., Wushour D. Piecewise optimal triangulation for the approximation of scattered data in the plane. Comput. Aided Geom. Design. 17:(8):2000;767-787.
5. Bova S.W., Carey G.F. Mesh generation/refinement using fractal concepts and iterated function systems. Internat. J. Numer. Methods Engrg. 33:1992;287-305.
6. Carey G.F. Computational Grids: Generation, Refinement and Solution Strategies. 1997;Taylor and Francis.
7. Graham R.L., Knuth D.E., Patashnik O. Concrete Mathematics. 1989;Addison-Wesley.
8. Hitschfeld N., Villablanca L., Krause J., Rivara M.-C. Improving the quality of meshes for the simulation of semiconductor devices using Lepp-based algorithms. Internat. J. Numer. Methods Engrg. 58:2003;333-347.
9. Hoppe H. Progressive meshes. ACM SIGGRAPH. 30:1996;99-108.
10. Kumar S. Robust incremental polygon triangulation for fast surface rendering. J. WSCG. 8:(1):2000.
11. Luebke D.P. A developer's survey of polygonal simplification. IEEE Comput. Graphics Appl. 21:(3):2001;24-35.
12. Maubach J.M. Local bisection refinement for n -simplicial grids generated by reflection. SIAM J. Sci. Statist. Comput. 16:(1):1995;210-227.
13. Mitchell W.F. Optimal multilevel iterative methods for adaptive grids. SIAM J. Sci. Statist. Comput. 13:1992;146-167.
14. Rabi Kumar G.V.V., Srinivasan P., Shastry K.G., Prakash B.G. Geometry based triangulation of multiple trimmed NURBS surfaces. Comput. Aided Design. 33:2001;439-454.
15. Rassineus A., Breitkopf P., Villon P. Simultaneous surface and tetrahedron mesh adaptation using mesh-free techniques. Internat. J. Numer. Methods Engrg. 57:2003;371-389.
16. Rivara M.-C. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. Internat. J. Numer. Methods Engrg. 20:1984;745-756.
17. Rivara M.-C., Iribarren G. The 4-triangles longest-side partition of triangles and linear refinement algorithms. Math. Comp. 65:(216):1996;1485-1502.
18. Rivara M.-C., Hitschfeld N., Simpson B. Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem. Comput. Aided Design. 33:2001;263-273.
19. Rosenberg I., Stenger F. A lower bound on the angles of triangles constructed by bisecting the longest side. Math. Comp. 29:1975;390-395.