# T-splines and T-NURCCs

@article{Sederberg2003TsplinesAT, title={T-splines and T-NURCCs}, author={Thomas W. Sederberg and Jianmin Zheng and Almaz Bakenov and Ahmad H. Nasri}, journal={ACM SIGGRAPH 2003 Papers}, year={2003} }

This paper presents a generalization of non-uniform B-spline surfaces called T-splines. T-spline control grids permit T-junctions, so lines of control points need not traverse the entire control grid. T-splines support many valuable operations within a consistent framework, such as local refinement, and the merging of several B-spline surfaces that have different knot vectors into a single gap-free model. The paper focuses on T-splines of degree three, which are C2 (in the absence of multiple…

## Figures and Topics from this paper

## 796 Citations

Locally Refined Splines

- Computer Science
- 2010

There has been filed a patent, United States Patent 7274364, System and method for defining T-spline and T-NURCC surfaces using local refinements, addressing the steps from creating the T-mesh and necessary algorithms for computer implementation of the T -spline concept for surfaces.

T-junctions in Spline Surfaces

- Computer Science, MathematicsACM Trans. Graph.
- 2017

A new way to create smooth piecewise polynomial free-form spline surfaces from quad-meshes that include T-junctions is developed, which is easy to deploy and can provide smooth surfaces with T- junctions where T-splines cannot have a smooth parameterization.

Modified T-splines

- Computer Science, MathematicsComput. Aided Geom. Des.
- 2013

The basic idea is to construct a set of basis functions for a given T-mesh that have the following nice properties: non-negativity, linear independence, partition of unity and compact support.

Polynomial splines over hierarchical T-meshes

- Mathematics, Computer ScienceGraph. Model.
- 2008

A new type of splines-polynomial splines over hierarchical T-meshes (called PHT-splines) to model geometric objects which have the same important properties as B-spline do, such as nonnegativity, local support and partition of unity.

FasTFit: A fast T-spline fitting algorithm

- Mathematics, Computer ScienceComput. Aided Des.
- 2017

This work presents a novel split-connect-fit algorithm to more efficiently perform the T-spline fitting, which is at least an order of magnitude faster than state-of-the-art algorithms while provides comparable or better results in terms of quality and conciseness.

SOME PROPERTIES FOR ANALYSIS-SUITABLE T-SPLINES

- 2015

Analysis-suitable T -splines (AS T -splines) are a mildly topological restricted subset of T -splines which are linear independent regardless of knot values [1–3]. The present paper provides some…

SOME PROPERTIES FOR ANALYSIS-SUITABLE T-SPLINES

- 2015

Analysis-suitable T -splines (AS T -splines) are a mildly topological restricted subset of T -splines which are linear independent regardless of knot values [1–3]. The present paper provides some…

Periodic T-Splines and Tubular Surface Fitting

- Mathematics, Computer ScienceCurves and Surfaces
- 2010

The use of periodic T-splines for tubular surface fitting has at least two advantages: 1) adaptive fitting is easily achieved due to the local refinement of T- Splines; 2) the algorithm avoids cutting the mesh to make it a disk topologically for conventional B-spline fitting due toThe periodic representation and this overcomes the drawback of finding a good cutting path, which is usually difficult.

T-splines and Bézier extraction in modeling shape of boundary in Parametric Integral Equation System for 3D problems of linear elasticity

- 2019

T-splines are a generalization of NURBS surfaces. They retain all the properties of NURBS, but are increasingly considered as a better alternative. While the control points in NURBS lie in a…

Approximate R3-spline surface skinning

- Mathematics, Computer ScienceComput. Aided Des.
- 2012

This paper considers the problem of constructing a smooth surface to fit rows of data points and proposes a skinning algorithm using a special class of T-spline surfaces, characterized to have a global knot vector in one parameter direction and individual knot vectors from row to row in the other parameter direction.

## References

SHOWING 1-10 OF 18 REFERENCES

Hierarchical B-spline refinement

- Mathematics, Computer ScienceSIGGRAPH
- 1988

This work presents a method of localizing the effect of refinement through the use of overlays, which are hierarchically controlled subdivisions, and introduces two editing techniques that are effective when using overlays.

Recursively generated B-spline surfaces on arbitrary topological meshes

- Mathematics
- 1978

Abstract This paper describes a method for recursively generating surfaces that approximate points lying-on a mesh of arbitrary topology. The method is presented as a generalization of a recursive…

4-8 Subdivision

- Computer ScienceComput. Aided Geom. Des.
- 2001

4–8 subdivision is introduced, a new scheme that generalizes the fourdirectional box spline of class C4 to surfaces of arbitrary topological type and it is shown that the subdivision surfaces produced by the 4–8 scheme are C continuous almost everywhere, except at extraordinary vertices where they are is C1-continuous.

Non-uniform recursive subdivision surfaces

- Mathematics, Computer ScienceSIGGRAPH
- 1998

Rules are developed that generalize non-uniform tensor product Bspline surfaces to arbitrary topologies, which allows the natural introduction of features such as cusps, creases, and darts, while elsewhere maintaining the same order of continuity as their uniform counterparts.

√3-subdivision

- Computer ScienceSIGGRAPH
- 2000

A new stationary subdivision scheme is presented which performs slower topological refinement than the usual dyadic split operation and enables locally adaptive refinement under built-in preservation of the mesh consistency without temporary crack-fixing between neighboring faces from different refinement levels.

Blossoms are polar forms

- Mathematics, Computer ScienceComput. Aided Geom. Des.
- 1989

This paper reviews the work of de Casteljau, de Boor, and Ramshaw in an attempt to clarify the basic principles that underly the polar approach and proposes a consistent system of nomenclature as a possible standard.

CHARMS: a simple framework for adaptive simulation

- Computer ScienceACM Trans. Graph.
- 2002

The basic principle of the approach is to refine basis functions, not elements, which removes a number of implementation headaches associated with other approaches and is a general technique independent of domain dimension.

Real-time rendering of trimmed surfaces

- Computer ScienceSIGGRAPH '89
- 1989

Rational tensor product surfaces, (Bézier, NURBS, Hermite, polynomial, etc.) are rendered in real-time by uniform faceting and can be balanced for optimal implementation on different hardware platforms.

Real-time rendering of trimmed surfaces

- Computer Science
- 1989

Rational tensor product surfaces, (Bezier, NURBS, Hermite, polynomial, etc.) are rendered in real-time by uniform faceting. The described methods are modular and can be balanced for optimal ...

T-Splines: Tensor Product B-spline Surfaces with T-Junctions

- Master’s thesis, Brigham Young University.
- 2001