Cache-mesh, a Dynamics Data Structure for Performance Optimization. (2017)

• Record Type: Journal Article
• Authors: Nguyen, Tuan T.; Dahl, Vedrana A.; Bærentzen, J. Andreas
• Is Part Of: Procedia engineering. Volume 203(2017)
• Page Start: 193
• Page End: 205
• Publication Date: 2017
• Subjects: cache -- geometry processing -- dynamics structure -- data structure -- performance optimization; Engineering -- Congresses; Engineering -- Periodicals; Engineering; Conference proceedings; Periodicals; 620.005
• DOI: 10.1016/j.proeng.2017.09.807
• Languages: English
• ISSNs: 1877-7058

Abstract

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 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.