Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hayam Abdelrahman

dblp:361/1375 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-0387-6687ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Computational geometry · 67% Mathematical optimization · 33%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
shape analysis
0.712023
Fast Computation of Neck-Like Features · IEEE Trans. Vis. Comput. Graph. 2023
Mathematical optimization › nonconvex optimization
critical point analysis
0.212023
Fast Computation of Neck-Like Features · IEEE Trans. Vis. Comput. Graph. 2023
Computational geometry
morse theory
0.212023
Fast Computation of Neck-Like Features · IEEE Trans. Vis. Comput. Graph. 2023
Computational geometry
topological algorithms
0.212023
Fast Computation of Neck-Like Features · IEEE Trans. Vis. Comput. Graph. 2023

Methods — techniques the papers use, named apart from their topics

morse function · 1.3mesh simplification · 1.3hessian eigenvalue analysis · 1.3geodesic computation · 1.3
YearPublicationVenuePosition
2025 Computing skeleton-based handle/tunnel loops
Hayam Abdelrahman, Yiying Tong
Comput. Graph.1
2023 Fast Computation of Neck-Like Features
abstract
Locating neck-like features, or locally narrow parts, of a surface is crucial in various applications such as segmentation, shape analysis, path planning, and robotics. Topological methods are often utilized to find the set of shortest loops around handles and tunnels. However, there are abundant neck-like features on genus-0 shapes without any handles. While 3D geometry-aware topological approaches exist to find neck loops, their construction can be cumbersome and may even lead to geometrically wide loops. Thus we propose a "topology-aware geometric approach" to compute the tightest loops around neck features on surfaces, including genus-0 surfaces. Our algorithm starts with a volumetric representation of an input surface and then calculates the distance function of mesh points to the boundary surface as a Morse function. All neck features induce critical points of this Morse function where the Hessian matrix has precisely one positive eigenvalue, i.e., type-2 saddles. As we focus on geometric neck features, we bypass a topological construction such as the Morse-Smale complex or a lower-star filtration. Instead, we directly create a cutting plane through each neck feature. Each resulting loop can then be tightened to form a closed geodesic representation of the neck feature. Moreover, we offer criteria to measure the significance of a neck feature through the evolution of critical points when smoothing the distance function. Furthermore, we speed up the detection process through mesh simplification without compromising the quality of the output loops.
Hayam Abdelrahman, Yiying Tong
IEEE Trans. Vis. Comput. Graph.1