Benjamin Raichel

activity

20112026

most citedFast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

11 citations · 49 across the 23 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.CG2026

Computing Planar Convex Hulls with a Promise

Sepideh Aghamolaei, Kevin Buchin, Timothy M. Chan +5

Computing the convex hull of a planar $n$ -point set $P$ is one of the most fundamental problems in computational geometry. It has an $Ω (n lo g n)$ lower bound in the algebraic comp…

cs.DS2026

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps

Maarten Löffler, Benjamin Raichel

In the preprocessing framework for dealing with uncertain data, one is given a set of regions that one is allowed to preprocess to create some auxiliary structure such that when a…