Jianjun Xia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jianjun Xia has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Tao Ju
Washington University in St. Louis, SAINT LOUIS, USA
2 shared publications - Nathan Carr
Adobe Research, San Jose, USA
1 shared publication - Qingnan Zhou
Adobe Research, New York, USA
1 shared publication - Xingyi Du
Tencent, Seattle, USA
1 shared publication - Yiwen Ju
Washington University in St. Louis, SAINT LOUIS, USA
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-14
CSG Sweeps: Feature-aware sweep surfacing of deformable CSGs
Computing the sweep surface of a moving 3D solid is a fundamental problem in computer graphics. The problem is particularly challenging when the solid is piecewise-smooth, which yields a complex network of sharp features on the sweep surface. Few methods can model these features, and they are all limited to rigid-body motions (translation and rotation). We present the first feature-aware method to surface the sweep of a deforming piecewise-smooth shape. Our method works on any input represented as a 4D time-varying CSG, allowing changes to both geometry and topology during sweeping. Our technical contributions include a generalization of the lifted sweeping formulation from smooth functions to CSG functions, and robust algorithms for discretizing multiple intersecting implicit surfaces in arbitrary dimensions. We demonstrate our algorithm for capturing the sharp features on the sweep surface under both rigid and non-rigid motions.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-14
Open AccessCSG Sweeps: Feature-aware sweep surfacing of deformable CSGs
Computing the sweep surface of a moving 3D solid is a fundamental problem in computer graphics. The problem is particularly challenging when the solid is piecewise-smooth, which yields a complex network of sharp features on the sweep surface. Few methods can model these features, and they are all limited to rigid-body motions (translation and rotation). We present the first feature-aware method to surface the sweep of a deforming piecewise-smooth shape. Our method works on any input represented as a 4D time-varying CSG, allowing changes to both geometry and topology during sweeping. Our technical contributions include a generalization of the lifted sweeping formulation from smooth functions to CSG functions, and robust algorithms for discretizing multiple intersecting implicit surfaces in arbitrary dimensions. We demonstrate our algorithm for capturing the sharp features on the sweep surface under both rigid and non-rigid motions.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Variational Surface Reconstruction Using Natural Neighbors
Surface reconstruction from points is a fundamental problem in computer graphics. While numerous methods have been proposed, it remains challenging to reconstruct from sparse and non-uniform point distributions, particularly when normals are absent. We present a robust and scalable method for reconstructing an implicit surface from points without normals. By exploring the locality of natural neighborhoods, we propose local reformulations of a previous global method, known for its ability to surface sparse points but high computational cost, thereby significantly improving its scalability while retaining its robustness. Experiments show that our method achieves comparable speed to existing reconstruction methods on large inputs while producing fewer artifacts in under-sampled regions.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-19
Open AccessVariational Surface Reconstruction Using Natural Neighbors
Surface reconstruction from points is a fundamental problem in computer graphics. While numerous methods have been proposed, it remains challenging to reconstruct from sparse and non-uniform point distributions, particularly when normals are absent. We present a robust and scalable method for reconstructing an implicit surface from points without normals. By exploring the locality of natural neighborhoods, we propose local reformulations of a previous global method, known for its ability to surface sparse points but high computational cost, thereby significantly improving its scalability while retaining its robustness. Experiments show that our method achieves comparable speed to existing reconstruction methods on large inputs while producing fewer artifacts in under-sampled regions.