3 papers
cs.CG2026
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…
cs.CG2025
Algorithms for Distance Problems in Continuous Graphs
Sergio Cabello, Delia Garijo, Antonia Kalb +3
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices,…
cs.CG2024
Computing Oriented Spanners and their Dilation
Kevin Buchin, Antonia Kalb, Anil Maheshwari +4
Given a point set in a metric space and a real number , an \emph{oriented -spanner} is an oriented graph , where for eve…