1 paper
Ivor van der Hoog, André Nusser, Eva Rotenberg +1
A classical problem in computational geometry and graph algorithms is: given a dynamic set S of geometric shapes in the plane, efficiently maintain the connectivity of the intersec…