An algorithm for fast topological consistent simplification of face features
Cracks and topological conflicts could happen if the Ramer Douglas-Peucker (RDP) algorithm is directly used to simplify face features. And most existing algorithms for topological consistent line simplification do not give a detailed description of the mechanism of detection-point identification which is used for inconsistency check. To solve the problems, firstly, the basic strategy of detection-point identification is presented. But this strategy will make the output detection-point set contain some unnecessary detection-points, to overcome these limitations, considering spatial relationships, then an improved strategy is put forward to obtain key detection-points. Compared with the basic strategy, the improved strategy can narrow the search scope of detection-point identification and reduce the number of detectionpoints, which can avoid some unnecessary parity checks in inconsistency check. Finally, an improved RDP algorithm based on detection-point identification is proposed. The experimental results prove that the given algorithm based on the improved strategy of detection-point identification not only can guarantee planar topological consistent, but also can slightly reduce computational cost.
Author's Name: Li, L., Wang, Q., Zhang, X., Wang, H.