Publicación:
TUNED TERMINAL TRIANGLES CENTROID DELAUNAY ALGORITHM FOR TRIANGULATION

Vista sencilla de ítem
dc.creatorPEDRO ANGEL RODRÍGUEZ MORENO
dc.date2019
dc.date.accessioned2025-01-10T15:12:42Z
dc.date.available2025-01-10T15:12:42Z
dc.date.issued2019
dc.description.abstractAN IMPROVED LEPP BASED, TERMINAL TRIANGLES CENTROID ALGORITHM FOR CONSTRAINED DELAUNAY QUALITY TRIANGULATION IS DISCUSSED AND STUDIED. FOR EACH BAD QUALITY TRIANGLE T, THE ALGORITHM USES THE LONGEST EDGE PROPAGATING PATH (LEPP(T)) TO FIND A COUPLE OF DELAUNAY TERMINAL TRIANGLES (WITH LARGEST ANGLES LESS THAN OR EQUAL TO 120?) SHARING A COMMON LONGEST (TERMINAL) EDGE. THEN THE CENTROID OF THE TERMINAL QUADRILATERAL IS DELAUNAY INSERTED IN THE MESH. BISECTION OF SOME CONSTRAINED EDGES ARE ALSO PERFORMED TO ASSURE FAST CONVERGENCE. WE PROVE ALGORITHM TERMINATION AND THAT A GRADED, OPTIMAL SIZE, 30? TRIANGULATION IS OBTAINED, FOR ANY PLANAR STRAIGHT LINE GRAPH (PSLG) GEOMETRY WITH CONSTRAINED ANGLES GREATER THAN OR EQUAL TO 30?.
dc.formatapplication/pdf
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/10943
dc.languagespa
dc.publisher27TH MESA REDONDA INTERNACIONAL DE MESHING
dc.rightsPUBLICADA
dc.titleTUNED TERMINAL TRIANGLES CENTROID DELAUNAY ALGORITHM FOR TRIANGULATION
dc.title.alternativeTRIÁNGULOS TERMINALES SINTONIZADOS ALGORITMO DE DELAUNAY CENTROIDE PARA LA TRIANGULACIÓN DE CALIDAD
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE SISTEMAS DE INFORMACION
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos