QZQingnan Zhou

Qingnan Zhou

*This is an algorithmically generated author record based on publicly available information.

Qingnan Zhou has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    CSG Sweeps: Feature-aware sweep surfacing of deformable CSGs

    by Jianjun Xia, Qingnan Zhou, Yiwen Ju, Xingyi Du, Nathan Carr, Tao Ju

    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

    Erratum: Lifted Surfacing of Generalized Sweep Volumes

    by Yiwen Ju, Qingnan Zhou, Xingyi Du, Nathan Carr, Tao Ju

    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

    Lifted Surfacing of Generalized Sweep Volumes

    by Yiwen Ju, Qingnan Zhou, Xingyi Du, Nathan Carr, Tao Ju

    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

    Putting Rigid Bodies to Rest

    by Hossein Baktash, Nicholas Sharp, Qingnan Zhou, Alec Jacobson, Keenan Crane

    This paper explores the analysis and design of the resting configurations of a rigid body, without the use of physical simulation. In particular, given a rigid body in R 3 , we identify all possible stationary points, as well as the probability that the body will stop at these points, assuming a random initial orientation and negligible momentum. The forward version of our method can hence be used to automatically orient models, to provide feedback about object stability during the design process, and to furnish plausible distributions of shape orientation for natural scene modeling. Moreover, a differentiable inverse version of our method lets us design shapes with target resting behavior, such as dice with target, nonuniform probabilities. Here we find solutions that would be nearly impossible to find using classical techniques, such as dice with additional unstable faces that provide more natural overall geometry. From a technical point of view, our key observation is that rolling equilibria can be extracted from the Morse-Smale complex of the support function over the Gauss map. Our method is hence purely geometric, and does not make use of random sampling, or numerical time integration. Yet surprisingly, this purely geometric model makes extremely accurate predictions of rest behavior, which we validate both numerically, and via physical experiments. Moreover, for computing rest statistics, it is orders of magnitude faster than state of the art rigid body simulation, opening the door to inverse design—rather than just forward analysis.

  • Open Access

    Adaptive grid generation for discretizing implicit complexes

    by Yiwen Ju, Xingyi Du, Qingnan Zhou, Nathan Carr, Tao Ju

    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.