17 citations · 32 across the 18 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CG2015★ 2 cited
Approximating the Simplicial Depth
Peyman Afshani, Donald R. Sheehy, Yannik Stein
Let be a set of points in -dimensions. The simplicial depth, of a point is the number of -simplices with vertices in that contain in their convex…
cs.DS2015★ 3 cited
Sorting and Permuting without Bank Conflicts on GPUs
Peyman Afshani, Nodari Sitchinava
In this paper, we look at the complexity of designing algorithms without any bank conflicts in the shared memory of Graphical Processing Units (GPUs). Given input of size , …
cs.CG2015
Instance Optimal Geometric Algorithms
Peyman Afshani, Jérémy Barbay, Timothy Chan
We prove the existence of an algorithm for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every sequence of points an…