The kn-treap is a straightforward extension of the k2-treap to manage multiple dimensions.
The k3-tree is a compact data structure to represent a 3-dimensional binary matrix.
Implementation of DJQs (namely KCPQ and epsilon-DJQ over k2-trees
k2-raster - A compacta data structure for raster data
An open source route planning library and server using OpenStreetMap.
Template for creating a Compact Data Structure project using SDSL library.