uxarray.grid.intersections.gca_gca_intersection

uxarray.grid.intersections.gca_gca_intersection(gca_a_xyz, gca_b_xyz)

Return the intersection points of two great-circle arcs.

Dispatcher / convenience API. Calls the batch/status layer and packages results into UXarray’s existing array-returning API. Coplanar/shared-endpoint handling lives here, outside the numerical core.

Parameters:

• gca_a_xyz (iterable of 2 length-3 iterables) – First great-circle arc as two Cartesian endpoints. (If numpy array, has shape (2,3). If tuple, contains two length-3 tuples.)

• gca_b_xyz (iterable of 2 length-3 iterables) – Second great-circle arc as two Cartesian endpoints. (If numpy array, has shape (2,3). If tuple, contains two length-3 tuples.)

Returns:

intersections – The (x,y,z) coordinates of the intersections, filling with NaNs as needed. E.g. if there is one intersection, returns ((x1,y1,z1) (nan,nan,nan)).

Return type:

tuple of 2 length-3 tuples

References

Chen, H., Ullrich, P. A., Panetta, J., Marsico, D., Hanke, M., Jain, R., Zhang, C., and Jacob, R. L. (2026). Accurate and robust geometric algorithms for regridding on the sphere. Geoscientific Model Development, 19(14), 6545-6570. https://doi.org/10.5194/gmd-19-6545-2026

Chen, H., Ullrich, P. A., and Panetta, J. (2026). Fast and accurate intersections on a sphere. SIAM Journal on Scientific Computing, 48(2), B208-B232. https://doi.org/10.1137/25M1737614