Hongyu Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hongyu Chen has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Paul Aaron Ullrich
University of California, Davis
8 shared publications - Robert Jacob
Argonne National Laboratory, Lemont, IL, USA
8 shared publications Chengzhu Zhang
Physical and Life Sciences Directorate, Lawrence Livermore National Laboratory, Livermore, CA, USA
7 shared publicationsDavid Marsico
NOAA Physical Sciences Laboratory, Boulder, CO, USA
7 shared publicationsJulian Panetta
Department of Computer Science, University of California, Davis, Davis, CA, USA
7 shared publicationsMoritz Hanke
Application Support, Deutsches Klimarechenzentrum, Hamburg, Germany
7 shared publications
Latest Publications
- Open Access
- 21 July 2026
- Published by Copernicus GmbH in Geoscientific Model Development
- Vol. 19 (14) , 6545-6570
Accurate and robust geometric algorithms for regridding on the sphere
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error-Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 21 July 2026
- Published by Copernicus GmbH in Geoscientific Model Development
- Vol. 19 (14) , 6545-6570
Open AccessAccurate and robust geometric algorithms for regridding on the sphere
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error-Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- Open Access
- 18 May 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Reply on RC2
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 18 May 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Open AccessReply on RC2
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- Open Access
- 18 May 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Reply on RC1
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 18 May 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Open AccessReply on RC1
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- Open Access
- 22 April 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Comment on egusphere-2026-636
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 22 April 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Open AccessComment on egusphere-2026-636
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 10 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (2) , B208-B232
Fast and Accurate Intersections on a Sphere
We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. We demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed. 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 https://github.com/hongyuchen1030/accurate-operator-reproducibility/tree/main and in the supplementary materials ( M173761_Supplementary_Materials_1.pdf [265KB], accurate-operator-reproducibility-main.zip [199KB]). [Formula: see text]
- 10 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (2) , B208-B232
Fast and Accurate Intersections on a Sphere
We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. We demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed. 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 https://github.com/hongyuchen1030/accurate-operator-reproducibility/tree/main and in the supplementary materials ( M173761_Supplementary_Materials_1.pdf [265KB], accurate-operator-reproducibility-main.zip [199KB]). [Formula: see text]
- Open Access
- 25 March 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Comment on egusphere-2026-636
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 25 March 2026
- Published by Copernicus GmbH
- Vol. 2026, 1-40
Open AccessComment on egusphere-2026-636
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- Open Access
- 14 March 2026
- Published by Copernicus GmbH
UXarray: A Python package for the analysis of kilometer-scale atmosphere and ocean model outputs
UXarray is a community-developed Python package that extends the widely used Xarray ecosystem with native support for horizontally unstructured meshes, eliminating the need for costly, problematic regridding prior to visualization and analysis. Designed to meet the growing demands of kilometer-scale climate and weather models, UXarray aims to become a preeminent tool for the analysis, visualization, and postprocessing of Earth system data on irregular grids. It has been used in practice across a wide range of high-resolution atmospheric and ocean models, including MPAS, CAM-SE, E3SM, FESOM2, IFS, and ICON.Recently, UXarray played a key role in the 2025 WCRP Digital Earth – Global Hackathon (DEGH), where over 600 researchers, spanning four continents, collaborated to explore km-scale outputs, contributed from 11 different modeling centers from around the world. The use of UXarray was essential to fulfilling hackathon objectives, such as promoting global collaboration, sharing best-practice in process-based analysis of km-scale simulations, developing practical km-scale analysis workflows, and facilitating model intercomparison.This presentation will highlight UXarray’s current capabilities—including visualization tools and foundational analysis operators—share insights from the DEGH experience, outline future development plans, and highlight ways that the community can engage to shape the package moving forward.
- 14 March 2026
- Published by Copernicus GmbH
Open AccessUXarray: A Python package for the analysis of kilometer-scale atmosphere and ocean model outputs
UXarray is a community-developed Python package that extends the widely used Xarray ecosystem with native support for horizontally unstructured meshes, eliminating the need for costly, problematic regridding prior to visualization and analysis. Designed to meet the growing demands of kilometer-scale climate and weather models, UXarray aims to become a preeminent tool for the analysis, visualization, and postprocessing of Earth system data on irregular grids. It has been used in practice across a wide range of high-resolution atmospheric and ocean models, including MPAS, CAM-SE, E3SM, FESOM2, IFS, and ICON.Recently, UXarray played a key role in the 2025 WCRP Digital Earth – Global Hackathon (DEGH), where over 600 researchers, spanning four continents, collaborated to explore km-scale outputs, contributed from 11 different modeling centers from around the world. The use of UXarray was essential to fulfilling hackathon objectives, such as promoting global collaboration, sharing best-practice in process-based analysis of km-scale simulations, developing practical km-scale analysis workflows, and facilitating model intercomparison.This presentation will highlight UXarray’s current capabilities—including visualization tools and foundational analysis operators—share insights from the DEGH experience, outline future development plans, and highlight ways that the community can engage to shape the package moving forward.
- Open Access
- 18 February 2026
- Published by Copernicus GmbH
Supplementary material to "Accurate and Robust Geometric Algorithms for Regridding on the Sphere"
- 18 February 2026
- Published by Copernicus GmbH
Open AccessSupplementary material to "Accurate and Robust Geometric Algorithms for Regridding on the Sphere"
- Open Access
- 18 February 2026
- Published by Copernicus GmbH in EGUsphere
- Vol. 2026, 1-40
Accurate and Robust Geometric Algorithms for Regridding on the Sphere
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 18 February 2026
- Published by Copernicus GmbH in EGUsphere
- Vol. 2026, 1-40
Open AccessAccurate and Robust Geometric Algorithms for Regridding on the Sphere
Regridding is one of the most common operations in geoscientific modeling and data analysis. There are many types of regridding, each drawing from a common set of fundamental computational geometry algorithms. However, these algorithms are rarely documented together or systematically compared in a manner that elucidates their relative strengths and appropriate use. In particular, several recent studies have highlighted the importance of careful treatment of floating point operations in the implementation of these algorithms to ensure numerical robustness and stability. In this work, we organize non-conservative and conservative regridding operations end-to-end, from spatial indexing, great-circle and constant latitude geometry, and spherical predicates to spherical clipping, triangulation, and area calculation with constant latitude corrections, into a coherent set of geometric kernels on the sphere. When known, we present numerically stable floating-point formulas and characterize their error behavior. We also indicate where higher-precision techniques, such as Error Free Transformations, can be incorporated when additional accuracy is needed. The resulting framework establishes a practical and performance-portable baseline for accurate and robust regridding on the sphere.
- 9 February 2022
- Published by Elsevier in Atmospheric Environment
- Vol. 274
Emissions, chemistry or bidirectional surface transfer? Gas phase formic acid dynamics in the atmosphere
- 9 February 2022
- Published by Elsevier in Atmospheric Environment
- Vol. 274
Emissions, chemistry or bidirectional surface transfer? Gas phase formic acid dynamics in the atmosphere