12 citations · 15 across the 9 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2014
How to Walk Your Dog in the Mountains with No Magic Leash
Sariel Har-Peled, Amir Nayyeri, Mohammad Salavatipour +1
We describe a -approximation algorithm for computing the homotopic \Frechet distance between two polygonal curves that lie on the boundary of a triangulated topological…
cs.CG2009★ 12 cited
A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Imran A. Pirwani, Mohammad R. Salavatipour
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor ap…