Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/43487
Full metadata record
DC FieldValueLanguage
dc.creatorOliveira, Sanderson L. Gonzaga de-
dc.date.accessioned2020-10-21T18:12:15Z-
dc.date.available2020-10-21T18:12:15Z-
dc.identifier.citationOLIVEIRA, S. L. G. de. A review on delaunay refinement techniques. Computational Science and Its Applications, [S. l.], p. 172-187, 2012. DOI: https://doi.org/10.1007/978-3-642-31125-3_14.pt_BR
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-642-31125-3_14pt_BR
dc.identifier.urihttp://repositorio.ufla.br/jspui/handle/1/43487-
dc.description.abstractDelaunay refinement is a technique for generating triangulations. Triangulations produced by algorithms in this class of techniques guarantee bounds on angles, edge lengths, the number and the grading of triangles in theory and practice. This paper is a brief review of point insertion techniques in Delaunay triangulations. Important works on the insertion of vertices in Delaunay triangulations and its dual graph, the Voronoi diagram, are described as a start point for one who needs to build a quality mesh using adaptive triangular-mesh refinement.pt_BR
dc.languageen_USpt_BR
dc.publisherSpringerpt_BR
dc.rightsrestrictAccesspt_BR
dc.sourceComputational Science and Its Applicationspt_BR
dc.subjectMesh generationpt_BR
dc.subjectDelaunay triangulationpt_BR
dc.subjectVoronoi diagrampt_BR
dc.subjectGeração de malhapt_BR
dc.subjectTriangulação de Delaunaypt_BR
dc.subjectDiagrama de Voronoipt_BR
dc.titleA review on delaunay refinement techniquespt_BR
dc.typeArtigopt_BR
Appears in Collections:DCC - Artigos publicados em periódicos

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Admin Tools