activity
20132019
most citedVoroCrust: Voronoi Meshing Without Clipping

44 citations · 83 across the 4 of their papers we have counts for

collaborators

5 papers

cs.GR2019★ 44 cited

VoroCrust: Voronoi Meshing Without Clipping

Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida +4

Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust poly…

cs.CG2018

Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm

Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida +4

We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled so…

stat.CO2017★ 1 cited

Surrogate-based Ensemble Grouping Strategies for Embedded Sampling-based Uncertainty Quantification

Marta D'Elia, Eric Phipps, Ahmad Rushdi +1

The embedded ensemble propagation approach introduced in [49] has been demonstrated to be a powerful means of reducing the computational cost of sampling-based uncertainty quantifi…

cs.GR2014★ 24 cited

Spoke-Darts for High-Dimensional Blue-Noise Sampling

Scott A. Mitchell, Mohamed S. Ebeida, Muhammad A. Awad +6

Blue noise sampling has proved useful for many graphics applications, but remains underexplored in high-dimensional spaces due to the difficulty of generating distributions and pro…

cs.GR2013★ 14 cited

k-d Darts: Sampling by k-Dimensional Flat Searches

Mohamed S. Ebeida, Anjul Patney, Scott A. Mitchell +3

We formalize the notion of sampling a function using k-d darts. A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats. Each dart has d c…