A survey of point insertion techniques in bidimensional Delaunay Triangulations
Triangulations are geometric discretizations essential in many scientific applications, such as engineering simulations, visualizations, and geographic information systems. The preferred shape of a triangle depends on the applications. Theoretical and experimental analysis of numerical methods that...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Brasil |
| Institución: | Universidade Federal de Lavras (UFLA) |
| Repositorio: | INFOCOMP: Jornal de Ciência da Computação |
| Idioma: | inglés |
| OAI Identifier: | oai:infocomp.dcc.ufla.br:article/327 |
| Acceso en línea: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/327 |
| Access Level: | acceso abierto |
| Palabra clave: | Delaunay Triangulation mesh generation adaptive triangular mesh refinement computational geometric modeling. |
| Sumario: | Triangulations are geometric discretizations essential in many scientific applications, such as engineering simulations, visualizations, and geographic information systems. The preferred shape of a triangle depends on the applications. Theoretical and experimental analysis of numerical methods that are used in conjunction with triangulations suggest that triangles with no large angles and/or small angles serve well in most applications. This paper is a brief review of a point insertion in 2D Delaunay Triangulations. Important works on the insertion of vertices in Delaunay Triangulations are described as a start point for one who needs to build a quality mesh using adaptive triangular-mesh refinement. |
|---|