3 papers
cs.CG2026
Simplified Algorithms and Improved Bounds for Motion Planning
Sarita de Berg, Joachim Gudmundsson, Peter Kramer +2
We investigate coordinated motion planning (CMP) for unit square robots in the plane under the metric. Given two arrangements of robots, we seek a movement schedule minim…
cs.CG2025
Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
Sarita de Berg, Emil Toftegaard Gæde, Ivor van der Hoog +2
Range reporting is a classical problem in computational geometry. A (rectangular) reporting data structure stores a point set , such that, given a (rectangular) query region …
cs.CG2025
Instance-Optimal Imprecise Convex Hull
Sarita de Berg, Ivor van der Hoog, Eva Rotenberg +2
Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retri…