Craig Schroeder
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Craig Schroeder has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Tamar Shinar
4 shared publications- Tamar Shinar
Computer Science, University of California Riverside, Riverside, California, USA
4 shared publications Jason Goulding
2 shared publicationsSong Bai
2 shared publicationsAvi Robinson-Mosher
Wyss Institute for Biologically Inspired Engineering, Boston
1 shared publicationC. Zhao
University of California Riverside
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Buoyancy-driven Phase Separation in the Material Point Method
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessBuoyancy-driven Phase Separation in the Material Point Method
- 9 April 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 560
Divergence-free interpolation of MAC grid data over irregular domains
- 9 April 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 560
Divergence-free interpolation of MAC grid data over irregular domains
- 14 December 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 548
Second order accurate discretization of the material point method on periodic domains
- 14 December 2025
- Published by Elsevier in Journal of Computational Physics
- Vol. 548
Second order accurate discretization of the material point method on periodic domains
- Open Access
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-15
Fast reconstruction of implicit surfaces using convolutional neural networks 51
Recently, Zhao et al. [Zhao et al. 2024 ] proposed a new method for constructing signed distance functions from fluid simulation particles. This method was able to achieve superior surface smoothness, noise reduction, and temporal coherence compared with previous methods. One of the main limitations of the method was its relatively slow construction times, even though it utilized both the CPU and GPU. In this paper, we consider two modifications to this scheme that make the algorithm easier to optimize without introducing any perceptible changes in reconstruction quality, as illustrated in Figure 1 . With these improvements, a surface can be reconstructed from a single fluid simulation with 2M particles in 2.21 seconds, compared with 72.3 seconds for the original method, resulting in a single-frame reconstruction speedup of about 33 × , making the surface reconstruction fast enough for use within a simulation framework. When reconstructing surface for multiple simulation frames together, we achieve a speedup of about 5 × compared with the original. The optimized implementation will be released with the publication.
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-15
Open AccessFast reconstruction of implicit surfaces using convolutional neural networks 51
Recently, Zhao et al. [Zhao et al. 2024 ] proposed a new method for constructing signed distance functions from fluid simulation particles. This method was able to achieve superior surface smoothness, noise reduction, and temporal coherence compared with previous methods. One of the main limitations of the method was its relatively slow construction times, even though it utilized both the CPU and GPU. In this paper, we consider two modifications to this scheme that make the algorithm easier to optimize without introducing any perceptible changes in reconstruction quality, as illustrated in Figure 1 . With these improvements, a surface can be reconstructed from a single fluid simulation with 2M particles in 2.21 seconds, compared with 72.3 seconds for the original method, resulting in a single-frame reconstruction speedup of about 33 × , making the surface reconstruction fast enough for use within a simulation framework. When reconstructing surface for multiple simulation frames together, we achieve a speedup of about 5 × compared with the original. The optimized implementation will be released with the publication.
- 29 November 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 523
Conservative, bounded, and nonlinear discretization of the Cahn-Hilliard-Navier-Stokes equations
- 29 November 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 523
Conservative, bounded, and nonlinear discretization of the Cahn-Hilliard-Navier-Stokes equations
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Reconstruction of implicit surfaces from fluid particles using convolutional neural networks
In this paper, we present a novel network‐based approach for reconstructing signed distance functions from fluid particles. The method uses a weighting kernel to transfer particles to a regular grid, which forms the input to a convolutional neural network. We propose a regression‐based regularization to reduce surface noise without penalizing high‐curvature features. The reconstruction exhibits improved spatial surface smoothness and temporal coherence compared with existing state of the art surface reconstruction methods. The method is insensitive to particle sampling density and robustly handles thin features, isolated particles, and sharp edges.
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Reconstruction of implicit surfaces from fluid particles using convolutional neural networks
In this paper, we present a novel network‐based approach for reconstructing signed distance functions from fluid particles. The method uses a weighting kernel to transfer particles to a regular grid, which forms the input to a convolutional neural network. We propose a regression‐based regularization to reduce surface noise without penalizing high‐curvature features. The reconstruction exhibits improved spatial surface smoothness and temporal coherence compared with existing state of the art surface reconstruction methods. The method is insensitive to particle sampling density and robustly handles thin features, isolated particles, and sharp edges.
- 30 August 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 519
Simplified conservative discretization of the Cahn-Hilliard-Navier-Stokes equations
- 30 August 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 519
Simplified conservative discretization of the Cahn-Hilliard-Navier-Stokes equations
- 26 July 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 518
Second order accurate particle-in-cell discretization of the Navier-Stokes equations
- 26 July 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 518
Second order accurate particle-in-cell discretization of the Navier-Stokes equations
- 8 February 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 503
Higher order divergence-free and curl-free interpolation on MAC grids
- 8 February 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 503
Higher order divergence-free and curl-free interpolation on MAC grids
- 1 December 2022
- Published by Wiley in Computer Graphics Forum
- Vol. 41 (8) , 19-30
Stability analysis of explicit MPM
In this paper we analyze the stability of the explicit material point method (MPM). We focus on PIC, APIC, and CPIC transfers using quadratic and cubic splines in two and three dimensions. We perform a fully three‐dimensional Von Neumann stability analysis to study the behavior within the bulk of a material. This reveals the relationship between the sound speed, CFL number, and actual time step restriction and its dependence on discretization options. We note that boundaries are generally less stable than the interior, with stable time steps generally decreasing until the limit when particles become isolated. We then analyze the stability of a single particle to derive a novel time step restriction that stabilizes simulations at their boundaries. Finally, we show that for explicit MPM with APIC or CPIC transfers, there are pathological cases where growth is observed at arbitrarily small time steps sizes. While these cases do not necessarily pose a problem for practical usage, they do suggest that a guarantee of stability may be theoretically impossible and that necessary but not sufficient time step restrictions may be a necessary and practical compromise.
- 1 December 2022
- Published by Wiley in Computer Graphics Forum
- Vol. 41 (8) , 19-30
Stability analysis of explicit MPM
In this paper we analyze the stability of the explicit material point method (MPM). We focus on PIC, APIC, and CPIC transfers using quadratic and cubic splines in two and three dimensions. We perform a fully three‐dimensional Von Neumann stability analysis to study the behavior within the bulk of a material. This reveals the relationship between the sound speed, CFL number, and actual time step restriction and its dependence on discretization options. We note that boundaries are generally less stable than the interior, with stable time steps generally decreasing until the limit when particles become isolated. We then analyze the stability of a single particle to derive a novel time step restriction that stabilizes simulations at their boundaries. Finally, we show that for explicit MPM with APIC or CPIC transfers, there are pathological cases where growth is observed at arbitrarily small time steps sizes. While these cases do not necessarily pose a problem for practical usage, they do suggest that a guarantee of stability may be theoretically impossible and that necessary but not sufficient time step restrictions may be a necessary and practical compromise.