Yuezhi Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuezhi Yang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Leonidas Guibas
Stanford University, Stanford, USA
2 shared publications - Qixing Huang
University of Texas at Austin, Austin, USA
2 shared publications - Congyue Deng
Stanford University
1 shared publication - Haitao Yang
University of Texas at Austin, Austin, USA
1 shared publication - Hao Zhang
Simon Fraser University, Burnaby, Canada
1 shared publication - Jiaxin Lu
University of Texas at Austin
1 shared publication
Latest Publications
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
ART-DECO: Arbitrary Text Guidance for 3D Detailizer Construction
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessART-DECO: Arbitrary Text Guidance for 3D Detailizer Construction
- 28 August 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (5)
An Efficient Global‐to‐Local Rotation Optimization Approach via Spherical Harmonics
This paper studies the classical problem of 3D shape alignment, namely computing the relative rotation between two shapes (centered at the origin and normalized by scale) by aligning spherical harmonic coefficients of their spherical function representations. Unlike most prior work, which focuses on the regime in which the inputs have approximately the same shape, we focus on the more general and challenging setting in which the shapes may differ. Central to our approach is a stability analysis of spherical harmonic coefficients, which sheds light on how to align them for robust rotation estimation. We observe that due to symmetries, certain spherical harmonic coefficients may vanish. As a result, using a robust norm for alignment that automatically discards such coefficients offers more accurate rotation estimates than the widely used L2 norm. To enable efficient continuous optimization, we show how to analytically compute the Jacobian of spherical harmonic coefficients with respect to rotations. We also introduce an efficient approach for rotation initialization that requires only a sparse set of rotation samples. Experimental results show that our approach achieves better accuracy and efficiency compared to baseline approaches.
- 28 August 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (5)
An Efficient Global‐to‐Local Rotation Optimization Approach via Spherical Harmonics
This paper studies the classical problem of 3D shape alignment, namely computing the relative rotation between two shapes (centered at the origin and normalized by scale) by aligning spherical harmonic coefficients of their spherical function representations. Unlike most prior work, which focuses on the regime in which the inputs have approximately the same shape, we focus on the more general and challenging setting in which the shapes may differ. Central to our approach is a stability analysis of spherical harmonic coefficients, which sheds light on how to align them for robust rotation estimation. We observe that due to symmetries, certain spherical harmonic coefficients may vanish. As a result, using a robust norm for alignment that automatically discards such coefficients offers more accurate rotation estimates than the widely used L2 norm. To enable efficient continuous optimization, we show how to analytically compute the Jacobian of spherical harmonic coefficients with respect to rotations. We also introduce an efficient approach for rotation initialization that requires only a sparse set of rotation samples. Experimental results show that our approach achieves better accuracy and efficiency compared to baseline approaches.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
GenAnalysis: Joint Shape Analysis by Learning Man-Made Shape Generators with Deformation Regularizations
We present GenAnalysis, an implicit shape generation framework that allows joint analysis of man-made shapes, including shape matching and joint shape segmentation. The key idea is to enforce an as-affine-as-possible (AAAP) deformation between synthetic shapes of the implicit generator that are close to each other in the latent space, which we achieve by designing a regularization loss. It allows us to understand the shape variation of each shape in the context of neighboring shapes and also offers structure-preserving interpolations between the input shapes. We show how to extract these shape variations by recovering piecewise affine vector fields in the tangent space of each shape. These vector fields provide single-shape segmentation cues. We then derive shape correspondences by iteratively propagating AAAP deformations across a sequence of intermediate shapes. These correspondences are then used to aggregate single-shape segmentation cues into consistent segmentations. We conduct experiments on the ShapeNet dataset to show superior performance in shape matching and joint shape segmentation over previous methods.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Open AccessGenAnalysis: Joint Shape Analysis by Learning Man-Made Shape Generators with Deformation Regularizations
We present GenAnalysis, an implicit shape generation framework that allows joint analysis of man-made shapes, including shape matching and joint shape segmentation. The key idea is to enforce an as-affine-as-possible (AAAP) deformation between synthetic shapes of the implicit generator that are close to each other in the latent space, which we achieve by designing a regularization loss. It allows us to understand the shape variation of each shape in the context of neighboring shapes and also offers structure-preserving interpolations between the input shapes. We show how to extract these shape variations by recovering piecewise affine vector fields in the tangent space of each shape. These vector fields provide single-shape segmentation cues. We then derive shape correspondences by iteratively propagating AAAP deformations across a sequence of intermediate shapes. These correspondences are then used to aggregate single-shape segmentation cues into consistent segmentations. We conduct experiments on the ShapeNet dataset to show superior performance in shape matching and joint shape segmentation over previous methods.