2 citations · 3 across the 2 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2014★ 1 cited
Space Exploration via Proximity Search
Sariel Har-Peled, Nirman Kumar, David M. Mount +1
We investigate what computational tasks can be performed on a point set in , if we are only given black-box access to it via nearest-neighbor search. This is a reasonable as…
cs.CG2012★ 2 cited
Fréchet Distance Revisited and Extended
Sariel Har-Peled, Benjamin Raichel
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fréchet dis…