Athawale, Tushar M.Wang, ZheJohnson, Chris R.Pugmire, DavidTominski, ChristianWaldner, ManuelaWang, Bei2024-05-172024-05-172024978-3-03868-251-6https://doi.org/10.2312/evs.20241071https://diglib.eg.org/handle/10.2312/evs20241071Uncertainty visualization is an important emerging research area. Being able to visualize data uncertainty can help scientists improve trust in analysis and decision-making. However, visualizing uncertainty can add computational overhead, which can hinder the efficiency of analysis. In this paper, we propose novel data-driven techniques to reduce the computational requirements of the probabilistic marching cubes (PMC) algorithm. PMC is an uncertainty visualization technique that studies how uncertainty in data affects level-set positions. However, the algorithm relies on expensive Monte Carlo (MC) sampling for the multivariate Gaussian uncertainty model because no closed-form solution exists for the integration of multivariate Gaussian. In this work, we propose the eigenvalue decomposition and adaptive probability model techniques that reduce the amount of MC sampling in the original PMC algorithm and hence speed up the computations. Our proposed methods produce results that show negligible differences compared with the original PMC algorithm demonstrated through metrics, including root mean squared error, maximum error, and difference images. We demonstrate the performance and accuracy evaluations of our data-driven methods through experiments on synthetic and real datasets.Attribution 4.0 International LicenseCCS Concepts: Human-centered computing → Scientific visualization; Mathematics of computing → Probabilistic algorithms; Sequential Monte Carlo methods; Multivariate statisticsHuman centered computing → Scientific visualizationMathematics of computing → Probabilistic algorithmsSequential Monte Carlo methodsMultivariate statistics10.2312/evs.202410715 pages