4 papers
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…
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…
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…
Comparing Parallel Functional Array Languages: Programming and Performance
David van Balen, Tiziano De Matteis, Clemens Grelck +12
Parallel functional array languages are an emerging class of programming languages that promise to combine low-effort parallel programming with good performance and performance por…