Mohamed S. Ebeida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohamed S. Ebeida has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Scott A. Mitchell
6 shared publicationsAhmad A. Rushdi
5 shared publicationsAhmed H. Mahmoud
4 shared publicationsJohn D. Owens
4 shared publicationsAhmed Abdelkader
2 shared publications- Chandrajit Bajaj
Department of Computer Science, Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX, USA
2 shared publications
Latest Publications
- Open Access
VoroCrust: Voronoi Meshing Without Clipping
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
Open AccessVoroCrust: Voronoi Meshing Without Clipping
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
- Open Access
- 13 May 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 39 (3) , 1-16
VoroCrust
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface, circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
- 13 May 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 39 (3) , 1-16
Open AccessVoroCrust
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface, circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
- 14 August 2017
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (5) , 189-201
A Constrained Resampling Strategy for Mesh Improvement
In many geometry processing applications, it is required to improve an initial mesh in terms of multiple quality objectives. Despite the availability of several mesh generation algorithms with provable guarantees, such generated meshes may only satisfy a subset of the objectives. The conflicting nature of such objectives makes it challenging to establish similar guarantees for each combination, e.g., angle bounds and vertex count. In this paper, we describe a versatile strategy for mesh improvement by interpreting quality objectives as spatial constraints on resampling and develop a toolbox of local operators to improve the mesh while preserving desirable properties. Our strategy judiciously combines smoothing and transformation techniques allowing increased flexibility to practically achieve multiple objectives simultaneously. We apply our strategy to both planar and surface meshes demonstrating how to simplify Delaunay meshes while preserving element quality, eliminate all obtuse angles in a complex mesh, and maximize the shortest edge length in a Voronoi tessellation far better than the state‐of‐the‐art.
- 14 August 2017
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (5) , 189-201
A Constrained Resampling Strategy for Mesh Improvement
In many geometry processing applications, it is required to improve an initial mesh in terms of multiple quality objectives. Despite the availability of several mesh generation algorithms with provable guarantees, such generated meshes may only satisfy a subset of the objectives. The conflicting nature of such objectives makes it challenging to establish similar guarantees for each combination, e.g., angle bounds and vertex count. In this paper, we describe a versatile strategy for mesh improvement by interpreting quality objectives as spatial constraints on resampling and develop a toolbox of local operators to improve the mesh while preserving desirable properties. Our strategy judiciously combines smoothing and transformation techniques allowing increased flexibility to practically achieve multiple objectives simultaneously. We apply our strategy to both planar and surface meshes demonstrating how to simplify Delaunay meshes while preserving element quality, eliminate all obtuse angles in a complex mesh, and maximize the shortest edge length in a Voronoi tessellation far better than the state‐of‐the‐art.
- Open Access
Surrogate-based Ensemble Grouping Strategies for Embedded Sampling-based Uncertainty Quantification
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 quantification methods, particularly on emerging computational architectures. A substantial challenge with this method however is ensemble-divergence, whereby different samples within an ensemble choose different code paths. This can reduce the effectiveness of the method and increase computational cost. Therefore grouping samples together to minimize this divergence is paramount in making the method effective for challenging computational simulations. In this work, a new grouping approach based on a surrogate for computational cost built up during the uncertainty propagation is developed and applied to model diffusion problems where computational cost is driven by the number of (preconditioned) linear solver iterations. The approach is developed within the context of locally adaptive stochastic collocation methods, where a surrogate for the number of linear solver iterations, generated from previous levels of the adaptive grid generation, is used to predict iterations for subsequent samples, and group them based on similar numbers of iterations. The effectiveness of the method is demonstrated by applying it to highly anisotropic diffusion problems with a wide variation in solver iterations from sample to sample. It extends the parameter-based grouping approach developed in [17] to more general problems without requiring detailed knowledge of how the uncertain parameters affect the simulation's cost, and is also less intrusive to the simulation code.
Open AccessSurrogate-based Ensemble Grouping Strategies for Embedded Sampling-based Uncertainty Quantification
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 quantification methods, particularly on emerging computational architectures. A substantial challenge with this method however is ensemble-divergence, whereby different samples within an ensemble choose different code paths. This can reduce the effectiveness of the method and increase computational cost. Therefore grouping samples together to minimize this divergence is paramount in making the method effective for challenging computational simulations. In this work, a new grouping approach based on a surrogate for computational cost built up during the uncertainty propagation is developed and applied to model diffusion problems where computational cost is driven by the number of (preconditioned) linear solver iterations. The approach is developed within the context of locally adaptive stochastic collocation methods, where a surrogate for the number of linear solver iterations, generated from previous levels of the adaptive grid generation, is used to predict iterations for subsequent samples, and group them based on similar numbers of iterations. The effectiveness of the method is demonstrated by applying it to highly anisotropic diffusion problems with a wide variation in solver iterations from sample to sample. It extends the parameter-based grouping approach developed in [17] to more general problems without requiring detailed knowledge of how the uncertain parameters affect the simulation's cost, and is also less intrusive to the simulation code.
- Open Access
- 23 November 2016
- Published by Elsevier in Procedia Engineering
- Vol. 163, 251-261
All-Hex Meshing of Multiple-Region Domains without Cleanup
- 23 November 2016
- Published by Elsevier in Procedia Engineering
- Vol. 163, 251-261
Open AccessAll-Hex Meshing of Multiple-Region Domains without Cleanup
- Open Access
- 3 November 2015
- Published by Elsevier in Procedia Engineering
- Vol. 124, 96-108
Robust All-quad Meshing of Domains with Connected Regions
- 3 November 2015
- Published by Elsevier in Procedia Engineering
- Vol. 124, 96-108
Open AccessRobust All-quad Meshing of Domains with Connected Regions
- 3 November 2014
- Published by Springer Nature
- p. 221-238
Exercises in High-Dimensional Sampling: Maximal Poisson-Disk Sampling and k-d Darts
- 3 November 2014
- Published by Springer Nature
- p. 221-238
Exercises in High-Dimensional Sampling: Maximal Poisson-Disk Sampling and k-d Darts
- 3 May 2011
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 88 (10) , 974-985
Isotropic conforming refinement of quadrilateral and hexahedral meshes using two‐refinement templates
This paper presents three automated algorithms for isotropic, conforming refinement of all‐quadrilateral and all‐hexahedral meshes. These algorithms are based on the two‐refinement templates introduced by Schneiders. However, we introduce a novel technique to choose the appropriate refinement template locally. This enables efficient implementation of the proposed algorithms, even in parallel. The proposed algorithms can handle refined regions of complicated geometry and do not suffer from concavity restrictions associated with the three‐refinement methods currently dominating the literature. Several application examples show the strength of these new algorithms in problems that require fast dynamic remeshing such as computational fluid dynamics and computer graphics. Copyright © 2011 John Wiley & Sons, Ltd.
- 3 May 2011
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 88 (10) , 974-985
Isotropic conforming refinement of quadrilateral and hexahedral meshes using two‐refinement templates
This paper presents three automated algorithms for isotropic, conforming refinement of all‐quadrilateral and all‐hexahedral meshes. These algorithms are based on the two‐refinement templates introduced by Schneiders. However, we introduce a novel technique to choose the appropriate refinement template locally. This enables efficient implementation of the proposed algorithms, even in parallel. The proposed algorithms can handle refined regions of complicated geometry and do not suffer from concavity restrictions associated with the three‐refinement methods currently dominating the literature. Several application examples show the strength of these new algorithms in problems that require fast dynamic remeshing such as computational fluid dynamics and computer graphics. Copyright © 2011 John Wiley & Sons, Ltd.
- 1 January 2010
- Published by Springer Nature
- p. 23-34
Q-TRAN: A New Approach to Transform Triangular Meshes into Quadrilateral Meshes Locally
- 1 January 2010
- Published by Springer Nature
- p. 23-34
Q-TRAN: A New Approach to Transform Triangular Meshes into Quadrilateral Meshes Locally