# Patent

## Title
Conversion of T-spline models to trim-free T-spline models: functional case

## Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for constructing a trim-free T-spline surface and control mesh for a NURBS surface control grid of a B-rep face; modifying the trim-free T-spline control mesh to align the trim-free T-spline surface boundary with a functional trimming curve; and redefining one or more faces in the modified trim-free T-spline control mesh that is adjacent to the trimming curve as a variable knot spline face.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Application Ser. No. 61/744,827, filed on Oct. 3, 2012 entitled “Conversion of T-Spline Models to Trim-Free T-Spline Models,” the entirety of which is hereby incorporated by reference.


BACKGROUND
This specification relates to computer-aided design (CAD) applications and, in particular, to converting T-spline models to trim-free T-spline models.
Computer-aided design (CAD) can be used to model surfaces that resemble smooth, real-world objects. For example, a boundary representation (B-rep) CAD model typically consists of a collection of surfaces that are augmented using trim curves and that are organized topologically in boundary loops. The B-rep CAD model includes additional geometrical and topological information that represents surface domains in the CAD model. Trim curves can be created using various operations, including, for example, sketching, intersections, and imprinting. Further, trim curves can be defined by complicated geometry that is often more involved mathematically and is more computationally expensive to define than the surfaces that are supporting the curves.
When processing a B-rep CAD model, a downstream algorithm typically has to account for all of the trim curves and boundary loops when determining which regions of the surfaces are included in the model. This added complexity makes some operations, including, for example, direct modeling and simulation, more difficult. As a result, for many downstream operations, such as analysis, a B-rep CAD model is first converted into a simpler trim-free representation, e.g., a polygonal mesh (generally a triangular mesh), which does not require trim curves and boundary loops to define the extent of the model. However, use of polygonal meshes generally results in a loss of precision, sharp features, and important high order geometrical infomiation (e.g., the curvature tensor), and requires a high number of elements. Thus, polygonal meshes are generally a poor substitute for the original surface geometry of a model. Use of polygonal meshes in downstream operations typically results in suboptimal downstream results and, sometimes, outright failures.
SUMMARY
This specification describes a functional case for converting T-spline surfaces with attached boundary representation data, e.g., trim curves, into approximately equivalent trim-free T-spline surfaces (TTS). The trim-free T-spline surfaces can be defined in terms of a trim-free T-spline mesh (TTM). A trim-free T-spline mesh can describe a model, e.g., a B-rep CAD model, without requiring additional geometrical or topological data. As a result, downstream processing of the model is simplified by allowing direct use of trim-free T-spline surfaces for various operations, e.g., simulation, editing, geometry analysis, and evaluation. In some implementations, a surface intersection operation can be used to derive trim curves. In contrast to trimmed non-uniform rational B-spline (NURBS) models, which are generally incapable of being watertight, the surface intersection operation can be used tO produce a watertight CAD model that consists of two or more intersecting surfaces.
In general, one aspect of the subject matter described in this specification can be embodied in a method that includes constructing a trim-free T-spline control mesh for a NURBS surface control grid of a B-rep face; modifying the trim-free T-spline control mesh to align the trim-free T-spline control mesh with a functional trimming curve; and redefining one or more faces in the modified trim-free T-spline control mesh that is adjacent to the trimming curve as a variable knot spline face. Other embodiments of this aspect include corresponding systems, apparatus, and computer program products.
These and other embodiments can optionally include one or more of the following features. Redefining each ace in the trim-free T-spline control mesh that is adjacent to the trimming curve as a variable knot spline face includes labeling knot intervals in a variable knot spline control grid, the variable knot spline control grid corresponding to the control grid of the B-rep face; generating a bicubic surface patch for one or more faces of the variable knot spline control grid; and adjusting control points along a boundary curve for one or more edges in each face that has a degree of six. Generating a bicubic surface patch for one or more faces of the variable knot spline control grid includes generating respective face points for each face of the variable knot spline control grid. Generating respective face points for each face of the variable knot spline control grid further includes computing respective edge and vertex points for each face of the variable knot spline control grid. Generating respective face points for each face of the variable knot spline control grid further includes: generating respective face points for zero knot intervals in the variable knot spline control grid.
A variable knot spline includes T-junctions and redefining each face in the modified trim-free T-spline control mesh that is adjacent to the trimming curve as a variable knot spline face includes: assigning knot intervals to one or more edges that are split by a T-junction extension; defining one or more blending fiinctions for one or more variable knot splines with T-junctions; splitting one or more macro patches into respective sub-patches; determining respective pairs of tangent strips for each edge in the one or more edges; and defining respective outermost two rows of control points for the respective sub-patches based on the respective pairs of tangent strips for the one or more edges. Control points for variable knot splines with T-junctions are linearly mapped to corresponding Bézier control points. Redefining each face in the trim-free T-spline control mesh that is adjacent to the trimming curve as a variable knot spline face further includes: optimizing control point positions in the trim-free T-spline control mesh. The NURBS surface control grid is a T-spline surface control grid.
Particular embodiments of the subject matter described in this specification can be implemented to realize one or more of the following advantages. Downstream processing of a CAD model is simplified by converting boundary representation data, e.g., trim curves, into trim-free T-spline surfaces. Trim-free T-spline surfaces can be used to produce a watertight model consisting of two or more intersecting surfaces. Since a NURBS surface is a special case of a T-spline, a general NURBS surface boundary representation (B-rep) CAD model can also be converted to a trim-free T-spline CAD B-rep model. CAD B-rep models that are converted to trim-free T-spline CAD B-rep models can preserve high order geometry information anduser intent and be significantly more compact to process and store.
Fora CAD model consisting entirely of NURBS surfaces, the original geometry, after conversion, can be preserved everywhere except at a small channel next to the trim curves, where the original geometry is approximated to within a user-supplied tolerance. Both the channel and geometry deviation inside it can be made arbitrarily small, therefore rendering the trim-free T-spline surface appropriate even in cases where very high precision is required for downstream processing. The watertight nature of trim-free T-spline surfaces greatly facilitates downstream operations which are often sensitive to the gaps inherent in trimmed-NURBS models. For example, stereolithography and NC machining software work best with a watertight model. Finite element analysis is another application for which the gaps in B-rep models have been vexing—a major reason for the so-called interoperability problem. Recent advances in the field of finite element analysis make it possible to perform analysis directly on a trim-free T-spline model, without the need to perform mesh generation, and thereby mitigating the interoperability problem.
In a CAD B-rep model, approximately watertight models may be constructed by placing corresponding trimmed surface boundaries as close to one another as possible. Because the model relies on the careful positioning of the trim curves and the trimmed NURBS surfaces in order to be approximately watertight, adjustment to their shape can cause gaps to appear, causing the model to no longer be watertight. However, because the ITS does not depend on its control point positions in order to be watertight, it is possible to modify the shape of the TTS by moving its control points, and after having done so the modelwill continue to be watertight.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram of an example system for generating trim-free T-spline surfaces.
FIG. 2 is a flow diagram of an example technique for generating a trim-free T-spline surface from a NURBS surface.
FIG. 3 is a flow diagram of an example technique for redefining a face in the trim-free T-spline mesh as a variable knot spline face.
FIG. 4 is a flow diagram of an example technique for blending variable knot splines that include T-junctions.
FIG. 5 is an example illustration of a B-rep surface.
FIG. 6 is an example illustration of a control grid for a NURBS surface including a functional trimming curve over which a trim-free T-spline control mesh is constructed.
FIG. 7 is an example illustration of modified trim-free T-spline mesh that is aligned with a control grid for a NURBS surface after intersecting a trimming curve.
FIG. 8 is an example illustration of intersection parameters for intersected edges corresponding to a trim curve.
FIG. 9 is an example illustration of a trim-free T-spline mesh.
FIG. 10 is an example illustration of the sum of knot intervals on one edge of a face in comparison with the SUM of knot intervals on an opposing edge.
FIG. 11 is an example illustration of a trim-free T-spline surface before approximation techniques are applied.
FIG. 12 is an example illustration of a trim-free T-spline surface after approximation techniques are applied.
FIG. 13 is an example of a variable knot spline control grid.
FIG. 14 is an example illustration of a boundary curve between two patches in a variable knot spline.
FIG. 15 is an example illustration of face point construction.
FIG. 16 is an example illustration of computing intermediate points.
FIG. 17 is an example illustration of edge and vertex point construction.
FIG. 18 is an example illustration of a face that maps patches of degree 6×6 prior to degree elevation.
FIG. 19 is an example illustration of a face that maps patches of degree 6×6.
FIG. 20 is an example illustration of a variable knot spline with zero knot intervals.
FIGS. 21A-C are example illustrations of assigning knot intervals to edges that are split by a T-junction extension.
FIG. 22 is an example illustration of knot intervals for a T-junction.
FIGS. 23A-C are example illustrations of a T-VKS.
FIGS. 24A-B are example illustrations of a T-mesh pre-image of a macro patch.
FIGS. 25A-C are example illustrations of defining local knot coordinates for creating tangent strips.
FIG. 26 is an example illustration of splitting a tangent strip
FIGS. 27A-D are example illustrations of a portion of control mesh shown in FIGS. 25A-C.
FIGS. 28A-B are example illustrations of an alternative method for determining control points.
Like reference numbers and designations in the various drawings indicate like elements.



DETAILED DESCRIPTION
FIG. 1 is a high-level illustration of an example CAD system 100 for generating trim-free T-spline surfaces, Although this diagram depicts objects/processes as logically separate, such depiction is merely for illustrative purposes. The objects/processes portrayed in this figure can be arbitrarily combined or divided into separate software, firmware, or hardware components. Furthermore, such objects/processes, regardless of how they are combined or divided, can execute on the same data processing apparatus or can be distributed among different data processing apparatus connected by one or more naworks (e.g., the Internet).
The CAD system 100 includes a computing device 104, e.g., a laptop or desktop computer, that is capable of executing a CAD tool 110 (e.g., a computer graphics program), The CAD system 100 combines capabilities of a CAD program with common spatial management features, The CAD tool 110 includes, without limitation, a trim-free T-spline surfaces generator 140 and a graphical user interface 150. The CAD tool 110 allows a user 102 to generate and/or load CAD models that describe three-dimensional representations of objects, e.g., models of curved objects, In sonic implementations, the computing device 104 is configured to interact with the CAD tool 110 through a cloud service. The representation can be viewed and, optionally, modified, through the user interface 150. The representation may be freely modeled by the user through the user interface 150 using CAD tool 110. The trim-free T-spline surfaces generator 140 is configured to convert T-spline surfaces, e.g., a B-rep face, into trim-free T-spline surfaces, as described below in reference to FIGS. 2-4.
FIG. 2 is a flow diagram of an example technique 200 for generating a trim-free T-spline surface from a NURBS surface. For convenience, the technique 200 will be described with respect to a system, including one or more data processing apparatus, that performs the technique 200. For example, the technique 200 can be performed by a CAD system, e.g., CAD system 100 of FIG. 1.
The system constructs a trim-free T-spline control mesh to be identical to a control grid of an input B-rep face (202). The untrimmed surface can be, for example, a B-rep face, as shown in FIG. 5. The untrimmed surface S(s, t) of degree ds×dT can be defined by knot vectors [s0, s1, . . . , sN]×[t0, t1, . . . , tM] and a control point grid ={Pij}i=0 . . . N−ds−1, j=0. . . M−dT−1 with or without assigned weights. For simplicity of the presentation and without loss of generality, we assume that S is provided in clamped form. That is, s0=s1=. . . =sds, sN=sN−1=. . . =sN−ds, t0=t1=. . . =tdT andt tM=tM−1=. . . =tM−dT. We will, equivalently, represent the knot information in terms of knot intervals.
Further, the untrimmed surface includes a smooth (at least G1) functional trimming curve ĉ(u), uε[u0, u1] defined in the domain of the surface S. G1 means first-order geometric continuity. A curve is G1 if it has a continuous tangent direction at each point. A functional trim curve (TC) intersects two opposite boundaries of S and is strictly monotonic in the surface parameter changing between the two opposite boundaries. ĉ(u) is a curve in arbitrary representation (not necessarily NURBS) in the domain of S defined by the pair of functions ĉ(u)=(ŝ(u), {circumflex over (t)}(u)). As used in this specification, ĉ(u) is s-functional when ŝ(u) is monotonic, ŝ(u0)=s0, and ŝ(u1)=sN (or ŝ(u0)=sN, and ŝ(u1)=s0). Correspondingly, ĉ(u) is t-functional when {circumflex over (t)}(u) is monotonic, {circumflex over (t)}(u0)=t0, and {circumflex over (t)}(u1)=tM (or {circumflex over (t)}(u0)=tM, and {circumflex over (t)}(u1)=t0). The image of ĉ(u)=S(ĉ(u))=S(ŝ(u), {circumflex over (t)}(u)) is a curve lying on the surface S that defines the trim boundary of the input B-rep face.
FIG. 6 illustrates a control grid 600 for a NURBS surface including a functional trimming curve ĉ(u) over which a trim-free T-spline control mesh is constructed. The control grid represents both the NURBS control grid and also the knot lines in the (s, t parameter domain. In FIG. 5, the NURBS surface is bicubic ds=dT=3, however, generalization to other degree input is possible. As shown in FIG. 6, the functional trimming curve ĉ(u) 602 is s-fnctional and the knot intervals, in the s- and t-parameter directions are, respectively, [0, 0, d1d2, . . . , d6, 0, 0] and [. . . , e1, e2, . . . , e6, . . . ].
The system modifies the trim-free T-spline mesh to align the mesh with the trimming curve ĉ(u) (204). In some implementations, the system modifies the trim-free T-spline mesh by intersecting the trimming curve ĉ(u) with the vertical knot lines. As shown in FIG. 6, the trimming curve ĉ(u) is intersected with the vertical knot lines at intersection points 604, 608, 610, 612, 614, and 616.
FIG. 7 illustrates a modified trim-free T-spline mesh 700 that is aligned with a control grid for a NURBS surface after intersecting a trimming curve ĉ(u). As shown in FIG. 7, each vertical column 704, 706, 708, 710, 712, 714, and 716, is cut and each horizontal edge segment 718, 720, 722, 724, and 726, whose pre-image intersects ĉ(u) is removed, as are all portions of the control grid that lie above ĉ(u).
The system next determines control points for a boundary curve that approximates c(u). When determining control points, the system first determines intersection parameters for the intersected edges. For example, as shown in FIG. 8, the system denotes using [δ0, δ1, . . . , δ6] the intersection parameters for the intersected edges 804, 806, 808, 810, 812, 814, and 816 corresponding to the trim curve 802. Next, each column of control points of the trim-free T-spline mesh is considered as independent NURBS curves. For example, referring to FIG. 8, each column of control points of the trim-free T-spline mesh is considered as independent NURBS curves {bj(t)}j=0 . . .6 with a knot vector [t0=0, t0, t0, t0, t1=t0+e1, t2=t1+e2, . . . , t6=t5+e6, t6, t6, t6]. For each bj the system inserts a triple knot at the respective intersection point. For example, as shown in FIG. 8, at b1(t), the intersection 806 is at the edge on the fifth row (knot interval e5) and the intersection parameter is δ1. The triple knot is inserted at t*=t4+δ1=e1+e2+e3+e4+δ1. The system then trims the curve at t* while retaining the segment in [0 . . . t*] resulting in a trimmed curve {tilde over (b)}1(t) with knot vector [t0, . . . , t4, t*, t*, t*, t*]. The system merges all trimmed curves {tilde over (b)}j(t) to construct the trim-free T-spline mesh, as shown in FIG. 9.
In some implementations, the system performs the triple knot insertion in terms of knot intervals instead of knot values. Using FIG. 8 as an example, the system can generate control points Q1, Q2, Q3, Q4 in terms of the initial NURBS control points P1, P2, P3, P4 as follows:




  
    
      
        
          Q
          1
        
        =
        
        ⁢
        
          P
          1
        
      
    
  
  
    
      
        
          
            Q
            2
          
          =
          
          ⁢
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  P
                  1
                
              
              +
              
                
                  (
                  
                    
                      e
                      3
                    
                    +
                    
                      e
                      4
                    
                    +
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  P
                  2
                
              
            
            
              
                e
                3
              
              +
              
                e
                4
              
              +
              
                e
                5
              
            
          
        
        ,
      
    
  
  
    
      
        
          
            Q
            3
          
          =
          
          ⁢
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  Q
                  2
                
              
              +
              
                
                  (
                  
                    
                      e
                      4
                    
                    +
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                A
              
            
            
              
                e
                4
              
              +
              
                e
                5
              
            
          
        
        ,
      
    
  
  
    
      
        
          
            Q
            4
          
          =
          
          ⁢
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  Q
                  3
                
              
              +
              
                
                  δ
                  1
                
                ⁢
                C
              
            
            
              e
              5
            
          
        
        ,
        where
      
    
  
  
    
      
        
          A
          =
          
          ⁢
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    +
                    
                      e
                      6
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  P
                  2
                
              
              +
              
                
                  (
                  
                    
                      e
                      4
                    
                    +
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  P
                  3
                
              
            
            
              
                e
                4
              
              +
              
                e
                5
              
              +
              
                e
                6
              
            
          
        
        ,
      
    
  
  
    
      
        
          B
          =
          
          ⁢
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    +
                    
                      e
                      6
                    
                    +
                    
                      e
                      7
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                
                  P
                  3
                
              
              +
              
                
                  δ
                  1
                
                ⁢
                
                  P
                  4
                
              
            
            
              
                e
                5
              
              +
              
                e
                6
              
              +
              
                e
                7
              
            
          
        
        ,
        and
      
    
  
  
    
      
        C
        =
        
        ⁢
        
          
            
              
                
                  (
                  
                    
                      e
                      5
                    
                    +
                    
                      e
                      6
                    
                    -
                    
                      δ
                      1
                    
                  
                  )
                
                ⁢
                A
              
              +
              
                
                  δ
                  1
                
                ⁢
                B
              
            
            
              
                e
                5
              
              +
              
                e
                6
              
            
          
          .
        
      
    
  




The system redefines each face in the trim-free T-spline mesh that is adjacent to the trimming curve ĉ(u) boundary as a variable knot spline face (206). Generally, both NUMBS and T-spline control grids require the sum of knot intervals on one edge of a face to equal the sum of knot intervals on an opposing edge. For example, referring to FIG. 10, the face 1002 satisfies this requirement. The face 1004, however, does not satisfy this requirement because δ3≠δ4 and {tilde over (d)}4 edge 1008 is not equal to d4 edge 1010. Similarly, the face 1006 does not satisfy this requirement because edge 1012 (e3+δ2) is not equal to edge 1014 (δ3) and edge 1016 ({tilde over (d)}3) is not equal to edge 1018 (d3). As a result, the control grid shown in FIG. 10 cannot be used as a T-spline control grid. To remedy such a control grid, the system redefines each face in the trim-free T-spline mesh that is adjacent to the trimming curve ĉ(u) boundary as a variable knot spline face.
In a variable knot spline (VKS), when the sum of knot intervals on one edge of a face is equal to the sum of knot intervals on an opposing edge, the VKS is treated as a T-spline. However, if the sum of knot intervals on one edge of a face is not equal to the sum of knot intervals on an opposing edge, the VKS produces a smooth surface that is made up of a finite number of G1 surface patches of degree 6×6. Redefining faces as variable knot spline faces is described in reference to FIGS. 3 and 4.
The system optimizes control point positions in the trim-free T-spline mesh (208). At this point, the trim-free T-spline geometry is a reasonable approximation of the input B-rep face. The system can further reline this approximation by applying global optimization of the control points in the vicinity of the TTM trim boundary. Accordingly, the system applies the following approximation techniques to reposition the control points in a limited band around the trim boundary edges ρ. As a result of repositioning the control points, the trim-free T-spline geometry deviation is reduced to a specified tolerance ε>0. FIG. 11 illustrates a trim-free T-spline surface before the approximation techniques are applied. Note that this trim-free T-spline surface does not match the original surface within tolerance. FIG. 12 illustrates the trim-free T-spline surface after the approximation techniques are applied. In FIG. 12, the trim-free T-spline surface includes additional control points and topology, where necessary, and depicts approximation of the trim-free T-spline surface as being sufficiently accurate.
A first approximation technique is a trimming curve approximation. When applying the trimming curve approximation technique, the system approximates a curve c(u) with the corresponding TTS T boundary, e.g., the boundary of the surface in the t parameter direction, β(r) by fitting the boundary control points (Q4) to corresponding positional samples on the curve c(u). The system then interpolates the required number of geometrical properties at the corner points (e.g., tangent direction, curvature). Once this is complete, the system checks the accuracy of the corresponding T boundary β(r) by sampling the curve c(u) in-between the interpolated samples. Next, the system splits the boundary edges ρ where the specified tolerance is violated. These steps are repeated until the trim-free T-spline geometry deviation is reduced to the specified tolerance.
A second approximation technique is boundary tangent field approximation. When applying boundary tangent field approximation, the system first interpolates the mixed input B-rep face derivative ∂S/∂s∂t at the corner points. The system then interpolates the sampled cross-boundary first derivatives of S along the T boundaries using the second row (Q3) of interior control points at the trim boundary. If a boundary tangent field error tolerance is provided, the system checks the approximation and refines the T boundaries if the accuracy tolerance is not satisfied. The system continues interpolating the sampled cross-boundary first derivatives of the input surface S along the T boundaries using the second row (Q3) of interior control points at the trim boundary and checks the approximation and refines the T boundaries if the accuracy tolerance is not satisfied, until the tolerance is satisfied.
A third approximation technique is interior approximation, When applying interior approximation, the system determines the interior region of the TTS affected by the operations described above. Next, the system selects the third row of interior control points at the trim boundary (Q2). The system then solves a constrained least squares problem to reposition these control points to minimize the approximation error between S and T. The system checks the T accuracy by sampling further points inside the affected region and splits the faces where the tolerance is not satisfied. The system continues solving the constrained least squares problem to reposition these control points to minimize the approximation error between S and T, checking the T accuracy by sampling further points inside the affected region, and splits the faces where the tolerance is not satisfied, until the tolerance is satisfied.
FIG. 3 is a flow diagram of an example technique 300 for redefining a face in the trim-free T-spline mesh as a variable knot spline face. For convenience, the technique 300 will be described with respect to a system, including one or more data processing apparatus, that performs the technique 300. For example, the technique 300 can be performed by a CAD system, e.g., CAD system 100 of FIG. 1.
The system labels knot intervals in VKS control grid (302). For example, as shown in FIG. 13, each face of the VKS control grid 1300 corresponds to one patch on the surface. The degree of each patch can be bicubic, 3×6, 6×3, or 6×6. The degree of a patch is determined by the degree of its boundary curves. Referring to FIG, 14, if dijdi+1,j+1−di,j+1di+1,j=0, then the degree of the boundary curve is three. Otherwise, the degree of the boundary curve is six.
The system computes a bicubic surface patch Qij3×3 for each face Fij of the VKS control grid (304).
The system computes face points for each face of the VKS control grid (306). The system computes each face point Fijk using the conventional construction for extracting Bézier patches from a bicubic NURBS surface, as shown in FIG. 15. More specifically, for each Fijk, the system uses the knot intervals relative to the face point's closest control point Pij. Referring to FIG. 16, the system begins computing face points by computing eight intermediate points Hi and Vi, i=0,1,2,3.
The system defines a function for computing face points. One example of such a function is:




  
    
      
        
          
            G
            ⁡
            
              (
              
                
                  P
                  1
                
                ,
                
                  P
                  2
                
                ,
                a
                ,
                b
                ,
                c
              
              )
            
          
          =
          
            
              
                
                  (
                  
                    b
                    +
                    c
                  
                  )
                
                ⁢
                
                  P
                  1
                
              
              +
              
                a
                ⁢
                
                  
                
                ⁢
                
                  P
                  2
                
              
            
            
              a
              +
              b
              +
              c
            
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




where a, b, c are double-precision floating point values, real numbers, or scalar values, and P1 and P2 are points. Using Equation 1, the system determines the intermediate points Hi and Vi as follows.
H0=G(Pij, Pi,j+1, ei,j−1, ei,j, ei,j+1),
H1=G(Pi+1,j, Pi+1,j+1, ei+1,j−1, ei+1,j, ei+1,j+1),
H2=G(Pi+1,j+1, Pi+1,j, ei+1,j+1, ei+1,j, ei+1,j+1),
H3=G(Pi,j+1, Pij, ei,j+1, ei,j, ei,j−1),
V0=G(Pij, Pi+1,j, di−1,j, di,j, di+1,j),
V1=G(Pi+1,j, Pij, di+1,j, di,j, di−1,j),
V2=G(Pi+1,j+1, Pi,j+1, di+1,j+1, di,j+1, di−1,j+1),
V3=G(Pi,j+1, Pi+1,j+1, di−1,j+1, di,j+1, di+1,j+1).
The system defines a respective measure of how “non-uniform” each of the four boundary edges is:
δleft=|di−1,jdi,j+1−di,jdi−1,j+1|,
δright=|di+1,jdi,j+1−di,jdi+1,j+1|,
δtop=|ei+1,jei,j+1−ei,jei+1,j+1|,
δbottom=|ei+1,jei,j−1−ei,jei+1,j−1|.
The system then computes the face points using the following table:















If
then
else









δbottom ≧ δleft
Fij0 = Vij0
Fij0 = Hij0



δbottom ≧ δright
Fij1 = Vij1
Fij1 = Hij1



δtop ≧ δright
Fij2 = Vij2
Fij2 = Hij2



δtop ≧ δleft
Fij3 = Vij3
Fij3 = Hij3










where:
Hij0=G(H0, H1, di−1,j, di,j, di+1,j),
Hi+1,j1=G(H1, H0, di+1,j, di,j, di−1,j),
Hi+1,j+12=G(H2, H3, di+1,j+1, di,j+1, di−1,j+1),
Hi,j+13=G(H3, H2, di−1,j+1, di,j+1, di+1,j+1),
Vij0=G(V0, V3, ei,j−1, ei,j, ei,j+1),
Vi+1,j+11=G(V2, V1, ei+1,j+1, ei+1,j, ei+1,j−1),
Vi+1,j2=G(V1, V2, ee+1,j−1, ei+1,j, ei+1,j+1),
Vi,j+13=G(V3, V0, ei,j+1, ei,j, ei,j−1).
If the knot intervals satisfy the NURBS rules, then δbottom=δtop=δleft=δright=0 and Hi,jk=Vi,jk.
The system computes edge and vertex points for each face of the VKS control grid (308). Referring to FIG. 17, the system computes each edge point Ei,jk and vertex point Vi,j using the conventional construction for extracting Bézier patches from a bicubic NURBS surface, using the knot intervals aligned with Pij to form knot vectors of a bicubic NURBS surface. For each bicubic face Vi,jk, a respective Qij3×3 is the patch corresponding to that face.
The system degree elevates each face that is not bicubic (310). In particular, for each face Fij that is not bicubic, the system degree elevates Qij3×3 to produce {tilde over (Q)}ij3×6, {tilde over (Q)}ij6×3, or {tilde over (Q)}ij6×6, as appropriate. Each degree-elevated patch is not G1 continuous with all of its neighbors, so the final step is to adjust some control points of each degree-elevated patch to enforce G1 continuity.
The system adjusts control points along a boundary curve for each degree-six edge (312). In particular, the system adjusts, for each degree-six edge, some control points along the boundary curve to assure G1 continuity. FIGS. 18 and 19 illustrate two faces that map patches of degree 6×6, since the knot intervals at opposite edges are not equal. FIG. 18 illustrates control points from Qij3×3 and Qi,j−13×3. FIG. 19 shows control points from {tilde over (Q)}i,j−16×6 and {tilde over (Q)}ij6×6In this case, G1 continuity is obtained by adjusting {tilde over (B)}i by defining:




  
    
      a
      0
    
    =
    
      
        e
        
          i
          ,
          
            j
            -
            1
          
        
      
      
        
          e
          
            i
            ,
            
              j
              -
              1
            
          
        
        +
        
          e
          
            i
            ,
            j
          
        
      
    
  
  ,
  
    
      a
      1
    
    =
    
      
        e
        
          
            i
            +
            1
          
          ,
          
            j
            -
            1
          
        
      
      
        
          e
          
            
              i
              +
              1
            
            ,
            
              j
              -
              1
            
          
        
        +
        
          e
          
            
              i
              +
              1
            
            ,
            j
          
        
      
    
  
  ,
  
    
      c
      0
    
    =
    
      1
      -
      
        a
        0
      
    
  
  ,
  
    
      c
      1
    
    =
    
      1
      -
      
        
          a
          1
        
        .
      
    
  




The system defines two polynomials in Bernstein form:

a(t)=a0(1−t)3+a13t(1−t)2+a13t2(1−t)+a1t4, c(t)=1−a(t)  (2)

G1 continuity is achieved by adjusting the control points of {tilde over (B)}(t), thereby creating a new degree-six boundary curve {tilde over (B)}(t) where:
B(t)=a(t)C(t)+c(t)A(t).
The control points {tilde over (B)}i are:
{tilde over (B)}0={tilde over (B)}0, {tilde over (B)}1={tilde over (B)}1, {tilde over (B)}5={tilde over (B)}5, {tilde over (B)}6={tilde over (B)}6 
Denoting f(i,j)=aiCj+ciAj, the system determines:




  
    
      
        
          
            B
            ~
          
          2
        
        =
        
          
            
              f
              ⁡
              
                (
                
                  1
                  ,
                  0
                
                )
              
            
            +
            
              3
              ⁢
              
                f
                ⁡
                
                  (
                  
                    0
                    ,
                    1
                  
                  )
                
              
            
            +
            
              f
              ⁡
              
                (
                
                  0
                  ,
                  2
                
                )
              
            
          
          5
        
      
    
    
      
        (
        3
        )
      
    
  








  
    
      
        
          
            B
            ~
          
          3
        
        =
        
          
            
              f
              ⁡
              
                (
                
                  1
                  ,
                  0
                
                )
              
            
            +
            
              9
              ⁢
              
                f
                ⁡
                
                  (
                  
                    1
                    ,
                    1
                  
                  )
                
              
            
            +
            
              9
              ⁢
              
                f
                ⁡
                
                  (
                  
                    0
                    ,
                    2
                  
                  )
                
              
            
            +
            
              f
              ⁡
              
                (
                
                  0
                  ,
                  3
                
                )
              
            
          
          20
        
      
    
    
      
        (
        4
        )
      
    
  








  
    
      
        
          
            B
            ~
          
          4
        
        =
        
          
            
              f
              ⁡
              
                (
                
                  1
                  ,
                  1
                
                )
              
            
            +
            
              3
              ⁢
              
                
              
              ⁢
              
                f
                ⁡
                
                  (
                  
                    1
                    ,
                    2
                  
                  )
                
              
            
            +
            
              f
              ⁡
              
                (
                
                  0
                  ,
                  3
                
                )
              
            
          
          5
        
      
    
    
      
        (
        5
        )
      
    
  




The connecting functions a(t) and c(t) having zero derivatives at t=0 and t=1 is significant for this application to variable knot splines. For our purposes, any edge that is constructed using the techniques described above is referred to as a Variable-Knot G1 (VKG1). For example, if two Bézier patches share a VKG1 edge, then the connecting frame a(t) and c(t) have zero derivatives at t=0 and t=1. In particular, if ei,jei+1,j−1=ei,j−1ei+1,j, then VKG1 is equivalent to C1.
In some implementations, the system generates face points for zero knot intervals. Zero knot intervals are valuable because they allow more control over the boundary curves and tangency along the boundary curves. The face points in the case of a zero knot interval are functions of a single row of VKS control points. There is no Bézier patch associated with a zero knot interval strip, and the Bézier patches on either side of a degenerate Bézier patch are joined with G1 continuity using the technique 300, described above. FIG. 20 illustrates an example VKS with zero knot intervals.
FIG. 4 is a flow diagram of an example technique for blending variable knot splines that include T-junctions. For convenience, the technique 400 will be described with respect to a system, including one or more data processing apparatus, that performs the technique 400. For example, the technique 400 can be performed by a CAD system, e.g., CAD system 100 of FIG. 1.
The system assigns knot intervals to edges that are split by a T-junction extension (402). Referring to FIGS. 21A and 21B, edges that correspond to edges in a control grid are illustrated using solid lines (“hard edges”) while edges created by extending T-Junctions are illustrated using dashed lines (“soft edges”). The rules for determining knot intervals for hard edges are that the sum of the new knot intervals along an edge equals the sum of the original knot intervals along the edge, and the ratios of the knot intervals along an edge equal the ratios of the knot intervals along the opposing edge. If we denote using B the sum of all knot intervals along the top edge and γ as the sum of all knot intervals along the left edge, then




  
    
      
        δ
        ~
      
      i
    
    =
    
      
        
          δ
          _
        
        
          γ
          _
        
      
      ⁢
      
        
          γ
          _
        
        i
      
    
  
  ,
  
    
      
        β
        ~
      
      i
    
    =
    
      
        
          β
          _
        
        
          α
          _
        
      
      ⁢
      
        
          
            α
            ~
          
          i
        
        .
      
    
  




Knot intervals for soft edges are computed using linear interpolation. Referring to FIG. 21C, each soft edge lies in a rectangle that contains two hard edges that are parallel to the soft edge. As shown in FIG. 21C, we are given the knot intervals γ0 and γ4for the corresponding hard edges. To compute knot intervals γ1, γ2, and γ3, the system defines a function for linear interpolation:

γ(t)=γ0(1−t)+γ4t, 

The system then assigns γi=γ(ti), where




  
    t
    i
  
  =
  
    
      
        ∑
        
          j
          =
          1
        
        i
      
      ⁢
      
        
          α
          ~
        
        J
      
    
    
      α
      _
    
  




and α is the sum of all the α J.

Thus, referring to FIG. 22, for example, the system can assign knot intervals according to:




  
    
      e
      2
    
    =
    
      
        
          d
          2
        
        
          
            d
            1
          
          +
          
            d
            2
          
        
      
      ⁢
      e
    
  
  ,
  
    
      e
      1
    
    =
    
      
        
          d
          1
        
        
          
            d
            1
          
          +
          
            d
            2
          
        
      
      ⁢
      
        e
        .
      
    
  




The system defines blending functions for a VKS with T-junctions (404). A VKS with T-junctions (“T-VKS”) can be decomposed into a set of Bézier patches so there is a linear map between the T-VKS control points and the Bézier control points. FIGS. 23A-C illustrate an example T-VKS. Each blending function is made up of 16 “macro patches” whose domains are outlined using bold lines in FIGS. 23B. Each macro patch is made up of one or more Bézier patches that are referred to as sub-patches. As used in this specification, there are two different versions of a macro patch. A “bicubic” macro patch is defined by the face, edge, and vertex points, as described in steps 306 and 308 in reference to FIG. 3. A “final” macro patch is a degree 6×6 patch after continuity adjustments have been made. The coefficients of the blending function are scalars. The 16 bicubic macro-patches are obtained from the VKS, as shown in FIG. 23C, where the coefficients of 24 of the VKS control points are zero and the other coefficient is one. Further, nine of the macro patches in FIG. 23C consist of a single sub-patch. The control points of the final version of such patches obtained using the technique 300 described in reference to FIG. 3. The other seven macro patches in FIG. 23C are split into two or more sub-patches, as described below.
The system splits macro patches into sub-patches (406). The process for splitting a macro patch into sub-patches satisfies three conditions. First, if the knot intervals satisfy the T-spline knot interval requirements, e.g., the sum of all knot intervals on one side of a face equals the sum of knot intervals on the opposing side, the procedure must replicate T-splines, Second, if there are no T-junctions, the procedure must replicate VKS. Third, the connecting functions between each pair of adjacent sub-patches must be the same for all blending functions in which that pair of sub-patches appears. The second and third conditions require that all edges must be VKG1, as described in reference to FIG. 3.
An example T-mesh pre-image of a macro patch is illustrated in FIG. 24A. The domain of each macro patch is split topologically into rectangles, which are the domains of the sub-patches, that are bounded by hard or soft edges that meet at vertices, as shown in FIG. 24B.
The system determines a pair of tangent strips for each edge and then uses those tangent strips to define the outermost two rows of control points for the sub-patches (408). A tangent strip is a degree 1×6 Bézier patch that defines the first partial derivative vector function along each hard and soft edge. In particular, the tangent strip is the first two rows of control points of a degree 6×6 Bézier patch.
To create a tangent strip, the system first defines “local knot coordinates” with respect to each vertex by temporarily extending all T-Junctions within the macro patch all the way across the patch. Referring to FIG. 25A, the system computes the local knot coordinates for P43 which lies on the 4th column and 3rd row by first determining the knot intervals di for the edges made up of the rows of edges that contain P43. The local s knot coordinate for P43 is then:




  
    S
    i
    43
  
  =
  
    
      
        
          ∑
          
            j
            =
            1
          
          i
        
        ⁢
        
          d
          j
        
      
      
        
          ∑
          
            j
            =
            1
          
          6
        
        ⁢
        
          d
          j
        
      
    
    .
  




The local t knot coordinate for P43 is computed similarly using the column of edges containing P43. The local knot coordinates for P43 are thus (s443, t343). The local knot values illustrated in FIG. 25A are generally different with respect to different vertices, however, Siij≦si+1i+1,j and tiij≦tj+1i,j+1 are assured. It is possible for two vertices on different rows and columns to have the same local knot coordinates.
Tangent strips for hard edges are created for each portion of the hard edge that is bounded by control points. The system begins computing the tangent strips by computing Ai and Ci Bézier control points. As described above, the macro patch is a bictibic Bézier patch over the [0,1]×[0,1] domain. Thus, the macro patch's bottom row of control points have polar labels (0,0,0)×(0,0,0), (1.0,0)×(0,0,0), (1,1,0)×(0,0,0), and (1,1,1)×(0,0,0). The Ai and Ci have the following polar labels:
A0=(s232, s332, s332)×(t232, t232, t232), C0=(s332, s332, s432)×(t232, t232, t232)
A1=(s232, s332, s332)×(t232, t232, t532), C1=(s332, s332, s432)×(t232, t232, t532)
A2=(s235, s335, s335)×(t235, t535, t535), C2=(s335, s335, s435)×(t235, t535, t535)
A3=(s235, s335, s335)×(t535, t535, t535), C3=(s335, s335, s435)×(t535, t535, t535)
If the coefficients of the 16 coefficients for the macro patch are fi,j, then these polar values can be computed as follows:




  
    
      (
      
        
          s
          1
        
        ,
        
          s
          2
        
        ,
        
          s
          3
        
      
      )
    
    ×
    
      (
      
        
          t
          1
        
        ,
        
          t
          2
        
        ,
        
          t
          3
        
      
      )
    
  
  =
  
    
      T
      ⁡
      
        [
        
          
            
              
                f
                03
              
            
            
              
                f
                13
              
            
            
              
                f
                23
              
            
            
              
                f
                33
              
            
          
          
            
              
                f
                02
              
            
            
              
                f
                12
              
            
            
              
                f
                22
              
            
            
              
                f
                32
              
            
          
          
            
              
                f
                03
              
            
            
              
                f
                11
              
            
            
              
                f
                21
              
            
            
              
                f
                31
              
            
          
          
            
              
                f
                00
              
            
            
              
                f
                10
              
            
            
              
                f
                20
              
            
            
              
                f
                30
              
            
          
        
        ]
      
    
    ⁢
    
      S
      T
    
  




where:
T=[t1t2t3, t1t2 t3+t1 t2t3+ t1t2t3, t1 t2 t3+ t1t2 t3+ t1 t2t3, t1 t2 t3],
S=[ s1 s2 s3, s1 s2 s3+ s1s2 s3+ s1 s2s3, s1s2 s3+s1 s2s3+ s1s2s3, s1s2s3],
with si=(1−si) and ti=(1−ti).
The system then computes the points Ãi, {tilde over (B)}i, {tilde over (C)}i using the technique described in reference to FIG. 3. For hard edges that are intersected by one or more soft edges, the tangent strip is split at the soft edges using the de Casteljau algorithm. For example, the tangent strip in FIG. 25C is split twice, as shown in FIG. 26. If a soft edge terminates at hard edge, e.g., from the side of the Ãi curve, the system makes a copy of the {tilde over (B)}i control points and then splits the Ãi curve and one copy of the {tilde over (B)}i curve. If two hard edges meet at a. vertex, then their tangent strips will share several control points. -Note that in the construction described, shared control points will always be in identical positions. If the green edge is an outer boundary of the blending function, then the Ai and Ci points are all zero.
The system then computes tangent strips for soft edges. For a soft edge segment that terminates at a hard edge, the two final control points for its tangent strip are taken from the hard edge. FIGS. 27A-D illustrate a portion of the control mesh from FIGS. 25A-C, where B0 is heated at knot coordinates (2, 4). Accordingly, the system beings by computing control points:
B0=(s224, s224, s224)×(t424, t424, t424), A0=(s224, s224, s224)×(t424, t424, t524)
B1=(s224, s224, s324)×(t424, t424, t424), A1=(s224, s224, s324)×(t424, t424, t524).
Since these control points are for bicubic Bézier patches, we “degree elevate” these control points so that they can serve as control points for the degree six tangent strips:




  
    
      
        B
        ~
      
      0
    
    =
    
      B
      0
    
  
  ,
  
    
      
        B
        ~
      
      1
    
    =
    
      
        
          B
          0
        
        +
        
          B
          1
        
      
      2
    
  
  ,
  
    
      
        A
        ~
      
      0
    
    =
    
      
        
          A
          0
        
        +
        
          B
          0
        
      
      2
    
  
  ,
  
    
      
        A
        ~
      
      1
    
    =
    
      
        
          
            A
            0
          
          +
          
            A
            1
          
          +
          
            B
            0
          
          +
          
            B
            1
          
        
        4
      
      .
    
  




From these degree elevated control points, the system computes:




  
    
      
        
          A
          ~
        
        _
      
      2
    
    =
    
      
        
          2
          ⁢
          
            
          
          ⁢
          
            
              A
              ~
            
            5
          
        
        -
        
          
            A
            ~
          
          6
        
        +
        
          6
          ⁢
          
            
          
          ⁢
          
            
              A
              ~
            
            1
          
        
        -
        
          2
          ⁢
          
            
          
          ⁢
          
            
              A
              ~
            
            0
          
        
      
      5
    
  
  ,
  
    
      A
      3
    
    =
    
      
        
          
            -
            4
          
          ⁢
          
            
              A
              ~
            
            6
          
        
        +
        
          9
          ⁢
          
            
              A
              ~
            
            5
          
        
        +
        
          9
          ⁢
          
            
              A
              ~
            
            1
          
        
        -
        
          4
          ⁢
          
            
              A
              ~
            
            0
          
        
      
      10
    
  
  ,
  
    
      
        A
        ~
      
      4
    
    =
    
      
        
          
            -
            2
          
          ⁢
          
            
              A
              ~
            
            6
          
        
        +
        
          6
          ⁢
          
            
              A
              ~
            
            5
          
        
        +
        
          2
          ⁢
          
            
              A
              ~
            
            1
          
        
        -
        
          
            A
            ~
          
          0
        
      
      5
    
  
  ,
  
    

  
  ⁢
  
    
      
        B
        ~
      
      2
    
    =
    
      
        
          2
          ⁢
          
            
          
          ⁢
          
            
              B
              ~
            
            5
          
        
        -
        
          
            B
            ~
          
          6
        
        +
        
          6
          ⁢
          
            
          
          ⁢
          
            
              B
              ~
            
            1
          
        
        -
        
          2
          ⁢
          
            
          
          ⁢
          
            
              B
              ~
            
            0
          
        
      
      5
    
  
  ,
  
    
      
        B
        ~
      
      3
    
    =
    
      
        
          
            -
            4
          
          ⁢
          
            
              B
              ~
            
            6
          
        
        +
        
          9
          ⁢
          
            
              B
              ~
            
            5
          
        
        +
        
          9
          ⁢
          
            
              B
              ~
            
            1
          
        
        -
        
          4
          ⁢
          
            
              B
              ~
            
            0
          
        
      
      10
    
  
  ,
  
    
      
        B
        ~
      
      4
    
    =
    
      
        
          
            
              -
              2
            
            ⁢
            
              
            
            ⁢
            
              
                B
                ~
              
              6
            
          
          +
          
            6
            ⁢
            
              
            
            ⁢
            
              
                B
                ~
              
              5
            
          
          +
          
            2
            ⁢
            
              
            
            ⁢
            
              
                B
                ~
              
              1
            
          
          -
          
            
              B
              ~
            
            0
          
        
        5
      
      .
    
  




Consequently, the tangent strip control points form the outer two rows of control points for each edge of each sub-patch, as shown in FIG. 27A. Next, the system computes the nine interior control points, as shown in the dotted box 2702. The nine interior control points are computed as linear combinations for the 16 blue control points, as shown in the dotted boxes 2704. FIG. 27A-C illustrate the masks for computing each of the nine control points from the 16 corner control points. Upon completing this computation, the system has determined control points for all Bézier patches that include a macro-patch.
In some implementations, the system can alternatively determine the control points by first finding the Bézier patches whose domains are defined using the one-bay extensions, as shown in FIG. 28A using dotted lines. Any of those patches that is cut by a two-bay extension, as depicted using long-dash lines 2802, in FIG. 28B is then split using the de Casteljau algorithm. In contrast to the techniques described above, which result in producing Bézier patches that are generally C1 across the long-dash line extensions, in such implementations, the result is Bézier patches that arc C3 across the long-dash line edges.
Embodiments of the subject matter and the operations described in this specification can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on computer storage medium for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially-generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. A computer storage medium can be, or be included in, a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of them, Moreover, while a computer storage medium is not a propagated signal, a computer storage medium can be a source or destination of computer program instructions encoded in an artificially-generated propagated signal. The computer storage medium can also be, or be included in, one or more separate physical components or media (e.g., multiple CDs, disks, or other storage devices).
The operations described in this specification can be implemented as operations performed by a data processing apparatus on data stored on one or more computer-readable storage devices or received from other sources.
The term “data processing apparatus” encompasses all kinds of apparatus, devices, and machines for processing data., including by way of example a programmable processor, a computer, a system on a chip, or multiple ones, or combinations, of the foregoing The apparatus can include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). The apparatus can also include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, a. cross-platform runtime environment, a virtual machine, or a combination of one or more of them. The apparatus and execution environment can realize various different computing model infrastructures, such as web services, distributed computing and grid computing, infrastructures.
A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language resource), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this specification can be performed by one or int re programmable processors executing one or more computer programs to perform actions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for performing actions in accordance with instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive), to name just a few. Devices suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending resources to and receiving resources from a device that is used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.
Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a. graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), an inter-network (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks).
The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network.
The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. In some embodiments, a server transmits data. (e.g., an HTML page) to a client device (e.g., for purposes of displaying data to and receiving user input from a user interacting with the client device). Data generated at the client device (e.g., a result of the user interaction) can be received from the client device at the server.
A system of one or more computers can be configured to perform particular operations or actions by virtue of having software, firmware, hardware, or a combination of them installed on the system that in operation causes or cause the system to perform the actions. One or more computer programs can be configured to perform particular operations or actions by virtue of including instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination,
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Thus, particular embodiments of the stibject matter have been described. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous.

## Claims

1. A computer-implemented method comprising:
receiving an input boundary representation (B-rep) face and an associated functional trimming curve;
constructing a trim-free T-spline control mesh for a NURBS surface control grid of the input B-rep face;
aligning the trim-free T-spline control mesh with the functional trimming curve; and
generating a representation of the input B-rep face using untrimmed bicubic surface patches for each of one or more faces in the aligned trim-free T-spline control mesh that are adjacent to the functional trimming curve, wherein each bicubic surface patch is represented by a variable knot spline, and wherein at least one bicubic surface patch has a first sum of knot intervals on a first edge of the patch that does not equal a second sum of knot intervals on an opposing second edge of the bicubic surface patch.

2. The method of claim 1, further comprising adjusting control points of one or more of the untrimmed bicubic surface patches so that each bicubic surface patch is G1 continuous with all of its neighboring patches.

3. The method of claim 1, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches comprises:
labeling knot intervals in a variable knot spline control grid, the variable knot spline control grid corresponding to the control grid of the input B-rep face;
generating a bicubic surface patch for one or more faces of the variable knot spline control grid; and
adjusting control points along a boundary curve for one or more edges in each face that has a degree of six.

4. The method of claim 3, further comprising generating respective face points for each face of the variable knot spline control grid including computing respective edge and vertex points for each face of the variable knot spline control grid.

5. The method of claim 3, further comprising generating respective face points for each face of the variable knot spline control grid including generating respective face points for zero knot intervals in the variable knot spline control grid.

6. The method of claim 3, further comprising generating respective variable knot spline face points for each face of the variable knot spline control grid.

7. The method of claim 1, wherein at least one bicubic surface patch of the untrimmed bicubic surface patches is represented by a variable knot spline that includes T-junctions, and wherein generating the representation of the input B-rep face comprises:
assigning knot intervals to one or more edges that are split by a T-junction extension;
defining one or more blending functions for one or more variable knot splines with T-junctions;
splitting one or more macro patches into respective sub-patches;
determining respective pairs of tangent strips for each edge in the one or more edges; and
defining respective outermost two rows of control points for the respective sub-patches based on the respective pairs of tangent strips for the one or more edges.

8. The method of claim 6, wherein control points for variable knot splines with T-junctions are linearly mapped to corresponding Bézier control points.

9. The method of claim 1, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches for each face in the aligned trim-free T-spline control mesh that is adjacent to the functional trimming curve comprises:
optimizing control point positions in the trim-free T-spline control mesh.

10. A non-transitory computer storage medium having instructions stored thereon that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
receiving an input boundary representation (B-rep) face and an associated functional trimming curve;
constructing a trim-free T-spline control mesh for a NURBS surface control grid of the input B-rep face;
aligning the trim-free T-spline control mesh with the functional trimming curve; and
generating a representation of the input B-rep face using untrimmed bicubic surface patches for each of one or more faces in the aligned trim-free T-spline control mesh that are adjacent to the functional trimming curve, wherein each bicubic surface patch is represented by a variable knot spline, and wherein at least one bicubic surface patch has a first sum of knot intervals on a first edge of the patch that does not equal a second sum of knot intervals on an opposing second edge of the bicubic surface patch.

11. The medium of claim 10, further comprising adjusting control points of one or more of the untrimmed bicubic surface patches so that each bicubic surface patch is G1 continuous with all of its neighboring patches.

12. The medium of claim 10, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches comprises:
labeling knot intervals in a variable knot spline control grid, the variable knot spline control grid corresponding to the control grid of the input B-rep face;
generating a bicubic surface patch for one or more faces of the variable knot spline control grid; and
adjusting control points along a boundary curve for one or more edges in each face that has a degree of six.

13. The medium of claim 12, further comprising generating respective face points for each face of the variable knot spline control grid including computing respective edge and vertex points for each face of the variable knot spline control grid.

14. The medium of claim 12, further comprising generating respective face points for each face of the variable knot spline control grid including generating respective face points for zero knot intervals in the variable knot spline control grid.

15. The medium of claim 12, further comprising generating respective variable knot spline face points for each face of the variable knot spline control grid.

16. The medium of claim 10, wherein at least one bicubic surface patch of the untrimmed bicubic surface patches is represented by a variable knot spline that includes T-junctions, and wherein generating the representation of the input B-rep face comprises:
assigning knot intervals to one or more edges that are split by a T-junction extension;
defining one or more blending functions for one or more variable knot splines with T-junctions;
splitting one or more macro patches into respective sub-patches;
determining respective pairs of tangent strips for each edge in the one or more edges; and
defining respective outermost two rows of control points for the respective sub-patches based on the respective pairs of tangent strips for the one or more edges.

17. The medium of claim 16, wherein control points for variable knot splines with T-junctions are linearly mapped to corresponding Bézier control points.

18. The medium of claim 10, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches for each face in the aligned trim-free T-spline control mesh that is adjacent to the functional trimming curve comprises:
optimizing control point positions in the trim-free T-spline control mesh.

19. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
receiving an input boundary representation (B-rep) face and an associated functional trimming curve;
constructing a trim-free T-spline control mesh for a NURBS surface control grid of the input B-rep face;
aligning the trim-free T-spline control mesh with the functional trimming curve; and
generating a representation of the input B-rep face using untrimmed bicubic surface patches for each of one or more faces in the aligned trim-free T-spline control mesh that are adjacent to the functional trimming curve, wherein each bicubic surface patch is represented by a variable knot spline, and wherein at least one bicubic surface patch has a first sum of knot intervals on a first edge of the patch that does not equal a second sum of knot intervals on an opposing second edge of the bicubic surface patch.

20. The system of claim 19, further comprising adjusting control points of one or more of the untrimmed bicubic surface patches so that each bicubic surface patch is G1 continuous with all of its neighboring patches.

21. The system of claim 19, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches comprises:
labeling knot intervals in a variable knot spline control grid, the variable knot spline control grid corresponding to the control grid of the input B-rep face;
generating a bicubic surface patch for one or more faces of the variable knot spline control grid; and
adjusting control points along a boundary curve for one or more edges in each face that has a degree of six.

22. The system of claim 21, further comprising generating respective face points for each face of the variable knot spline control grid including computing respective edge and vertex points for each face of the variable knot spline control grid.

23. The system of claim 21, further comprising generating respective face points for each face of the variable knot spline control grid
including generating respective face points for zero knot intervals in the variable knot spline control grid.

24. The system of claim 21, further comprising generating respective variable knot spline face points for each face of the variable knot spline control grid.

25. The system of claim 19, wherein at least one bicubic surface patch of the untrimmed bicubic surface patches is represented by a variable knot spline that includes T-junctions, and wherein generating the representation of the input B-rep face comprises:
assigning knot intervals to one or more edges that are split by a T-junction extension;
defining one or more blending functions for one or more variable knot splines with T-junctions;
splitting one or more macro patches into respective sub-patches;
determining respective pairs of tangent strips for each edge in the one or more edges; and
defining respective outermost two rows of control points for the respective sub-patches based on the respective pairs of tangent strips for the one or more edges.

26. The system of claim 25, wherein control points for variable knot splines with T-junctions are linearly mapped to corresponding Bézier control points.

27. The system of claim 19, wherein generating the representation of the input B-rep face using untrimmed bicubic surface patches for each face in the aligned trim-free T-spline control mesh that is adjacent to the functional trimming curve comprises:
optimizing control point positions in the trim-free T-spline control mesh.