Hee-Kap Ahn

collaborators

4 papers

math.CO2026

Diameter and Length of Metric Graphs

Hee-Kap Ahn, Sergio Cabello, Otfried Cheong +2

A metric graph is a metric space obtained from a finite collection of intervals whose endpoints are identified in groups. It can also be seen as a finite, edge-weighted graph where…

cs.CG2026

Near-Optimal Bounds for Parameterized Euclidean k-means

Vincent Cohen-Addad, Karthik C. S., David Saulpic +1

The $k$ -means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find $k$ representative points so as…

cs.CG2026

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics

An La, Hung Le, Shay Solomon +4

It is known that any $n$ -point set in the $d$ -dimensional Euclidean space $R^{d}$ , for $d = O (1)$ , admits: 1) a $(1 + I^µ)$ -spanner with maximum degree $O ~ (I^µ^{- d + 1})$ a…

cs.CG2025

Guarding Terrains with Guards on a Line

Byeonguk Kang, Hwi Kim, Hee-Kap Ahn

Given an $x$ -monotone polygonal chain $T$ with $n$ vertices, and an integer $k$ , we consider the problem of finding the lowest horizontal line $L$ lying above $T$ with $k$ point gu…