6. Conclusion and future work
We presented a novel and practical framework that allows us to apply numerical methods for topological analysis on discrete volumetric data. Compared with the discrete methods, our approach can extract accurate critical points and generate smooth integral lines between critical points. The extracted skeleton is clear for visualization and can be simplified by traditional methods for further analysis. The framework is parallelism-friendly and has good performance. However, for scanned data with large scale, high frequency noise makes the data bumpy in a local region. This phenomenon leads to the increasing number of critical points, which slows down the extraction and makes the skeleton complicated. Though we can apply simplification to the complex skeleton iteratively as the discrete approach does to remove the noise, solving critical points takes too much time. We are exploring new methods in the preprocessing step to remove high frequency noise, so that the number of candidate tetrahedra and the number of polynomial system to be solved are reduced to an acceptable level.