Yiwen Ju
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
Research Interests
Yiwen Ju has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Nathan Carr
Adobe Research, San Jose, USA
4 shared publications - Qingnan Zhou
Adobe Research, New York, USA
4 shared publications - Tao Ju
Washington University in St. Louis, SAINT LOUIS, USA
4 shared publications - Xingyi Du
Tencent, Seattle, USA
4 shared publications - Hongxun Zhang
College of Resources and Environment, University of Chinese Academy of Sciences, Beijing 101408, China
1 shared publication - Jianjun Xia
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
- 14 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (2) , 1
Erratum: Lifted Surfacing of Generalized Sweep Volumes
This is an erratum for the article “Lifted Surfacing of Generalized Sweep Volumes” published in ACM Trans. Graph. 44, 6, Article 249 (December 2025), 17 pages.
- 14 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (2) , 1
Open AccessErratum: Lifted Surfacing of Generalized Sweep Volumes
This is an erratum for the article “Lifted Surfacing of Generalized Sweep Volumes” published in ACM Trans. Graph. 44, 6, Article 249 (December 2025), 17 pages.
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-17
Lifted Surfacing of Generalized Sweep Volumes
Computing the boundary surface of the 3D volume swept by a rigid or deforming solid remains a challenging problem in geometric modeling. Existing approaches are often limited to sweeping rigid shapes, cannot guarantee a watertight surface, or struggle with modeling the intricate geometric features (e.g., sharp creases and narrow gaps) and topological features (e.g., interior voids). We make the observation that the sweep boundary is a subset of the projection of the intersection of two implicit surfaces in a higher dimension, and we derive a characterization of the subset using winding numbers. These insights lead to a general algorithm for any sweep represented as a smooth time-varying implicit function satisfying a genericity assumption, and it produces a watertight and intersection-free surface that better approximates the geometric and topological features than existing methods.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-17
Open AccessLifted Surfacing of Generalized Sweep Volumes
Computing the boundary surface of the 3D volume swept by a rigid or deforming solid remains a challenging problem in geometric modeling. Existing approaches are often limited to sweeping rigid shapes, cannot guarantee a watertight surface, or struggle with modeling the intricate geometric features (e.g., sharp creases and narrow gaps) and topological features (e.g., interior voids). We make the observation that the sweep boundary is a subset of the projection of the intersection of two implicit surfaces in a higher dimension, and we derive a characterization of the subset using winding numbers. These insights lead to a general algorithm for any sweep represented as a smooth time-varying implicit function satisfying a genericity assumption, and it produces a watertight and intersection-free surface that better approximates the geometric and topological features than existing methods.
- Open Access
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-17
Adaptive grid generation for discretizing implicit complexes
We present a method for generating a simplicial (e.g., triangular or tetrahedral) grid to enable adaptive discretization of implicit shapes defined by a vector function. Such shapes, which we call implicit complexes, are generalizations of implicit surfaces and useful for representing non-smooth and non-manifold structures. While adaptive grid generation has been extensively studied for polygonizing implicit surfaces, few methods are designed for implicit complexes. Our method can generate adaptive grids for several implicit complexes, including arrangements of implicit surfaces, CSG shapes, material interfaces, and curve networks. Importantly, our method adapts the grid to the geometry of not only the implicit surfaces but also their lower-dimensional intersections. We demonstrate how our method enables efficient and detail-preserving discretization of non-trivial implicit shapes.
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-17
Open AccessAdaptive grid generation for discretizing implicit complexes
We present a method for generating a simplicial (e.g., triangular or tetrahedral) grid to enable adaptive discretization of implicit shapes defined by a vector function. Such shapes, which we call implicit complexes, are generalizations of implicit surfaces and useful for representing non-smooth and non-manifold structures. While adaptive grid generation has been extensively studied for polygonizing implicit surfaces, few methods are designed for implicit complexes. Our method can generate adaptive grids for several implicit complexes, including arrangements of implicit surfaces, CSG shapes, material interfaces, and curve networks. Importantly, our method adapts the grid to the geometry of not only the implicit surfaces but also their lower-dimensional intersections. We demonstrate how our method enables efficient and detail-preserving discretization of non-trivial implicit shapes.
- 10 April 2014
- Published by Springer Nature in Microbial Ecology
- Vol. 68 (2) , 360-369
Bacterial Community Structure in Two Permafrost Wetlands on the Tibetan Plateau and Sanjiang Plain, China
Permafrost wetlands are important methane emission sources and fragile ecosystems sensitive to climate change. Presently, there remains a lack of knowledge regarding bacterial communities, especially methanotrophs in vast areas of permafrost on the Tibetan Plateau in Northwest China and the Sanjiang Plain (SJ) in Northeast China. In this study, 16S rRNA-based quantitative PCR (qPCR) and 454 pyrosequencing were used to identify bacterial communities in soils sampled from a littoral wetland of Lake Namco on the Tibetan Plateau (NMC) and an alluvial wetland on the SJ. Additionally, methanotroph-specific primers targeting particulate methane monooxygenase subunit A gene (pmoA) were used for qPCR and pyrosequencing analysis of methanotrophic community structure in NMC soils. qPCR analysis revealed the presence of 1010 16S rRNA gene copies per gram of wet soil in both wetlands, with 108 pmoA copies per gram of wet soil in NMC. The two permafrost wetlands showed similar bacterial community compositions, which differed from those reported in other cold environments. Proteobacteria, Actinobacteria , and Chloroflexi were the most abundant phyla in both wetlands, whereas Acidobacteria was prevalent in the acidic wetland SJ only. These four phyla constituted more than 80 % of total bacterial community diversity in permafrost wetland soils, and Methylobacter of type I methanotrophs was overwhelmingly dominant in NMC soils. This study is the first major bacterial sequencing effort of permafrost in the NMC and SJ wetlands, which provides fundamental data for further studies of microbial function in extreme ecosystems under climate change scenarios.
- 10 April 2014
- Published by Springer Nature in Microbial Ecology
- Vol. 68 (2) , 360-369
Bacterial Community Structure in Two Permafrost Wetlands on the Tibetan Plateau and Sanjiang Plain, China
Permafrost wetlands are important methane emission sources and fragile ecosystems sensitive to climate change. Presently, there remains a lack of knowledge regarding bacterial communities, especially methanotrophs in vast areas of permafrost on the Tibetan Plateau in Northwest China and the Sanjiang Plain (SJ) in Northeast China. In this study, 16S rRNA-based quantitative PCR (qPCR) and 454 pyrosequencing were used to identify bacterial communities in soils sampled from a littoral wetland of Lake Namco on the Tibetan Plateau (NMC) and an alluvial wetland on the SJ. Additionally, methanotroph-specific primers targeting particulate methane monooxygenase subunit A gene (pmoA) were used for qPCR and pyrosequencing analysis of methanotrophic community structure in NMC soils. qPCR analysis revealed the presence of 1010 16S rRNA gene copies per gram of wet soil in both wetlands, with 108 pmoA copies per gram of wet soil in NMC. The two permafrost wetlands showed similar bacterial community compositions, which differed from those reported in other cold environments. Proteobacteria, Actinobacteria , and Chloroflexi were the most abundant phyla in both wetlands, whereas Acidobacteria was prevalent in the acidic wetland SJ only. These four phyla constituted more than 80 % of total bacterial community diversity in permafrost wetland soils, and Methylobacter of type I methanotrophs was overwhelmingly dominant in NMC soils. This study is the first major bacterial sequencing effort of permafrost in the NMC and SJ wetlands, which provides fundamental data for further studies of microbial function in extreme ecosystems under climate change scenarios.