Renjie Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Renjie Chen has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Craig Gotsman
New Jersey Institute of Technology Newark New Jersey USA
9 shared publications Ligang Liu
8 shared publications- Dong Xiao
University of Science and Technology of China, Hefei, China
4 shared publications - Dongbo Shi
University of Science and Technology of China
3 shared publications - Jieping Ye
Qwen-Character Team, Alibaba Group, China
3 shared publications - Ligang Liu
University of Science and Technology of China, Hefei, China
3 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-13
TORO Curves: G^2 Interpolating Curve with Maximum Curvature Control
We introduce TORO curves, a new family of G 2 -continuous interpolating splines that provide precise local curvature control without global optimization. Our construction assembles two types of primitive segments, each attaining curvature maxima strictly on the endpoint circular arcs: the trigonometric offset (TO) segment for inflection transitions, and the rational Bézier offset (RO) segment for constant-sign curvature spans. A core pillar of our framework is an offset-based decoupling strategy: by exploiting properties of offset curves, we decouple the geometry from the curvature magnitude, thereby enabling direct curvature prescription at control points. The construction is deterministic and local; each segment is solved via simple quadratic equations, and the rational Bézier weights are directly determined by geometric quantities. This provides strict local support and enables realtime responsiveness during interactive manipulation. Finally, we introduce an adaptive curvature configuration that guarantees robustness and visual continuity under deformation. Our results demonstrate that TORO curves can represent complex shapes while accurately reproducing basic primitives such as circular arcs and ellipses, offering an efficient, versatile tool for modern geometric design.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-13
Open AccessTORO Curves: G^2 Interpolating Curve with Maximum Curvature Control
We introduce TORO curves, a new family of G 2 -continuous interpolating splines that provide precise local curvature control without global optimization. Our construction assembles two types of primitive segments, each attaining curvature maxima strictly on the endpoint circular arcs: the trigonometric offset (TO) segment for inflection transitions, and the rational Bézier offset (RO) segment for constant-sign curvature spans. A core pillar of our framework is an offset-based decoupling strategy: by exploiting properties of offset curves, we decouple the geometry from the curvature magnitude, thereby enabling direct curvature prescription at control points. The construction is deterministic and local; each segment is solved via simple quadratic equations, and the rational Bézier weights are directly determined by geometric quantities. This provides strict local support and enables realtime responsiveness during interactive manipulation. Finally, we introduce an adaptive curvature configuration that guarantees robustness and visual continuity under deformation. Our results demonstrate that TORO curves can represent complex shapes while accurately reproducing basic primitives such as circular arcs and ellipses, offering an efficient, versatile tool for modern geometric design.
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-17
Anisotropic Green Coordinates
We live in a world filled with anisotropy, a ubiquitous characteristic of both natural and engineered systems. In this study, we concentrate on space deformation and introduce Anisotropic Green Coordinates (AGC), which provide versatile effects for cage-based and variational deformations in both two and three dimensions. The AGC are derived from the anisotropic Laplace equation ∇ • (A∇ u ) = 0, where A is a symmetric positive definite (SPD) matrix. This equation belongs to the class of constant-coefficient second-order elliptic equations, exhibiting properties analogous to the Laplace equation but incorporating the matrix A to characterize anisotropic behavior. Based on this equation, we establish the boundary integral formulation, which is subsequently discretized to derive the deformation coordinates defined on the vertices and normals of oriented simplicial cages. Our method satisfies basic properties such as linear reproduction and translation invariance, and possesses closed-form expressions for both 2D and 3D scenarios. We also give an intuitive geometric interpretation of the approach, demonstrating that our method can generate a quasi-conformal mapping. We demonstrate both theoretically and empirically that the deformation effect is more pronounced when the normal of the cage face aligns with the eigenvector corresponding to the larger eigenvalue of A. This indicates that anisotropy amplifies the deformation sensitivity along this direction, enabling more targeted cage design and matrix selection. Furthermore, we derive the gradients and Hessians of the deformation coordinates and employ the local-global optimization framework to facilitate variational shape deformation, enabling flexible shape manipulation while achieving as-rigid-as-possible (ARAP) shape deformation. Experimental results demonstrate that AGC offer versatile and diverse deformation options, providing artists with enhanced flexibility and introducing a novel perspective on spatial deformation. The source code is available at https://github.com/Submanifold/AGC.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-17
Open AccessAnisotropic Green Coordinates
We live in a world filled with anisotropy, a ubiquitous characteristic of both natural and engineered systems. In this study, we concentrate on space deformation and introduce Anisotropic Green Coordinates (AGC), which provide versatile effects for cage-based and variational deformations in both two and three dimensions. The AGC are derived from the anisotropic Laplace equation ∇ • (A∇ u ) = 0, where A is a symmetric positive definite (SPD) matrix. This equation belongs to the class of constant-coefficient second-order elliptic equations, exhibiting properties analogous to the Laplace equation but incorporating the matrix A to characterize anisotropic behavior. Based on this equation, we establish the boundary integral formulation, which is subsequently discretized to derive the deformation coordinates defined on the vertices and normals of oriented simplicial cages. Our method satisfies basic properties such as linear reproduction and translation invariance, and possesses closed-form expressions for both 2D and 3D scenarios. We also give an intuitive geometric interpretation of the approach, demonstrating that our method can generate a quasi-conformal mapping. We demonstrate both theoretically and empirically that the deformation effect is more pronounced when the normal of the cage face aligns with the eigenvector corresponding to the larger eigenvalue of A. This indicates that anisotropy amplifies the deformation sensitivity along this direction, enabling more targeted cage design and matrix selection. Furthermore, we derive the gradients and Hessians of the deformation coordinates and employ the local-global optimization framework to facilitate variational shape deformation, enabling flexible shape manipulation while achieving as-rigid-as-possible (ARAP) shape deformation. Experimental results demonstrate that AGC offer versatile and diverse deformation options, providing artists with enhanced flexibility and introducing a novel perspective on spatial deformation. The source code is available at https://github.com/Submanifold/AGC.
- 24 October 2026
- Published by Elsevier in Computers & Graphics
- Vol. 141
Lifting N-direction fields to SO(3): A unified framework for smoothness and implicit feature alignment
- 24 October 2026
- Published by Elsevier in Computers & Graphics
- Vol. 141
Lifting N-direction fields to SO(3): A unified framework for smoothness and implicit feature alignment
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Surface Reconstruction from Unoriented Points via Green’s 3rd Identity
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessSurface Reconstruction from Unoriented Points via Green’s 3rd Identity
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Nonlinear Multigrid for Injective Embedding
Computing injective, flip-free embeddings of simplicial meshes is a fundamental challenge in geometry processing. While the Total Lifted Content (TLC) energy provides a smooth functional with theoretically guaranteed injective global minima, its non-convex nature presents significant optimization hurdles. In this work, we propose a Nonlinear Multigrid (MG/Opt) framework specifically tailored for efficient TLC energy minimization. Our approach leverages a topology-preserving mesh hierarchy to rapidly eliminate low-frequency errors on coarse scales while maintaining rigorous gradient consistency between hierarchical levels through linear correction terms. To address the persistent challenge of local inversions, we introduce a targeted smoothing strategy and an adaptive parameter scheduling mechanism that balances global convergence speed with local injectivity precision. Experimental evaluations across extensive 2D and 3D benchmark datasets demonstrate the robustness of our approach. Our method achieves a 100% convergence success rate across all tested 2D cases and all but one 3D dataset (the VOLMAP benchmark). Furthermore, our MG/Opt framework delivers substantial performance gains, achieving up to 63 × speedup on high-resolution subdivided datasets compared to traditional solvers. These results confirm that our multigrid strategy provides a scalable and reliable solution for large-scale injective mapping problems. Code and data for this paper are at https://github.com/distmeshM/MGOpt_TLC
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessNonlinear Multigrid for Injective Embedding
Computing injective, flip-free embeddings of simplicial meshes is a fundamental challenge in geometry processing. While the Total Lifted Content (TLC) energy provides a smooth functional with theoretically guaranteed injective global minima, its non-convex nature presents significant optimization hurdles. In this work, we propose a Nonlinear Multigrid (MG/Opt) framework specifically tailored for efficient TLC energy minimization. Our approach leverages a topology-preserving mesh hierarchy to rapidly eliminate low-frequency errors on coarse scales while maintaining rigorous gradient consistency between hierarchical levels through linear correction terms. To address the persistent challenge of local inversions, we introduce a targeted smoothing strategy and an adaptive parameter scheduling mechanism that balances global convergence speed with local injectivity precision. Experimental evaluations across extensive 2D and 3D benchmark datasets demonstrate the robustness of our approach. Our method achieves a 100% convergence success rate across all tested 2D cases and all but one 3D dataset (the VOLMAP benchmark). Furthermore, our MG/Opt framework delivers substantial performance gains, achieving up to 63 × speedup on high-resolution subdivided datasets compared to traditional solvers. These results confirm that our multigrid strategy provides a scalable and reliable solution for large-scale injective mapping problems. Code and data for this paper are at https://github.com/distmeshM/MGOpt_TLC
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-14
PQ-Free HD: Priority-Queue-Free Hausdorff Distance for Triangle Meshes on GPU
Computing the Hausdorff distance between triangle meshes with guaranteed accuracy is a computationally intensive task. Conventional Branch-and-Bound (B&B) approaches are fundamentally ill-suited for massive parallelism. Their reliance on a global priority queue (PQ) for both best-first scheduling and global termination checks creates a serial bottleneck that prevents scalable performance. We introduce PQ-Free HD , a parallel B&B framework that eliminates this dependency by decoupling the algorithm's termination logic from its scheduling order. This is achieved by relaxing the culling criterion, thereby replacing the priority queue with a contention-free ring buffer, which transforms the execution model from a state-dependent serial search into a high-throughput, asynchronous batch-processing paradigm. The framework consists of four key components: (1) a parallel priority-queue-free B&B paradigm; (2) a hierarchical GPU execution architecture combining batched depth-first scheduling with fused collaborative kernels; (3) a geometrically robust seven-stage culling pipeline featuring novel tests for challenging geometries; and (4) a compact 29-byte procedural task descriptor that achieves an 83.9% memory reduction. Evaluations demonstrate substantial speedups: a median of 71.7× over the state-of-the-art CPU algorithm on general benchmarks, and exceeding 10,000× on challenging CAD models with dense planar structures. The throughput advantage scales super-linearly with problem complexity. We showcase practical value by building a strictly Hausdorff-distance-bounded mesh simplification tool entirely on the GPU. Our work provides a new method for high-throughput, tolerance-controllable B&B-based geometric queries on GPUs. Code and data are available at https://github.com/huzhihao2001/pqfree-hd.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-14
Open AccessPQ-Free HD: Priority-Queue-Free Hausdorff Distance for Triangle Meshes on GPU
Computing the Hausdorff distance between triangle meshes with guaranteed accuracy is a computationally intensive task. Conventional Branch-and-Bound (B&B) approaches are fundamentally ill-suited for massive parallelism. Their reliance on a global priority queue (PQ) for both best-first scheduling and global termination checks creates a serial bottleneck that prevents scalable performance. We introduce PQ-Free HD , a parallel B&B framework that eliminates this dependency by decoupling the algorithm's termination logic from its scheduling order. This is achieved by relaxing the culling criterion, thereby replacing the priority queue with a contention-free ring buffer, which transforms the execution model from a state-dependent serial search into a high-throughput, asynchronous batch-processing paradigm. The framework consists of four key components: (1) a parallel priority-queue-free B&B paradigm; (2) a hierarchical GPU execution architecture combining batched depth-first scheduling with fused collaborative kernels; (3) a geometrically robust seven-stage culling pipeline featuring novel tests for challenging geometries; and (4) a compact 29-byte procedural task descriptor that achieves an 83.9% memory reduction. Evaluations demonstrate substantial speedups: a median of 71.7× over the state-of-the-art CPU algorithm on general benchmarks, and exceeding 10,000× on challenging CAD models with dense planar structures. The throughput advantage scales super-linearly with problem complexity. We showcase practical value by building a strictly Hausdorff-distance-bounded mesh simplification tool entirely on the GPU. Our work provides a new method for high-throughput, tolerance-controllable B&B-based geometric queries on GPUs. Code and data are available at https://github.com/huzhihao2001/pqfree-hd.
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (7) , 6986-7000
Efficient Large-Scale Scene Reconstruction via Semantic-Aware Hybrid Representation
Reconstructing large-scale 3D scenes remains challenging due to the need to balance photorealistic quality, real-time rendering, and compact storage. Recent progress in 3D Gaussian Splatting (3DGS) has achieved impressive fidelity and speed, yet its large-scale application suffers from excessive primitive counts, leading to prohibitive storage and rendering costs. To overcome this inefficiency, we introduce a novel semantic-guided hybrid representation that unifies textured meshes and 3D Gaussians in a differentiable framework. The key idea is to leverage meshes for geometrically regular regions such as roads and building facades, while reserving Gaussians for fine, complex details like vegetation. Our method is realized through three key technical contributions. First, we develop a semantic-guided adaptive modeling pipeline that fuses multi-view segmentation onto the scene mesh to robustly partition the scene and prune redundant Gaussians. Second, we introduce a high-performance CUDA-based hybrid renderer that seamlessly combines mesh rasterization with Gaussian splatting, enabling correct occlusion handling and joint optimization of both representations. Finally, we propose a mesh-guided sampling strategy that adaptively adds Gaussians to recover fine details in under-reconstructed areas. Extensive experiments on diverse large-scale datasets demonstrate that our approach significantly reduces storage requirements and accelerates rendering performance while maintaining comparable or superior visual quality.
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 32 (7) , 6986-7000
Efficient Large-Scale Scene Reconstruction via Semantic-Aware Hybrid Representation
Reconstructing large-scale 3D scenes remains challenging due to the need to balance photorealistic quality, real-time rendering, and compact storage. Recent progress in 3D Gaussian Splatting (3DGS) has achieved impressive fidelity and speed, yet its large-scale application suffers from excessive primitive counts, leading to prohibitive storage and rendering costs. To overcome this inefficiency, we introduce a novel semantic-guided hybrid representation that unifies textured meshes and 3D Gaussians in a differentiable framework. The key idea is to leverage meshes for geometrically regular regions such as roads and building facades, while reserving Gaussians for fine, complex details like vegetation. Our method is realized through three key technical contributions. First, we develop a semantic-guided adaptive modeling pipeline that fuses multi-view segmentation onto the scene mesh to robustly partition the scene and prune redundant Gaussians. Second, we introduce a high-performance CUDA-based hybrid renderer that seamlessly combines mesh rasterization with Gaussian splatting, enabling correct occlusion handling and joint optimization of both representations. Finally, we propose a mesh-guided sampling strategy that adaptively adds Gaussians to recover fine details in under-reconstructed areas. Extensive experiments on diverse large-scale datasets demonstrate that our approach significantly reduces storage requirements and accelerates rendering performance while maintaining comparable or superior visual quality.
- 13 June 2026
- Published by Elsevier in Computer-Aided Design
- Vol. 199
Local DeWall: Billion-scale 3D Delaunay triangulation on a single GPU
- 13 June 2026
- Published by Elsevier in Computer-Aided Design
- Vol. 199
Local DeWall: Billion-scale 3D Delaunay triangulation on a single GPU
- 24 April 2026
- Published by Elsevier in Computers & Graphics
- Vol. 137
UniTex: Single-chart texture reconstruction from multi-view images
- 24 April 2026
- Published by Elsevier in Computers & Graphics
- Vol. 137
UniTex: Single-chart texture reconstruction from multi-view images
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-13
G 2 Interpolating Spline with Local Maximum Curvature
We introduce a novel class of G 2 continuous splines constructed using an innovative blending method, which guarantees precise interpolation of given control points. These splines are designed to achieve local curvature maxima specifically at these control points and possess compact local support, thereby eliminating the need for global optimization processes. The formulation ensures the splines are free from cusps and self-intersections and, notably, prevents adjacent segments from intersecting—a significant improvement over prior blending-based curve techniques. This framework utilizes quadratic Bézier splines in conjunction with quartic Bézier blending functions. A constructive algorithm is presented that generates these curvature-controlled curves without relying on global optimization. Through parametric adjustments of curvatures, the curve's geometry near control points can be tuned to create features ranging from smooth to sharp, thus broadening the design possibilities. Rigorous mathematical proofs and visual demonstrations validate all claimed properties of the framework.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-13
Open AccessG 2 Interpolating Spline with Local Maximum Curvature
We introduce a novel class of G 2 continuous splines constructed using an innovative blending method, which guarantees precise interpolation of given control points. These splines are designed to achieve local curvature maxima specifically at these control points and possess compact local support, thereby eliminating the need for global optimization processes. The formulation ensures the splines are free from cusps and self-intersections and, notably, prevents adjacent segments from intersecting—a significant improvement over prior blending-based curve techniques. This framework utilizes quadratic Bézier splines in conjunction with quartic Bézier blending functions. A constructive algorithm is presented that generates these curvature-controlled curves without relying on global optimization. Through parametric adjustments of curvatures, the curve's geometry near control points can be tuned to create features ranging from smooth to sharp, thus broadening the design possibilities. Rigorous mathematical proofs and visual demonstrations validate all claimed properties of the framework.