activity
20192026
most citedSmoothed Analysis of Order Types

6 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing 2025Show all

7 papers · 1 filter

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.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

Computing the Fréchet Distance When Just One Curve is -Packed: A Simple Almost-Tight Algorithm

Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst +1

We study approximating the continuous Fréchet distance of two curves with complexity and , under the assumption that only one of the two curves is -packed. Driemel, Har{-…

cs.CG2025

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull

Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann

For a planar point set , its convex hull is the smallest convex polygon that encloses all points in . The construction of the convex hull from an array containing i…

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…

cs.CG2025

Efficient Greedy Discrete Subtrajectory Clustering

Ivor van der Hoog, Lara Ost, Eva Rotenberg +1

We cluster a set of trajectories T using subtrajectories of T. Clustering quality may be measured by the number of clusters, the number of vertices of T that are absent from the cl…

cs.CG2025

Dynamic Indexing Through Learned Indices with Worst-case Guarantees

Emil Toftegaard Gæde, Ivor van der Hoog, Eva Rotenberg +1

Indexing data is a fundamental problem in computer science. Recently, various papers apply machine learning to this problem. For a fixed integer , a \emph{learned inde…