1 citations · 2 across the 15 of their papers we have counts for
6 papers · 1 filter
Simulated Annealing for Antenna Placements
Mikkel Abrahamsen, Jacobus Conradi, Asbjørn Lind
The 2026 ACM SIGSPATIAL GIS Cup posed the following geometric challenge: Given a set of simple, pair-wise disjoint polygons, compute antennas (points) on polygon boundaries, ma…
A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
Sarita de Berg, Jacobus Conradi, Peter Kramer +2
The dilation of a geometric graph measures how much longer the path between pairs of points becomes when restricted to graph edges, rather than following the direct path through th…
Computing All Optimal Partial -Wasserstein Matchings on the Line
Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5
For , the -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…
Computing Planar Convex Hulls with a Promise
Sepideh Aghamolaei, Kevin Buchin, Timothy M. Chan +5
Computing the convex hull of a planar -point set is one of the most fundamental problems in computational geometry. It has an lower bound in the algebraic comp…
Tight Fréchet bounds for -low density curves
Jacobus Conradi, Ivor van der Hoog, Frederikke Uldahl +1
The Fréchet distance is a well-studied similarity measure between curves. We computing the Fréchet distance between -low-density curves, the most general of realistic curve assu…
On Small Pair Decompositions for Point Sets
Kevin Buchin, Jacobus Conradi, Sariel Har-Peled +5
$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algo…