Austin Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Austin Han has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Olivier Desjardins
Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, 14850, NY, USA
3 shared publications - Berend van Wachem
Otto-von-Guericke-Universität Magdeburg
1 shared publication Fabien Evrard
1 shared publication- Fabien Evrard
Chair of Mechanical Process Engineering, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany
1 shared publication Olivier Desjardins
1 shared publicationRobert Chiodi
1 shared publication
Latest Publications
- 24 September 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 519
Capturing thin structures in VOF simulations with two-plane reconstruction
- 24 September 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 519
Capturing thin structures in VOF simulations with two-plane reconstruction
- 14 August 2024
- Published by Elsevier in International Journal of Multiphase Flow
- Vol. 180
Subgrid scale modeling of droplet bag breakup in VOF simulations
- 14 August 2024
- Published by Elsevier in International Journal of Multiphase Flow
- Vol. 180
Subgrid scale modeling of droplet bag breakup in VOF simulations
- 16 February 2024
- Published by Elsevier in International Journal of Multiphase Flow
- Vol. 174
Comparison of methods for curvature estimation from volume fractions
- 16 February 2024
- Published by Elsevier in International Journal of Multiphase Flow
- Vol. 174
Comparison of methods for curvature estimation from volume fractions
- 21 September 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 45 (5) , A2250-A2274
First Moments of a Polyhedron Clipped by a Paraboloid
We provide closed-form expressions for the first moments (i.e., the volume and volume-weighted centroid) of a polyhedron clipped by a paraboloid, that is, of a polyhedron intersected with the subset of the three-dimensional real space located on one side of a paraboloid. These closed-form expressions are derived following successive applications of the divergence theorem and the judicious parametrization of the intersection of the polyhedron’s faces with the paraboloid. We provide means for identifying ambiguous discrete intersection topologies, and propose a corrective procedure for preventing their occurence. Finally, we put our proposed closed-form expressions and numerical approach to the test with millions of random and manually engineered polyhedron/paraboloid intersection configurations. The results of these tests show that we are able to provide robust machine-accurate estimates of the first moments at a computational cost that is within one order of magnitude of that of state-of-the-art half-space clipping algorithms. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: code and data available”, as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at IRL , step-by-step guide , 8e77b35 . [Formula: see text]
- 21 September 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 45 (5) , A2250-A2274
First Moments of a Polyhedron Clipped by a Paraboloid
We provide closed-form expressions for the first moments (i.e., the volume and volume-weighted centroid) of a polyhedron clipped by a paraboloid, that is, of a polyhedron intersected with the subset of the three-dimensional real space located on one side of a paraboloid. These closed-form expressions are derived following successive applications of the divergence theorem and the judicious parametrization of the intersection of the polyhedron’s faces with the paraboloid. We provide means for identifying ambiguous discrete intersection topologies, and propose a corrective procedure for preventing their occurence. Finally, we put our proposed closed-form expressions and numerical approach to the test with millions of random and manually engineered polyhedron/paraboloid intersection configurations. The results of these tests show that we are able to provide robust machine-accurate estimates of the first moments at a computational cost that is within one order of magnitude of that of state-of-the-art half-space clipping algorithms. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: code and data available”, as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at IRL , step-by-step guide , 8e77b35 . [Formula: see text]