Tsalikis, SpirosSchroeder, WillSzafir, DanielMoreland, KennethReina, GuidoRizzi, Silvio2024-05-212024-05-212024978-3-03868-243-11727-348Xhttps://doi.org/10.2312/pgv.20241130https://diglib.eg.org/handle/10.2312/pgv20241130The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies → Shared memory algorithms; Theory of computation → Computational geometryComputing methodologies → Shared memory algorithmsTheory of computation → Computational geometry10.2312/pgv.2024113010 pages