◆ ConstrainedFilling
An algorithm for constructing a BSpline surface filled
from a series of boundaries which serve as path
constraints and optionally, as tangency constraints.
The algorithm accepts three or four curves as the
boundaries of the target surface.
Warning
This surface filling algorithm is specifically designed to
be used in connection with fillets. Satisfactory results
cannot be guaranteed for other uses.
◆ StretchStyle
An algorithm for constructing a BSpline surface filled
from contiguous BSpline curves which form its boundaries.
The algorithm accepts two, three or four BSpline
curves as the boundaries of the target surface.
A range of filling styles - more or less rounded, more
or less flat - is available.
Warning
Some problems may show up with rational curves.