Mark de Berg

This article presents a novel way to study geodesic disks and their intersections.

This study introduces methods to enhance furthest-neighbor queries in simple polygons.

Discover how algorithms maintain coverage with minimal changes in dynamic environments.

A deep dive into dynamic graphs and algorithms for managing sets.