Showing cs.CGShow all
3 papers · 1 filter
cs.CG2025
A Couple of Simple Algorithms for -Dispersion
Ke Chen, Adrian Dumitrescu
Given a set of points in , and a positive integer , the -dispersion problem is that of selecting of the given points so that the minimum inte…
cs.CG2019
On the Stretch Factor of Polygonal Chains
Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer +1
Let be a polygonal chain in . The stretch factor of is the ratio between the total length of and the distance of its endpoints, $\s…
cs.CG2017
On the Longest Spanning Tree with Neighborhoods
Ke Chen, Adrian Dumitrescu
We study a maximization problem for geometric network design. Given a set of compact neighborhoods in , select a point in each neighborhood, so that the longest s…