Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy

UDC.coleccionInvestigación
UDC.departamentoEnxeñaría de Computadores
UDC.endPage851
UDC.grupoInvGrupo de Arquitectura de Computadores (GAC)
UDC.issue7
UDC.journalTitleThe Computer Journal
UDC.startPage843
UDC.volume56
dc.contributor.authorBóo, Montserrat
dc.contributor.authorAmor, Margarita
dc.contributor.authorConcheiro, Raquel
dc.contributor.authorDoggett, Michael
dc.date.accessioned2026-03-30T11:15:27Z
dc.date.available2026-03-30T11:15:27Z
dc.date.issued2012-05-21
dc.descriptionThis is a pre-copyedited, author-produced version of an article accepted for publication in The Computer Journal following peer review. The version of record M. Bóo, M. Amor, R. Concheiro, M. Doggett, Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy, The Computer Journal, Volume 56, Issue 7, July 2013, Pages 843–851, is available online at: https://academic.oup.com/comjnl/article-abstract/56/7/843/397484?redirectedFrom=fulltext [https://doi.org/10.1093/comjnl/bxs046].
dc.description.abstract[Abstract]: In this paper, we present a meshing scheme for the implementation of an adaptive tessellation of triangular meshes on the graphics processing unit (GPU). Tessellation is performed according to a local test to generate primitives dynamically. The refinement procedure does not require the pre-computation of any refinement pattern. The resulting adaptive procedure is efficient and simple, and generates the tessellation pattern of each triangle dynamically. The non-recursive strategy simplifies mesh reconstruction, avoids irregular memory access patterns and uses a simple control flow to make it a good candidate to guide the evolution of tessellation algorithms on future graphics cards. To test our proposal, we have used the geometry shader of current GPUs to generate primitives dynamically.
dc.description.sponsorshipThis work was supported by the Xunta de Galicia under the Program for Consolidation of Competitive Research Groups ref. 2010/06 and by the Ministry of Science and Innovation of Spain, cofunded by the FEDER funds of the European Union, under contract TIN2010-16735.
dc.description.sponsorshipXunta de Galicia; 2010/06
dc.identifier.citationM. Bóo, M. Amor, R. Concheiro, M. Doggett, Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy, The Computer Journal, Volume 56, Issue 7, July 2013, Pages 843–851, https://doi.org/10.1093/comjnl/bxs046
dc.identifier.doi10.1093/comjnl/bxs046
dc.identifier.issn1460-2067
dc.identifier.urihttps://hdl.handle.net/2183/47844
dc.language.isoeng
dc.publisherOxford
dc.relation.projectIDinfo:eu-repo/grantAgreement/MICINN/Plan Nacional de I+D+i 2008-2011/TIN2010–16735/ES/ARQUITECTURAS, SISTEMAS Y HERRAMIENTAS PARA COMPUTACION DE ALTAS PRESTACIONES
dc.relation.urihttps://doi.org/10.1093/comjnl/bxs046
dc.rights© The Author 2012. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.
dc.rights.accessRightsopen access
dc.subjectAdaptive tessellation
dc.subjectDisplacement mapping
dc.subjectNon-recursive strategy
dc.subjectStrips of vertices
dc.titleEfficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy
dc.typejournal article
dc.type.hasVersionAM
dspace.entity.typePublication
relation.isAuthorOfPublicationc98c1fe1-2016-44c1-9225-43fe1c6b8088
relation.isAuthorOfPublication031327b6-9736-4147-85a4-fa7186257b5a
relation.isAuthorOfPublication.latestForDiscoveryc98c1fe1-2016-44c1-9225-43fe1c6b8088

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Amor_Margarita_2013_Efficient_Adaptive_and_Dynamic_Mesh_Refinement.pdf
Size:
1.47 MB
Format:
Adobe Portable Document Format