Analytic Solution to the Piecewise Linear Interface Construction Problem and its Application in Curvature Calculation for Volume-of-Fluid Simulation Codes
Moritz Lehmann, Stephan Gekle

TL;DR
This paper presents an improved analytic solution for the plane-cube intersection problem in PLIC, significantly reducing computation time and enhancing accuracy in volume-of-fluid simulations, especially on GPUs.
Contribution
The authors derive an optimized analytic solution for all intersection cases, including edge cases, and compare its performance to iterative methods across hardware platforms.
Findings
Analytic solution outperforms iterative methods on GPUs.
Newton-Raphson is fastest on CPUs with vectorization.
Optimized analytic solution reduces computation time in fluid simulations.
Abstract
The plane-cube intersection problem has been around in literature since 1984 and iterative solutions to it have been used as part of piecewise linear interface construction (PLIC) in computational fluid dynamics simulation codes ever since. In many cases, PLIC is the bottleneck of these simulations regarding compute time, so a faster, analytic solution to the plane-cube intersection would greatly reduce compute time for such simulations. We derive an analytic solution for all intersection cases and compare it to the one previous solution from Scardovelli and Zaleski (Ruben Scardovelli and Stephane Zaleski. "Analytical relations connecting linear interfaces and volume fractions in rectangular grids". In: Journal of Computational Physics 164.1 (2000), pp. 228-237.), which we further improve to include edge cases and micro-optimize to reduce arithmetic operations and branching. We then…
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.
