Buscar
Mostrando ítems 1-9 de 17
Terminal Triangles Centroid Algorithms for Quality Delaunay Triangulation
(Elsevier, 2020)
Two Lepp algorithms for quality Delaunay triangulation are discussed. Firstly a terminal triangles centroid Delaunay algorithm is studied. For each bad quality triangle t, the algorithm uses the longest edge propagating ...
Herramienta de resolución de triangulaciones geométricas
(Universidad de Chile, 2018)
La triangulación de Delaunay es una entidad geométrica con muchas aplicaciones en computación gráfica e ingeniería. Por lo general, su construcción es un problema difícil que a menudo viene acompañado con restricciones ...
Implementación de una Biblioteca de Triangulación de Polígonos Basada en el Algoritmo LEPP Delaunay
(Universidad de ChileCyberDocs, 2010)
Las mallas de triángulos son ampliamente utilizadas en aplicaciones científicas e ingeniería. Una triangulación de un conjunto de puntos puede construirse utilizando diversos algoritmos, pero usualmente se prefiere aquellos ...
Lepp Terminal Centroid Method for Quality Triangulation: A Study on a New Algorithm
(2010)
We introduce a new Lepp-Delaunay algorithm for quality
triangulation. For every bad triangle t with smallest angle less than a
threshold angle θ, a Lepp-search is used to find an associated convex terminal
quadrilateral ...
Automatic LEFM crack propagation method based on local Lepp–Delaunay mesh refinement
(ELSEVIER, 2010)
A numerical method for 2D LEFM crack propagation simulation is presented. This uses a Lepp–Delaunay
based mesh refinement algorithm for triangular meshes which allows both the generation of the initial
mesh and the local ...
Lepp terminal centroid method for quality triangulation
(ELSEVIER, 2010)
We discuss Lepp-centroid versus Lepp-midpoint algorithms for Delaunay quality triangulation. We
present geometrical results that ensure that the centroid version produces triangulations with both
average smallest angles ...
A STUDY ON DELAUNAY TERMINAL EDGE METHOD
(SPRINGER, 2006)
The Delaunay terminal edge algorithm for triangulation improvement proceeds by iterative Lepp selection of a point M which is midpoint of a Delaunay terminal edge in the mesh. The longest edge bisection of the associated ...