Publications with Sariel Har-Peled
Approximate greedy clustering and distance selection for graph metrics.
D. Eppstein,
S. Har-Peled, and
A. Sidiropoulos.
arXiv:1507.01555.
J. Computational Geometry 11 (1): 629–652, 2020, doi:10.20382/jocg.v11i1a25.
We provide fast approximation algorithms for the farthest-first traversal of graph metrics.
Grid peeling and the affine curve-shortening flow.
D. Eppstein,
S. Har-Peled, and
G. Nivasch.
arXiv:1710.03960.
Proc. Algorithm
Engineering & Experiments (ALENEX 2018),
New Orleans, 2018, pp. 109–116, doi:10.1137/1.9781611975055.10.
Experimental Mathematics 29 (3): 306–316, 2020, doi:10.1080/10586458.2018.1466379.
We conjecture, based on experiments, that approximating a convex shape by the set of grid points inside it, for a fine enough grid, and then finding the convex layers of the resulting point set, produces curves that are close to those produced by affine curve-shortening, a continuous process on smooth curves.