Mei-Heng Yueh

Dr. Mei-Heng Yueh


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2017 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
MYMei-Heng Yueh
Mei-Heng Yueh
WLWen-Wei Lin
Wen-Wei Lin
CWChin-Tien Wu
Chin-Tien Wu
SYShing-Tung Yau
Shing-Tung Yau

4 September 2018 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
MYMei-Heng Yueh
Mei-Heng Yueh
WLWen-Wei Lin
Wen-Wei Lin
CWChin-Tien Wu
Chin-Tien Wu
SYShing-Tung Yau
Shing-Tung Yau

1 January 2019 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
MYMei-Heng Yueh
Mei-Heng Yueh
TLTiexiang Li
Tiexiang Li
WLWen-Wei Lin
Wen-Wei Lin
SYShing-Tung Yau
Shing-Tung Yau
Manifold parameterizations have been applied to various fields of commercial industries. Several efficient algorithms for the computation of triangular surface mesh parameterizations have been prop...

1 January 2021 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
YKYueh-Cheng Kuo
Yueh-Cheng Kuo
WLWen-Wei Lin
Wen-Wei Lin
MYMei-Heng Yueh
Mei-Heng Yueh
SYShing-Tung Yau
Shing-Tung Yau
Surface conformal parameterizations have been widely applied to various tasks in computer graphics. In this paper, we develop a convergent conformal energy minimization (CCEM) iterative algorithm v...

21 July 2023 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
MYMei-Heng Yueh
Mei-Heng Yueh
The stretch energy is a fully nonlinear energy functional that has been applied to the numerical computation of area-preserving mappings. However, this approach lacks theoretical support and the analysis is complicated due to the full nonlinearity of the functional. In this paper, we establish a theoretical foundation of stretch energy minimization (SEM) for the computation of area-preserving mappings: the sufficient and necessary conditions for the energy minimizers are mappings being area-preserving. In addition, we derive a neat gradient formula of the functional and develop the associated line search gradient descent method of SEM with theoretically guaranteed convergence. Also, a simple post-processing technique is developed to guarantee the bijectivity of produced mappings. Furthermore, we generalized the theoretical results to the stretch energy for arbitrary area measures and the balanced energy so that the mass-preserving and distortion-balancing mappings can also be computed by minimizing the generalized stretch energy and the balanced energy, respectively. Numerical experiments and comparisons to another state-of-the-art algorithm are demonstrated to validate the effectiveness, accuracy, and robustness of SEM for computing area-preserving mappings.

1 January 2020 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
MYMei-Heng Yueh
Mei-Heng Yueh
TLTiexiang Li
Tiexiang Li
WLWen-Wei Lin
Wen-Wei Lin
SYShing-Tung Yau
Shing-Tung Yau
Parameterizations of manifolds are widely applied to the fields of numerical partial differential equations and computer graphics. To this end, in recent years several efficient and reliable numerical algorithms have been developed by different research groups for the computation of triangular and tetrahedral mesh parameterizations. However, it is still challenging when the topology of manifolds is nontrivial, e.g., the 3-manifold of a topological solid torus. In this paper, we propose a novel volumetric stretch energy minimization algorithm for volume-preserving parameterizations of toroidal polyhedra with a single boundary being mapped to a standard torus. In addition, the algorithm can also be used to compute the equiareal mapping between a genus-one closed surface and the standard torus. Numerical experiments indicate that the developed algorithm is effective and performs well on the bijectivity of the mapping. Applications on manifold registrations and partitions are demonstrated to show the robustness of our algorithms.