• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

Two information entropybased seeding
methods for 3D flow visualization

HUANG Dongmei1,DU Yanling1,2,ZHANG Lüwen1   

  1. (1.College of Information Technology,Shanghai Ocean University,Shanghai 201306;
    2.East China Sea Forecast Center of the State Oceanic Administration,Shanghai 200136,China)
     
  • Received:2016-06-23 Revised:2017-01-03 Online:2018-03-25 Published:2018-03-25

Abstract:

Effective seeding method is the key to influence the streamline distribution and to understand the underlying properties of flow field. Based on the accurate description of flow field variation and important features, this paper proposes two information entropybased seeding methods to solve the wellknown occlusion and cluttering issue. The first greedy seeding method locates interesting areas through the calculation of entropy values. The greedy seeding method is highly sensitive to the important features. The second Monte Carlo seeding method generates random inputs based on a probability distribution, and then defines the influence areas of input grid points as a circle in 2D and a sphere in 3D. Comprehensive experiments on multiple datasets show that the greedy seeding method can capture the important features efficiently and the Monte Carlo seeding method shows significant ability to obtain global variation. Besides, the combination of both methods can get more optimal flow field visualization.
 

Key words: flow visualization, information entropy, seeding points, streamline