GPU Programming - Speeding Up the 3D Surface Generator VESTA
B. R. Schlei

TL;DR
This paper compares GPU implementations of VESTA and Marching Cubes, demonstrating that VESTA significantly outperforms MCA in speed for 3D surface generation from volumetric data.
Contribution
It introduces GPU-optimized VESTA and benchmarks its performance against the state-of-the-art Marching Cubes Algorithm.
Findings
VESTA runs significantly faster than MCA on GPU implementations.
Benchmark results show VESTA's superior speed in 3D surface extraction.
VESTA is effective for volumetric data visualization.
Abstract
The novel "Volume-Enclosing Surface exTraction Algorithm" (VESTA) generates triangular isosurfaces from computed tomography volumetric images and/or three-dimensional (3D) simulation data. Here, we present various benchmarks for GPU-based code implementations of both VESTA and the current state-of-the-art Marching Cubes Algorithm (MCA). One major result of this study is that VESTA runs significantly faster than the MCA.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
