3 papers
cs.CG2025
Quickhull is Usually Forward Stable
Thomas Koopman, Sven-Bodo Scholz
Quickhull is an algorithm for computing the convex hull of points in a plane that performs well in practice, but has poor complexity on adversarial input. In this paper we show the…
cs.CG2025
VQhull: a Fast Planar Quickhull
Thomas Koopman, Jordy Aaldering, Bernard van Gastel +1
Finding the convex hull is a fundamental problem in computational geometry. Quickhull is a fast algorithm for finding convex hulls. In this paper, we present VQhull, a fast paralle…
math.CT2025
Category Theory for Supercomputing: The Tensor Product of Linear BSP Algorithms
Thomas Koopman, Rob H. Bisseling, Sven-Bodo Scholz
We show that a particular class of parallel algorithm for linear functions can be straightforwardly generalized to a parallel algorithm of their tensor product. The central idea is…