Uploaded October 2026 | Updated November 2026, 3 days ago
DGGS.jl: Discrete Global Grid System Native Data Cubes by Daniel Loos
PreTalx: pretalx.com/juliacon-2026/talk/NEXMM8
flyer-NEXMM8: pretalx.com/media/juliacon-2026/submissions/NEXMM8/resources/NEXMM8_px2cuPU.png
Discrete Global Grid Systems (DGGS) allow minimizing spatial distortions in geospatial image processing, among others. Here we present DGGS.jl, a Julia package to work with DGGS native data cubes using Zarr.jl and YAXArrays.jl. It transforms any raster image from a traditional projection into memory-efficient N-dimensional arrays, following one unified global coordinate system without overlapping tiles, e.g., for bounding box queries, spatial aggregation, or visualization in QGIS.
Discrete Global Grid Systems (DGGS) tessellate the earth’s surface into zones of equal area and very similar shape, minimizing spatial distortions in geospatial data processing. DGGS are not only used for geocoding but also offer a highly efficient data structure by eliminating tile overlap compared to traditional grids like UTM used in many satellite missions.
The performance of operations on DGGS native data cubes is intrinsically linked to the cell index. Many real-world applications, such as visualization or convolutions, require efficient handling of higher-order neighbor queries based on spatial distances, motivating a multidimensional spatial index as coordinates in the n-dimensional array.
In response to these challenges, we introduce DGGS.jl (danlooo.github.io/DGGS.jl), a Julia package specifically developed to create and utilize DGGS native data cubes optimized for neighbor queries. Our package employs the DGGRID Q2DI index to store data on a grid based on the Icosahedral Snyder Equal Area projection, enabling compact and efficient data cube arrays. We have implemented methods to seamlessly convert raster data between geographic and Q2DI coordinates, access neighbor disks around a given cell, and visualize these data on a global scale. In addition, we developed an XYZ tile server, allowing us to view DGGS native data cubes in QGIS and in the browser. Finally, we applied DGGS.jl on a subset of the Sentinel-2 archive.
DGGS.jl: Discrete Global Grid System Native Data Cubes by Daniel Loos
PreTalx: pretalx.com/juliacon-2026/talk/NEXMM8
flyer-NEXMM8: pretalx.com/media/juliacon-2026/submissions/NEXMM8/resources/NEXMM8_px2cuPU.png
Discrete Global Grid Systems (DGGS) allow minimizing spatial distortions in geospatial image processing, among others. Here we present DGGS.jl, a Julia package to work with DGGS native data cubes using Zarr.jl and YAXArrays.jl. It transforms any raster image from a traditional projection into memory-efficient N-dimensional arrays, following one unified global coordinate system without overlapping tiles, e.g., for bounding box queries, spatial aggregation, or visualization in QGIS.
Discrete Global Grid Systems (DGGS) tessellate the earth’s surface into zones of equal area and very similar shape, minimizing spatial distortions in geospatial data processing. DGGS are not only used for geocoding but also offer a highly efficient data structure by eliminating tile overlap compared to traditional grids like UTM used in many satellite missions.
The performance of operations on DGGS native data cubes is intrinsically linked to the cell index. Many real-world applications, such as visualization or convolutions, require efficient handling of higher-order neighbor queries based on spatial distances, motivating a multidimensional spatial index as coordinates in the n-dimensional array.
In response to these challenges, we introduce DGGS.jl (danlooo.github.io/DGGS.jl), a Julia package specifically developed to create and utilize DGGS native data cubes optimized for neighbor queries. Our package employs the DGGRID Q2DI index to store data on a grid based on the Icosahedral Snyder Equal Area projection, enabling compact and efficient data cube arrays. We have implemented methods to seamlessly convert raster data between geographic and Q2DI coordinates, access neighbor disks around a given cell, and visualize these data on a global scale. In addition, we developed an XYZ tile server, allowing us to view DGGS native data cubes in QGIS and in the browser. Finally, we applied DGGS.jl on a subset of the Sentinel-2 archive.




- Provides a growing collection of benchmark combinatorial decision problems.
- Includes all necessary components to build and train a DFL policy for each problem.
- Offers a general interface for defining custom problems.
- Facilitates reproducibility and experimentation by allowing the same algorithm to be applied across multiple benchmarks with minimal changes.
- [`DecisionFocusedLearningAlgorithms.jl`](https://github.com/JuliaDecisionFocusedLearning/DecisionFocusedLearningAlgorithms.jl)
- Implements generic versions of state-of-the-art DFL training algorithms.
- Provides compatibility with problems defined through the benchmarks interface.
- While some classical DFL approaches can be implemented directly using the lower-level tools provided by InferOpt.jl, recent state-of-the-art methods have become increasingly complex. This package introduces higher-level implementations to make these advanced algorithms accessible without requiring users to master the technical details.
The goal of the talk is to demonstrate how users can leverage these packages to define a problem, select a training strategy, and train a policy for their own problem in a few lines of code, without necessarily needing deep expertise in DFL. JuliaDecisionFocusedLearning: A Practical Introduction to Decision-Focused Learning in Julia | Baty](https://i.ytimg.com/vi/g2XFyvBmsz0/mqdefault.jpg)

 is a fully Julia-based idealized atmospheric flow solver, primarily developed for gravity wave research. The model is highly efficient and integrates the Boussinesq, pseudo-incompressible, and compressible equations over arbitrary topography. Either high-resolution, wave-resolving simulations can be conducted, or simulations with parameterized gravity waves using the parameterization scheme MS-GWaM, where both transience and horizontal propagation of gravity waves are accounted for.
[PinCFlow.jl](https://github.com/Atmospheric-Dynamics-GUF/PinCFlow.jl) (Pseudo-inCompressible Flow solver), developed for conducting idealized atmospheric simulations, integrates the Boussinesq, pseudo-incompressible, and compressible equations using a finite volume approach and a semi-implicit time-stepping scheme. Due to MPI parallelization in all spatial dimensions, high-resolution, wave-resolving simulations can be conducted efficiently. The use of a terrain-following coordinate system allows for arbitrary surface topography.
A unique feature of [PinCFlow.jl](https://github.com/Atmospheric-Dynamics-GUF/PinCFlow.jl) is its numerical realization of multiple-scale WKB theory for the parameterization of gravity-wave impacts on mean-flow dynamics using MS-GWaM (Multi-Scale Gravity-Wave Model). Here, gravity waves are approximated using a ray-tracing technique, where so-called ray volumes propagate through a six-dimensional phase-space. Unlike conventional single-column, steady-state parameterizations, MS-GWaM accounts for wave transience and horizontal propagation.
Current research and development focuses on the generation of orographic gravity waves, the interaction between gravity waves and turbulence, and their impact on ice cloud formation and tracer transport.
Originally developed in Fortran 90, the solver has been fully translated and optimized as a Julia package. Now officially registered and accompanied by extensive documentation, [PinCFlow.jl](https://github.com/Atmospheric-Dynamics-GUF/PinCFlow.jl) provides a modern, high-performance framework for research in computational fluid dynamics. Idealized Atmospheric Flow and Gravity-Wave Modeling with PinCFlow.jl | Steiger](https://i.ytimg.com/vi/h6SKj25kL6w/mqdefault.jpg)




