Cache-mesh, a Dynamics Data Structure for Performance Optimization

Research output: Research - peer-reviewJournal article – Annual report year: 2017

Documents

DOI

View graph of relations

This paper proposes the cache-mesh, a dynamic mesh data structure in 3D that allows modifications of stored topological relations effortlessly. The cache-mesh can adapt to arbitrary problems and provide fast retrieval to the most-referred-to topological relations. This adaptation requires trivial extra effort in implementation with the cache-mesh, whereas it may require tremendous effort using traditional meshes. The cache-mesh also gives a further boost to the performance with parallel mesh processing by caching the partition of the mesh into independent sets. This is an additional advantage of the cache-mesh, and the extra work for caching is also trivial. Though it appears that it takes effort for initial implementation, building the cache-mesh is comparable to a traditional mesh in terms of implementation.
Original languageEnglish
JournalProcedia Engineering
Volume203
Pages (from-to)193-205
ISSN1877-7058
DOIs
StatePublished - 2017
Event26th International Meshing Roundtable - Crowne Plaza Fira Center, Barcelona, Spain
Duration: 18 Sep 201721 Sep 2017

Conference

Conference26th International Meshing Roundtable
LocationCrowne Plaza Fira Center
CountrySpain
CityBarcelona
Period18/09/201721/09/2017
CitationsWeb of Science® Times Cited: 0

    Research areas

  • Cache, Geometry processing, Dynamics structure, Data Structure, Performance optimization
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 138576481