CartoCrow
A suite of web applications which allows anyone to use our algorithms for cartographic visualization online. For computer scientists, the framework behind CartoCrow can be used to make other cartography algorithms available on the web.
The ALGO cluster wants to make its algorithmic research usable not only inside the algorithms community, but also outside it. To that end, we have created implementations of algorithms that can, in many cases, be used without in-depth knowledge about the algorithms themselves.
A suite of web applications which allows anyone to use our algorithms for cartographic visualization online. For computer scientists, the framework behind CartoCrow can be used to make other cartography algorithms available on the web.
GeometryCore is a Java library to quickly develop prototypes for geometric algorithms and tools. It has functionality for working with geometric objects in 2D, facilities for setting up a GUI, and methods for easily importing from and exporting to IPE.
An open-source library for computational movement analysis written in C++. In addition to standard trajectory-data operations (loading, transforming, etc.), the library specifically aims to provide implementations of advanced algorithmic techniques for working with and analyzing trajectories.
TTGA (Topological Tools for Geomorphological Analysis) is a tool which helps the analysis of river systems, in particular, braided rivers and estuaries. The focus of the tool is the computation of river networks from a digital elevation model (DEM) of the river bed.
A game that aims to teach players about rectangular cartograms, by allowing players to construct cartograms themselves.
A collection of medieval-styled games that are based on geometric concepts. These games are meant to make players familiar with and interested in basic geometric algorithms, and have also been used as an algorithm implementation project for students.
Implementation and demo videos of Gather&Compact, a novel algorithm to reconfigure modular robots formed by edge-connected squares.