摘要

Topological methods are important for flow visualization, and many of them involve the detection and classification of critical points. Traditionally, the critical points are detected and classified by error-prone numerical methods, until Bhatia et al. (Topological methods in data analysis and visualization III, Springer, 2014) proposed the robust method for detecting simplices containing critical points. In this paper, we will extend Bhatia's idea to compute the Poincar, index of critical points in piecewise linear vector fields. All kinds of simplical complexes are considered, including 2D/3D triangulated meshes, and also triangulated surfaces. We test our algorithm on both synthetic and simulation data sets, which show the efficiency and accuracy of our methods.