作者: H. Jänicke , M. Böttinger , X. Tricoche , G. Scheuermann
DOI: 10.1111/J.1467-8659.2008.01206.X
关键词: Algorithm 、 Visualization 、 Field (computer science) 、 Computation 、 Computer science 、 Voronoi diagram 、 Graph theory 、 Bottleneck 、 Division (mathematics) 、 Information theory
摘要: Current unsteady multi-field simulation data-sets consist of millions data-points. To efficiently reduce this enormous amount information, local statistical complexity was recently introduced as a method that identifies distinctive structures using concepts from information theory. Due to high computational costs so far limited 2D data. In paper we propose new strategy for the computation is substantially faster and allows more precise analysis. The bottleneck original division spatio-temporal configurations in field (light-cones) into different classes behavior. algorithm uses density-driven Voronoi tessellation task accurately captures distribution sparsely sampled high-dimensional space. efficient achieved algorithms graph ability detect regions 3D illustrated flow weather simulations.