PartiEMC: Stable Isoline Reconstruction from Particle-Based Scalar Fields via Virtual-Plane Projection
Source abstract
Abstract
This paper presents a geometry-driven framework for temporally stable 2D isoline reconstruction from particle-based simulation data. Unlike conventional Marching Squares methods, which assume grid-aligned scalar fields and often suffer from boundary jitter and flickering when applied to unstructured particle distributions, the proposed method constructs a continuous scalar field using an SPH kernel and estimates stabilized normals from level-set gradients at cell-level representative positions. Instead of relying on explicit Quadratic Error Function (QEF) optimization, we introduce a virtual-plane projection strategy that determines isoline vertices using a local geometric constraint. This projection can be interpreted as a first-order geometric approximation of QEF minimization, enabling QEF-free vertex positioning while reducing sensitivity to noisy particle-derived normals. As a result, the proposed method improves robustness in sparse particle regions while preserving important geometric features. To further enhance computational efficiency, we integrate a boundary-aware greedy meshing scheme that merges redundant interior geometry while preserving isoline boundaries. Experimental results demonstrate that the proposed method improves boundary stability and area consistency, reduces temporal variation, and decreases triangle counts by up to 70–75% compared with Marching Squares (MS) and Extended Marching Cube (EMC)-based reconstruction. These results indicate that the proposed framework is suitable for efficient real-time visualization of dynamic particle-based simulations.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Computer Graphics and Visualization Techniques · Computational Geometry and Mesh Generation · Fluid Dynamics Simulations and Interactions
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Design Technology, College of Software and Convergence, Inha University, Incheon 22212, Republic of Korea
Graduate School of Electrical and Computer Engineering, Inha University, Incheon 22212, Republic of Korea
Funding
This work was supported by INHA UNIVERSITY Research Grant. · This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government
References (23)
Show source-provided references
1. Lorensen, W.E., and Cline, H.E. (1987). Marching cubes: A high resolution 3D surface construction algorithm. Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 1987), ACM.10.1145/37401.37422 ↗
2. Chernyaev, E.V. (1995, January 3–7). Marching Cubes 33: Construction of topologically correct isosurfaces. Proceedings of theGRAPHI CON ’95, Saint-Petersburg, Russia. CERN Report No. CERN-CN-95-17.
3. Nielson, G.M., and Hamann, B. (1991). The asymptotic decider: Resolving the ambiguity in marching cubes. Proceedings of IEEE Visualization 1991, IEEE.10.1109/VISUAL.1991.175782 ↗
4. A survey of the marching cubes algorithm10.1016/j.cag.2006.07.021 ↗
5. Kobbelt, L.P., Botsch, M., Schwanecke, U., and Seidel, H.-P. (2001). Feature sensitive surface extraction from volume data. Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 2001), ACM.10.1145/383259.383265 ↗
6. Dual marching cubes: Primal contouring of dual grids10.1111/j.1467-8659.2005.00843.x ↗
7. Cubical marching squares: Adaptive feature preserving surface extraction from volume data10.1111/j.1467-8659.2005.00879.x ↗
8. Ju, T., Losasso, F., Schaefer, S., and Warren, J. (2002). Dual contouring of Hermite data. Proceedings of the 29th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 2002), ACM.10.1145/566570.566586 ↗
9. Manifold dual contouring10.1109/TVCG.2007.1012 ↗
10. An octree-based dual contouring method for triangular and tetrahedral mesh generation with guaranteed angle range10.1007/s00366-013-0328-8 ↗
11. Fast free-surface detection and level-set function definition in SPH solvers10.1016/j.jcp.2010.01.019 ↗
12. Adaptively sampled particle fluids10.1145/1276377.1276437 ↗
13. Reconstructing surfaces of particle-based fluids using anisotropic kernels10.1145/2421636.2421641 ↗
14. Jiang, C.M., Sud, A., Makadia, A., Huang, J., Nießner, M., and Funkhouser, T. (2020). Local implicit grid representations for 3D scenes. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE.10.1109/CVPR42600.2020.00604 ↗
15. Points2Surf: Learning implicit surfaces from point clouds
16. Liao, Y., Donné, S., and Geiger, A. (2018). Deep marching cubes: Learning explicit surface representations. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE.10.1109/CVPR.2018.00308 ↗
17. Neural marching cubes10.1145/3478513.3480518 ↗
18. Neural dual contouring10.1145/3528223.3530108 ↗
19. Sundararaman, R., Klokov, R., and Ovsjanikov, M. (2024). Self-supervised dual contouring. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE.10.1109/CVPR52733.2024.00448 ↗
20. Deep marching tetrahedra: A hybrid representation for high-resolution 3D shape synthesis
21. Flexible isosurface extraction for gradient-based mesh optimization10.1145/3592430 ↗
22. Mildenhall, B., Srinivasan, P.P., Tancik, M., Barron, J.T., Ramamoorthi, R., and Ng, R. (2020). NeRF: Representing scenes as neural radiance fields for view synthesis. Computer Vision—ECCV 2020, Springer.10.1007/978-3-030-58452-8_24 ↗
23. Wang, P., Liu, L., Liu, Y., Theobalt, C., Komura, T., and Wang, W. (2021). NeuS: Learning neural implicit surfaces by volume rendering for multi-view reconstruction. arXiv.