Explore projects

Solving the problem of finding a minimal partition of a geometric graph into plane subgraphs. Problem given at the Fourth Computational Geometry Challenge, as part of CG Week in Berlin.

Oui

Création d'un labyrinthe en Java via Union-Find