M. Horton

collaborators

3 papers

cs.CG2020

On beta-Plurality Points in Spatial Voting Games

Boris Aronov, Mark de Berg, Joachim Gudmundsson +1

Let $V$ be a set of $n$ points in $R^{d}$ , called voters. A point $p \in R^{d}$ is a plurality point for $V$ when the following holds: for every $q \in R^{d}$ the…

cs.CG2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

Boris Aronov, Omrit Filtser, Michael Horton +2

We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $C$ be a set of $n$ polygonal curves,…

cs.CG2018

Approximating $(k, ℓ)$ -center clustering for curves

Kevin Buchin, Anne Driemel, Joachim Gudmundsson +4

The Euclidean $k$ -center problem is a classical problem that has been extensively studied in computer science. Given a set $G$ of $n$ points in Euclidean space, the probl…

On beta-Plurality Points in Spatial Voting Games

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

Approximating (k,ℓ)-center clustering for curves

Approximating $(k, ℓ)$ -center clustering for curves