default search action
Mohamed S. Ebeida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j12]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
VoroCrust: Voronoi Meshing Without Clipping. ACM Trans. Graph. 39(3): 23:1-23:16 (2020)
2010 – 2019
- 2019
- [i4]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
VoroCrust: Voronoi Meshing Without Clipping. CoRR abs/1902.08767 (2019) - 2018
- [j11]Scott A. Mitchell, Mohamed S. Ebeida, Muhammad A. Awad, Chonhyon Park, Anjul Patney, Ahmad A. Rushdi, Laura P. Swiler, Dinesh Manocha, Li-Yi Wei:
Spoke-Darts for High-Dimensional Blue-Noise Sampling. ACM Trans. Graph. 37(2): 22 (2018) - [c10]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. SoCG 2018: 1:1-1:16 - [c9]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). SoCG 2018: 77:1-77:4 - [i3]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. CoRR abs/1803.06078 (2018) - 2017
- [j10]Ahmad A. Rushdi, Scott A. Mitchell, Ahmed H. Mahmoud, Chandrajit Bajaj, Mohamed S. Ebeida:
All-quad meshing without cleanup. Comput. Aided Des. 85: 83-98 (2017) - [j9]Ahmed Abdelkader, Ahmed H. Mahmoud, Ahmad A. Rushdi, Scott A. Mitchell, John D. Owens, Mohamed S. Ebeida:
A Constrained Resampling Strategy for Mesh Improvement. Comput. Graph. Forum 36(5): 189-201 (2017) - [c8]Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Scott A. Mitchell:
A Seed Placement Strategy for Conforming Voronoi Meshing. CCCG 2017: 95-100 - 2016
- [j8]Mohamed S. Ebeida, Ahmad A. Rushdi, Muhammad A. Awad, Ahmed H. Mahmoud, Dong-Ming Yan, Shawn A. English, John D. Owens, Chandrajit L. Bajaj, Scott A. Mitchell:
Disk Density Tuning of a Maximal Random Packing. Comput. Graph. Forum 35(5): 259-269 (2016) - [j7]Mohamed S. Ebeida, Scott A. Mitchell, Laura P. Swiler, Vicente J. Romero, Ahmad A. Rushdi:
POF-Darts: Geometric adaptive sampling for probability of failure. Reliab. Eng. Syst. Saf. 155: 64-77 (2016) - 2015
- [p1]Mohamed S. Ebeida, Scott A. Mitchell, Anjul Patney, Andrew A. Davidson, Stanley Tzeng, Muhammad A. Awad, Ahmed H. Mahmoud, John D. Owens:
Exercises in High-Dimensional Sampling: Maximal Poisson-Disk Sampling and k-d Darts. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces 2015: 221-238 - 2014
- [j6]Mohamed S. Ebeida, Muhammad A. Awad, Xiaoyin Ge, Ahmed H. Mahmoud, Scott A. Mitchell, Patrick M. Knupp, Li-Yi Wei:
Improving spatial coverage while preserving the blue noise of point sets. Comput. Aided Des. 46: 25-36 (2014) - [j5]Mohamed S. Ebeida, Anjul Patney, Scott A. Mitchell, Keith R. Dalbey, Andrew A. Davidson, John D. Owens:
k-d Darts: Sampling by k-dimensional flat searches. ACM Trans. Graph. 33(1): 3:1-3:16 (2014) - [i2]Scott A. Mitchell, Mohamed S. Ebeida, Muhammad A. Awad, Chonhyon Park, Anjul Patney, Ahmad A. Rushdi, Laura P. Swiler, Dinesh Manocha, Li-Yi Wei:
Spoke-Darts for High-Dimensional Blue-Noise Sampling. CoRR abs/1408.1118 (2014) - 2013
- [j4]Mohamed S. Ebeida, Ahmed H. Mahmoud, Muhammad A. Awad, Mohammed A. Mohammed, Scott A. Mitchell, Alexander Rand, John D. Owens:
Sifted Disks. Comput. Graph. Forum 32(2): 509-518 (2013) - [i1]Mohamed S. Ebeida, Anjul Patney, Scott A. Mitchell, Keith R. Dalbey, Andrew A. Davidson, John D. Owens:
k-d Darts: Sampling by k-Dimensional Flat Searches. CoRR abs/1302.3917 (2013) - 2012
- [j3]Mohamed S. Ebeida, Scott A. Mitchell, Anjul Patney, Andrew A. Davidson, John D. Owens:
A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions. Comput. Graph. Forum 31(2pt4): 785-794 (2012) - [c7]Scott A. Mitchell, Alexander Rand, Mohamed S. Ebeida, Chandrajit L. Bajaj:
Variable Radii Poisson Disk Sampling. CCCG 2012: 185-190 - [c6]Stanley Tzeng, Anjul Patney, Andrew A. Davidson, Mohamed S. Ebeida, Scott A. Mitchell, John D. Owens:
High-Quality Parallel Depth-of-Field Using Line Samples. High Performance Graphics 2012: 23-31 - 2011
- [j2]Mohamed S. Ebeida, Scott A. Mitchell, Andrew A. Davidson, Anjul Patney, Patrick M. Knupp, John D. Owens:
Efficient and good Delaunay meshes from random points. Comput. Aided Des. 43(11): 1506-1515 (2011) - [j1]Mohamed S. Ebeida, Andrew A. Davidson, Anjul Patney, Patrick M. Knupp, Scott A. Mitchell, John D. Owens:
Efficient maximal poisson-disk sampling. ACM Trans. Graph. 30(4): 49 (2011) - [c5]Mohamed S. Ebeida, Scott A. Mitchell:
Uniform Random Voronoi Meshes. IMR 2011: 273-290 - 2010
- [c4]Mohamed S. Ebeida, Kaan Karamete, Eric L. Mestreau, Saikat Dey:
Q-TRAN: A New Approach to Transform Triangular Meshes into Quadrilateral Meshes Locally. IMR 2010: 23-34
2000 – 2009
- 2009
- [c3]Anjul Patney, Mohamed S. Ebeida, John D. Owens:
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces. High Performance Graphics 2009: 99-108 - [c2]Xinghua Liang, Mohamed S. Ebeida, Yongjie Zhang:
Guaranteed-Quality All-Quadrilateral Mesh Generation with Feature Preservation. IMR 2009: 45-63 - [c1]Mohamed S. Ebeida, Eric L. Mestreau, Yongjie Zhang, Saikat Dey:
Mesh Insertion of Hybrid Meshes. IMR 2009: 359-375
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint