carrier image

Cache-mesh, a Dynamics Data Structure for Performance Optimization

Nguyen, Tuan, Vedrana Dahl, Andreas Bærentzen

Proceedings, 26th International Meshing Roundtable, Elsevier, Science Direct, September 18-21 2017

INTERNATIONAL
MESHING
ROUNTABLE

26th International Meshing Roundtable
Barcelona, Spain
September 18-21, 2017

Tuan Nguyen, Denmark Technical University, DK, tntr@dtu.dk
Vedrana Dahl, Denmark Technical University, DK, vand@dtu.dk
Andreas Bærentzen, Denmark Technical University, DK, janba@dtu.dk

Abstract
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 problem 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 extra 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 slightly similar to a traditional mesh in term of implementation.

Download Full Paper (PDF)


Contact author(s) or publisher for availability and copyright information on above referenced article