G. Klimenko

collaborators

2 papers

cs.CG2021

Fast and Exact Convex Hull Simplification

Georgiy Klimenko, Benjamin Raichel

Given a point set $P$ in the plane, we seek a subset $Q \subseteq P$ , whose convex hull gives a smaller and thus simpler representation of the convex hull of $P$ . Specifically, let…

cs.CG2021

Clustering with Neighborhoods

Hongyao Huang, Georgiy Klimenko, Benjamin Raichel

In the standard planar $k$ -center clustering problem, one is given a set $P$ of $n$ points in the plane, and the goal is to select $k$ center points, so as to minimize the maximum…