Year: 2013
Type: conference-paper
Abstract: The marching cubes algorithm is a popular method for constructing surfaces from SPH data sets. In order to\npreserve all of the surface details in high curvature regions and to prevent potential temporal coherence artifacts,\nthe resolution of the underlying uniform MC grid should be set up sufficiently high. However, this requirement\nunnecessarily increases the resolution in relatively flat regions where the surface can be constructed with lower\nresolutions without changing the quality. Accordingly, excessive number of triangles are generated, the memory\nconsumption increases dramatically, and the performance decreases. In this paper, we present a 3-level grid structure\nwhich adapts its cells according to the curvature of the fluid surface. In contrast to widely-used octrees, we\npropose a simple to construct yet efficient hierarchical uniform grid structure. Mesh blocks from different resolution\ncells are seamlessly stitched by closing cracks with new triangles which establish only 0.15% to 0.6% of\noverall number of triangles in average. Experiments show that in contrast to the single level low resolution uniform\ngrid approach, the presented method reconstructs fine details properly with a comparable performance; while\nit produces similar results with less number of triangles, up to four times better memory consumption and up to\n60% better performance when compared to the single level high resolution uniform grid approach.
Institution: University of Freiburg
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funders: Nvidia, Deutsche Forschungsgemeinschaft
Award: G719518300
OpenAlex ID: W2406224214