This paper presents a novel scheme for constructing bivariate spline surfaces over triangular meshes which are topologically equivalent to a disk. The core part of the scheme is a set of knot selection rules that define local configurations of a triangulation called the directed-one-ring-cycle (D1RC) configurations and bivariate splines defined over a D1RC configuration that are new non-tensor-product splines and possess many nice properties of a univariate B-spline. Using D1RC splines, we take an input triangular mesh as a control mesh and define a bivariate spline surface from the control mesh, which mimics the standard NURBS modeling. Moreover, we can introduce sharp features into the overall smooth spline surface by simply setting special D1RC configurations. As a result, the proposed scheme can define spline surfaces in a way similar to that of NURBS, but has less restriction on the connectivity of the input control mesh.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

Surface Ricci flow is a powerful tool to design Riemannian metrics by user defined curvatures. Discrete surface Ricci flow has been broadly applied for surface parameterization, shape analysis, and computational topology. Conventional discrete Ricci flow has limitations. For meshes with low quality triangulations, if high conformality is required, the flow may get stuck at the local optimum of the Ricci energy. If convergence to the global optimum is enforced, the conformality may be sacrificed. This work introduces a novel method to generalize the traditional discrete Ricci flow. The generalized Ricci flow is more flexible, more robust and conformal for meshes with low quality triangulations. Conventional method is based on circle packing, which requires two circles on an edge intersect each other at an acute angle. Generalized method allows the two circles either intersect or separate from each other. This greatly improves the flexibility and robustness of the method. Furthermore, the generalized Ricci flow preserves the convexity of the Ricci energy, this ensures the uniqueness of the global optimum. Therefore the algorithm won't get stuck at the local optimum. Generalized discrete Ricci flow algorithms are explained in details for triangle meshes with both Euclidean and hyperbolic background geometries. Its advantages are demonstrated by theoretic proofs and practical applications in graphics, especially surface parameterization.