This paper illustrates a novel method to compute the Reeb graph for triangle meshes. The algorithm is based on the definition of discrete, active contours as counterparts of continuous level lines. Active contours are made up of edges and vertices with multiple presence and implicitly maintain a faithful representation of the level lines, even in case of coarse meshes with higher genus. This approach gives a great advantage in the identification of the nodes in the Reeb graph and also improves the overall efficiency of the algorithm in that at each step only the information local to the contours and their immediate neighborhood needs to be processed. The validation of functional integrity for the algorithm has been carried out experimentally, with real-world data, without mesh pre-processing.
展开▼
