Journal article
Cache-mesh, a Dynamics Data Structure for Performance Optimization
Department of Applied Mathematics and Computer Science, Technical University of Denmark1
Visual Computing, Department of Applied Mathematics and Computer Science, Technical University of Denmark2
Statistics and Data Analysis, Department of Applied Mathematics and Computer Science, Technical University of Denmark3
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.
Language: | English |
---|---|
Year: | 2017 |
Pages: | 193-205 |
Proceedings: | 26th International Meshing Roundtable |
ISSN: | 18777058 |
Types: | Journal article |
DOI: | 10.1016/j.proeng.2017.09.807 |
ORCIDs: | Nguyen, Tuan T. , Dahl, Vedrana Andersen and Bærentzen, J. Andreas |