Here we list a selection of projects we are currently involved with:
Given a set of prioritized balls with fixed centers in Rd whose radii grow linearly over time, we want to compute the elimination order of these balls assuming that when two balls touch, the one with lower priority is ’crushed’.
A library to compute a constrained delaunay triangulation on the sphere. It also supports the calculation of intersection points of constrained edges.
This library snapps points that are ε-close to the sphere to rational points that are no more than 2ε away from their closest point on the sphere.
A spatio-textual search engine for OpenStreetMap data.