SearcharxivSearch

arXiv subjects

Chun-Gang Zhu

Publications and source records attributed to Chun-Gang Zhu.

4 recordsLinked to original sources

Bijectivity analysis of rational T-spline surfaces via Bernstein representations

Ensuring the bijectivity of spline-based parameterizations is fundamental in geometric modeling and isogeometric analysis, as invalid mappings may lead to self-intersections, singular Jacobians, and numerical instability. While T-splines offer enhanced flexibility through local refinement, this flexibility also makes bijectivity verification significantly more challenging. In this work, we propose a rigorous and efficient framework for bijectivity analysis of rational T-spline surfaces based on Bézier extraction. The key idea is to reformulate the T-spline representation into a collection of element-wise rational Bézier patches, on which the Gram determinant of the mapping admits a Bernstein polynomial representation. This enables a coefficient-based analysis of local regularity by exploiting the convex hull and positivity properties of the Bernstein basis. Based on this formulation, we derive a sufficient condition for bijectivity from the nonnegativity of Bernstein coefficients, together with a necessary condition based on the sign consistency of corner coefficients. For cases where these conditions are inconclusive, we introduce a hierarchical subdivision strategy that progressively localizes ambiguous regions and resolves them through refinement. The proposed method provides a certified and adaptive procedure for bijectivity verification that avoids dense numerical sampling and remains computationally efficient. Numerical experiments on complex T-spline geometries demonstrate that the approach accurately detects both valid and near-degenerate configurations, while scaling effectively to large models with thousands of rational Bézier patches. The framework is fully compatible with standard isogeometric analysis workflows.

math.NA

Curve and surface construction based on the generalized toric-Bernstein basis functions

The construction of parametric curve and surface plays important role in computer aided geometric design (CAGD), computer aided design (CAD), and geometric modeling. In this paper, we define a new kind of blending functions associated with a real points set, called generalized toric-Bernstein (GT-Bernstein) basis functions. Then the generalized toric-Bezier (GT-Bézier) curves and surfaces are constructed based on the GT-Bernstein basis functions, which are the projections of the (irrational) toric varieties in fact and the generalizations of the classical rational Bézier curves and surfaces and toric surface patches. Furthermore, we also study the properties of the presented curves and surfaces, including the limiting properties of weights and knots. Some representative examples verify the properties and results.

cs.GR

Total Positivity of A Kind of Generalized Toric-Bernstein Basis

The normalized totally positive bases are widely used in many fields.Based on the generalized Vandermonde determinant, the normalized total positivity of a kind of generalized toric-Bernstein basis is proved, which is defined on a set of real points. By this result, the progressive iterative approximation property of the generalized toric-Bézier curve is obtained.

cs.GR

Degenerations of NURBS curves while all of weights approaching infinity

NURBS curve is widely used in Computer Aided Design and Computer Aided Geometric Design. When a single weight approaches infinity, the limit of a NURBS curve tends to the corresponding control point. In this paper, a kind of control structure of a NURBS curve, called regular control curve, is defined. We prove that the limit of the NURBS curve is exactly its regular control curve when all of weights approach infinity, where each weight is multiplied by a certain one-parameter function tending to infinity, different for each control point. Moreover, some representative examples are presented to show this property and indicate its application for shape deformation.

cs.GR