3 papers
cs.CG2026
Engineering Fully Dynamic Convex Hulls
Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg
We present a new fully dynamic algorithm for maintaining convex hulls under insertions and deletions while supporting geometric queries. Our approach combines the logarithmic metho…
cs.CG2025
Practical Insertion-Only Convex Hull
Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg
Convex hull data structures are fundamental in computational geometry. We study insertion-only data structures, supporting various containment and intersection queries. When is…
cs.DS2024
Engineering Edge Orientation Algorithms
H. Reinstädtler, C. Schulz, B. Uçar
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out deg…