Routines
- A_bilcpt Compute
combination of four control points
- A_bilpoi Compute
combination of four points
- A_circpt Translate
combination of two control points
- A_cirpoi Translate
combination of two points
- A_comcpt Compute
combination of two control points
- A_compoi Compute
combination of two points
- A_cptpoi Map
control point to w = 0 hyperspace
- A_crocpo Cross
product of two control points
- A_difcpt Compute
the difference of two control points
- A_difpcp Compute
the difference of control point and point
- A_difpoi Compute
the difference of two points
- A_dotcpo Dot
product of two control points in Euclidean
space
- A_dotcpt Dot
product of two control points in homogeneous
space
- A_dotpoi Dot
product of two points
- A_euccpt Map
homogeneous control point to Euclidean control
point
- A_euclid Compute
Euclidean point from homogeneous coordinates
- A_extcpc Extract
coordinates of a control point
- A_exteco Extract
Euclidean coordinates of a control point
- A_extpoc Extract
coordinates of a point
- A_extwei Extract
the weight of a control point
- A_extzco Extract
the z coordinate of a control point
- A_getcpt Create
control point object from coordinates
- A_getpoi Create
point object from coordinates
- A_initcp Initialize
control point
- A_initpo Initialize
point
- A_magcpt Compute
magnitude of control point
- A_magpoi Compute
magnitude of point
- A_mapcpt Map
control point to Euclidean space
- A_poicpt Convert
point to control point
- A_ratder Compute
rational derivative from Euclidean derivative
- A_rewecp Re-weight
control point
- A_scacpo Scale
first three coordinates of a control point
- A_scacpt Scale
control point
- A_scapoi Scale a
point
- A_sclcpt Scale
control point with respect to a point
- A_setcpw Set w
component of control point
- A_setcpx Set x
component of control point
- A_setcpy Set y
component of control point
- A_setcpz Set z
component of control point
- A_sumcpt Compute
the sum of two control points
- A_sumpcp Compute
the sum of control point and point
- A_sumpoi Compute
the sum of two points
- A_tracpt Transform
control point given a 4x4 matrix
- A_trapoi Transform
point given a 4x4 matrix
- A_trlcpt Translate
control point by a given vector
- A_updcpt Update
control point by adding a term to it
- A_updpoi Update a
point by adding a term to it
- A_vcocpt Compute
vector combination of two control points
- A_vcopoi Compute
vector combination of two points
- A_weight Compute
weighted control point
- B_allber Compute
all Bernstein polynomials at a given
parameter
- B_arclen Compute
arc length of Bezier curve
- B_bernst Evaluate a
Bernstein polynomial at a given parameter
- B_cbepow Convert
Bezier curve to power basis form
- B_cdegel Elevate
the degree of a Bezier curve
- B_cdegre Reduce the
degree of a Bezier curve
- B_cdemat Compute
Bezier curve degree elevation matrix
- B_cextsd Extend
Bezier curve to share same derivatives
- B_cfncu4 Product of
Bezier function and Bezier curve in 4-D
- B_cfncur Product of
Bezier function and Bezier curve
- B_cfnevn Compute a
point on a Bezier curve function
- B_cfnprt Product of
two Bezier functions
- B_circpt Compute
weighted control points of Bezier circle
- B_circra Center,
radius, start/end angles of 2-D Bezier circle
- B_cpobez Convert
power basis curve to Bezier form
- B_cprmat Compute
Bezier product matrix
- B_crepar
Reparameterize a Bezier curve with a Bezier
function
- B_csplit Split a
Bezier curve at a given parameter
- B_cubapt
Least-squares cubic to end points and end
tangents
- B_curcro Cross
product of two Bezier curves
- B_curevn Compute a
point on a Bezier curve
- B_curprt Dot
product of two Bezier curves
- B_degrco Compute
Bezier degree reduction coefficients
- B_fdegel Elevate
the degree of a Bezier function
- B_gcubin Global
cubic curve interpolation
- B_gcurin Global
curve interpolation
- B_getciw Compute
weight of conic arc closest to that of circle
- B_ipomat Inverse of
power basis conversion matrix
- B_iremat Non-zero
elements of inverse of reparameterization
matrix
- B_makcir Compute
circular arc to given end points and tangents
- B_makcon Create a
Bezier conic arc
- B_powmat Non-zero
elements of power basis conversion matrix
- B_reclen Recursive
procedure for Bezier arc lenth computation
- B_repmat Non-zero
elements of reparameterzation matrix
- B_sbepow Convert
Bezier surface to power basis form
- B_sdegel Elevate
the degree of a Bezier surface for a
row/column
- B_sdegre Reduce the
degree of a Bezier surface
- B_sextsd Extend
Bezier surface strip to share same
derivatives
- B_sfndel Elevate
the degree of a Bezier surface function
- B_sfnevn Compute a
point on a Bezier surface function
- B_sfnprt Product of
bivariate Bezier functions
- B_sfnsur Product of
bivariate Bezier function and Bezier surface
- B_splcon Split a
Bezier conic arc
- B_spobez Convert
power basis surface to Bezier form
- B_surcro Cross
product of two Bezier surfaces
- B_surevn Compute a
point on a Bezier surface
- B_surprt Dot
product of two Bezier surfaces
- E_cfnsto Check for
sufficient storage in curve function
structure
- E_clrerr Clear
error handle
- E_cmasto Storage
check in control point matrix structure
- E_curcpe Check
curve control points equal
- E_curcpf: Replace
(near-) equal curve control points
- E_curdef Check
curve definition
- E_curinp A complete
curve check
- E_currev
Check curve control points for direction reversal at
ends
- E_cursto Check for
sufficient storage in curve structure
- E_curwei Check
whether curve weights are within range
- E_endpar Check if
parameter <= first knot or >= last knot
- E_errtyp Return
type of error
- E_imasto Check for
sufficient storage in integer matrix
structure
- E_kntdef Check knot
vector definition
- E_parval Check if
parameter is out of range
- E_pmasto Check for
sufficient storage in point matrix structure
- E_rmasto Check for
sufficient storage in real matrix structure
- E_seterr Set error
handle
- E_sfnsto Check
storage in surface function structure
- E_surdef Check
surface definition
- E_surinp A complete
surface check
- E_sursto Check for
sufficient storage in surface structure
- E_surwei Check
whether surface weights are within range
- G_araspl Compute
Area Of Spherical polygon
- G_araspt Compute
Area of rectangular spherical patch
- G_arecpl Are three
control points collinear?
- G_arepos Are points
the same?
- G_aretrl Are 3
points colinear
- G_arevps Are
vectors point to the same direction?
- G_boxbre Break
min-max box object down to its components
- G_boxcen Compute
the center of a box
- G_boxdef Define
bounding box
- G_boxdia Compute
the diagonal of a box
- G_boxdim Compute
the dimensions of a box
- G_bx2ovl Compute
area of 2-D box overlap
- G_circer Compute
center and readius of a circle given by 3
points
- G_cirder
Derivatives of a circle given in trigonometric
form
- G_defppl Set index
in polgon definition
- G_discpl Compute
the length of a control polygon
- G_discpo Compute
homogeneous distance between two control
points
- G_discpp Compute
the distance between two control points
- G_discpw Compute
the length of a control polygon in 4-D
- G_dispab Distance
between point and line segment
- G_dispca Distance
between a point and a circular arc
- G_displn Compute
distance of point from line
- G_dispnl Distance
of point from line given in implicit form
- G_dispnp Distance
of point from plane given in implicit form
- G_dispol Compute
the length of a polygon given by the vertices
- G_dispop Compute
the distance between two points
- G_dispp2 Compute
the distance between two points in 2-D
- G_disppl Compute
distance of point from plane
- G_disqab Distance
between point and line segment
- G_disqp2 Compute
the squared distance between two points in
2-D
- G_disqpp Compute
the squared distance between two points
- G_dolsin Do line
segments intersect?
- G_gweabc Get weight
of one control point to ensure collinearity
- G_impln2 Implicit
equation of line to point-vector form
- G_imppln Implicit
equation of plane to point-normal form
- G_intcpl Intersect
closed convex polygon with line segment
- G_intlnl Intersect
two lines
- G_intlnp Intersect
line and plane
- G_intlsg Intersect
two line segments
- G_intplp Intersect
two planes
- G_isntlc Is point
net closed?
- G_ispgpg Point
grid-in-polygon gravity field test
- G_ispgpl Point
grid-in-polygon test
- G_ispplc Is polygon
closed?
- G_ispppl
Point-in-polygon test
- G_itvbre Break
interval object down to its components
- G_linbox Compute
extended bounding box of line segment
- G_linbre Break line
object down to its components
- G_lindir Get
direction vector of line
- G_linsfl Set
bounding flag of line
- G_lipost Line-point
side test
- G_ln2imp
Point-vector definition of 2D line to implicit
form
- G_lsqcir
Least-squares circle to a set of 2D points
- G_lsqdln Best
fitting line to scattered points
- G_lsqdpl Best
fitting plane to scattered points
- G_lsqln2
Least-squares line to a set of 2D points
- G_lsqln3
Least-squares line to a set of 3D points
- G_lsqpln Best-fit
plane to a set of 3D points
- G_lsqsph
Leas-squares sphere to a set of 3D points
- G_makitv Make
interval object
- G_makln1 Make line
object from end points
- G_makln2 Make line
object from start point and direction vector
- G_makntl Make point
net object
- G_makpln Make plane
object from point and normal vector
- G_makppl Make
polgon object
- G_makrct Make
rectangle object
- G_mxapln Maximum
area plane to grid of points
- G_netbox Compute
bounding box of point net
- G_netleg Find index
of control net leg closest to a given point
- G_ntlbre Break net
object down to its components
- G_plnbre Break
plane object down to its components
- G_plnimp
Point-normal definition of plane to implicit
form
- G_plnnor Get normal
vector of plane
- G_plpost
Plane-point side test
- G_po1box Compute
the min-max box of a 1-D point array
- G_po1ext Compute
maximum extent of 1-D point array
- G_po2box Compute
the min-max box of a 2-D point array
- G_po2ext Compute
maximum extent of 2-D point array
- G_poicln Find k
closest points to given point in 2-D point
set
- G_poiord Order
points along a 3-D curve
- G_poirct Bounding
Rectangle of a 2D point set
- G_polbox Compute
bounding box of polygon
- G_polleg Find index
of polygon leg closest to a given point
- G_poloff Compute
the offset of a polygon
- G_polpln Plane fit
to 3D polyline points
- G_polppr Get
parameter of point based om polygonal
approximation
- G_pplbre Break
polygon object down to its components
- G_prjpab Project
point onto line segment
- G_prjphp Project
point onto a quadrilateral
- G_prjpln Project
point onto a line
- G_prjppl Project
point onto a plane
- G_pyarea Area and
orientation of a closed 2D polygon
- G_rctbre Break
rectangle object down to its components
- G_rctitv Convert
rectangle into two intervals
- G_reflcp Reflect a
control point through a plane
- G_sphcer Compute
center and radius of a sphere given by 4
points
- G_tra3da Compute 3D
affine transf. matrix given 4 points and
image
- G_traaxl General
axial transformations
- G_tragnr Compute
general rotation matrix
- G_traort Matrix to
take one orthonormal system into another
- G_traro2 Rotate 2-D
point set
- G_trasc2 Scale 2-D
point set
- G_trash2 Shear 2-D
point set
- G_tratr2 Translate
2-D point set
- G_tratrl Compute
translation matrix
- G_travec Compute
matrix to take one 2-D unit vector into
another
- G_traxyz Transform
general vector into one of the principal axes
- G_vecang Compute
the angle between two vectors
- G_veccmb Compute
the combination of two vectors
- G_veccop Compute a
copy of a given vector
- G_veccos Compute
the cosine of the angle between two vectors
- G_veccro Compute
cross product of two vectors
- G_veccrp Compute
cross product of vectors passed in by
reference
- G_vecdan Compute
the directed angle between two 2-D vectors
- G_vecdcp Difference
vector between two control points in 3-D
- G_vecdif Compute
the difference of two vectors
- G_vecdir Compute
direction vector from two points
- G_vecdop Compute
dot product of vectors passed in by reference
- G_vecdot Compute
the dot product of two vectors
- G_vecmag Compute
the magnitude of a vector
- G_vecmak Make
VECTOR data type from <x,y,z> data
- G_vecmap Compute
the magnitude of a vector passed in by
reference
- G_vecmix Compute
the mixed product of three vectors
- G_vecnip Normalize
a given vector passed in by reference
- G_vecnor Normalize
a given vector
- G_vecper Compute a
vector perpendicular to a given 2-D vector
- G_vecpfv Compute
point along a vector
- G_vecrev Reverse
the direction of a given vector
- G_vecrvp Reverse
the direction of a given vector in place
- G_vecrwp Reverse
direction of a vector wrt another vector in
place
- G_vecrwv Reverse
direction of a vector wrt another vector
- G_vecsca Scale a
given vector
- G_vecscp Scale a
given vector passed in by reference
- G_vecsum Compute
the sum of two vectors
- M_chkfop Check
floating point operations for under- and
overflow
- M_cmabre Get
members of control point matrix object
- M_cmachk Check if
memory is needed to store control point
matrix
- M_cmacmp Get matrix
pointer of control point matrix object
- M_cmadef Set
parameters of control point matrix
- M_cmaind Get
highest indexes of control point matrix
object
- M_cplevn Evaluate
polynomial curve given in power basis form
- M_cpswap Swap two
control points
- M_CTridiag Solve
corner triDiagonal system
- M_Tridiag: Solve
triDiagonal system
- M_espcur Compute
equally spaced points on a curve
- M_espsur Compute
equally spaced points on a surface
- M_fliflo Generate a
randon sequence of flips and flops
- M_forbac Forward
elimination and backward substitution
- M_getcma Allocate
memory to store control point matrix elements
- M_getima Allocate
memory to store integer matrix elements
- M_getpma Allocate
memory to store point matrix elements
- M_getrma Allocate
memory to store real matrix elements
- M_i1mima Minimum or
maximum of 1-D integer array
- M_i2mima Minimum or
maximum of 2-D integer array
- M_imabre Get
members of integer matrix object
- M_imachk Check if
memory is needed to store an integer matrix
- M_imadef Set
parameters of integer matrix
- M_imaimp Get matrix
pointer of integer matrix object
- M_imaind Get
highest indexes of integer matrix object
- M_inicma Initialize
a control point matrix to NULL
- M_iniima Initialize
an integer matrix to NULL
- M_inipma Initialize
a point matrix to NULL
- M_inirma Initialize
a real matrix to NULL
- M_inrand Generate a
random number in the range of 0 to RAND_MAX
- M_inrhas Create
hash table for reals
- M_inswap Swap two
integer numbers
- M_intfel Find
element in a sorted integer array
- M_intfsp Find
interval a given integer value is in
- M_iscman Is control
point matrix initialized to NULL?
- M_ishel2 Sort index
array using Shellsort output index array
- M_ishell Sort index
array using Shellsort
- M_isiman Is integer
matrix initialized to NULL?
- M_ispman Is point
matrix initialized to NULL?
- M_isrman Is real
matrix initialized to NULL?
- M_lsslsy Least
squares solution to linear system of
equations
- M_ludcmp LU
decompose a square matrix
- M_ludpiv LU
decomposition with partial pivoting
- M_makcma Define
control point matrix
- M_makima Define
integer matrix
- M_makpma Define
point matrix
- M_makrma Define
real matrix
- M_minfun Minimize a
scalar-valued function of 1 variable
- M_pascal Compute
i-th row of Pascal triangle from i-1th row
- M_pastri Compute
Pascal triangle
- M_pmabre Get
members of point matrix object
- M_pmachk Check if
memory is needed to store a point matrix
- M_pmadef Set
parameters of point matrix
- M_pmaind Get
highest indexes of point matrix object
- M_pmapmp Get matrix
pointer of point matrix object
- M_pofbpv
Forward/backward with partial pivoting and POINT
rhs
- M_polder Evaluate
polynomial and its derivatives
- M_polnew Polynomial
root finding via Newton's method
- M_poswap Swap two
points
- M_prtrma Print real
matrix data to the standard output
- M_quades Solve
quadratic equation
- M_r1mima Minimum or
maximum of 1-D real array
- M_r2mima Minimum or
maximum of 2-D real array
- M_rafbpv
Forward/backward with partial pivoting
- M_rafoba Forward
elimination and backward substitution for
reals
- M_reaclu Find
clusters in a sorted array
- M_reafsp Find
interval a given real value is in
- M_rerhas Retrieve
elements from hash table
- M_reswap Swap two
real numbers
- M_rinsch Insertion
search on a real array
- M_rishel Sort real
and integer array using Shellsort
- M_rmabre Get
members of real matrix object
- M_rmachk Check if
memory is needed to store a real matrix
- M_rmacpt Product of
real matrix and control point array
- M_rmadef Set
parameters of real matrix
- M_rmaevv Compute
eigenvalues and eigenvectors of a matrix
- M_rmaind Get
highest indexes of real matrix object
- M_rmainv Compute
the inverse of a real matrix
- M_rmaivp Inverse of
a real matrix with partial pivoting
- M_rmaivs Invers of
a real matrix with singe value decomposition
- M_rmamtm Product of
real matrix and its transpose
- M_rmamtr Product of
real matrix and the transpose of another
- M_rmamul Compute
the product of two real matrices
- M_rmapoi Product of
real matrix and point array
- M_rmarmp Get matrix
pointer of real matrix object
- M_rmatrp Compute
the transpose of a real matrix
- M_rmcprm Product of
matrix - control point - transpose of matrix
- M_rrshel Sort real
array pair using Shellsort
- M_rshel2 Sort real
array using Shellsort output index array
- M_rshell Sort real
array using Shellsort
- M_splevn Evaluate
polynomial surface given in power basis form
- M_svdcpf Single
Value Decomposition, decomposition, full
matrix
- M_svdinv Compute
inverse of real matrix using Single Value
Decomp
- M_svdsbf Single
Value Decomposition, substitution, full
matrix
- M_tanaki Compute a
tangent vector via the 5-point Akima method
- M_tanbes Compute a
tangent vector via the 3-point Bessel method
- M_uprhas Update
hash table by adding an element to it
These NURBS routines
(N_xxxxxx) classified by type: Basic (B),
Advanced (A), and Tessellation (T).
Entry-level
users will find it easier to work with the 'B'
routines.
- B N_conarc
Create a conic arc
- B N_conbca
Create Bezier cubic/quartic circular arc <= 180
degrees
- B N_conci2
Create a quadratic circle/circular arc
- B N_conci4
Create a quartic degree 4 circle/circular arc
- B N_conci5
Create a quintic circle/circular arc
- B N_concir
Create a circle/circular arc
- B N_conciw
Extract circle weights
- B N_concsc
Create a cubic semi-circle
- B N_conell
Create a ellipse/elliptical arc
- B N_congeo
Compute geometric definition of conic
- B N_conimp
Compute the implicit equation of a conic
curve
- B N_consha
Compute conic shape invariance
- B N_contyp
Determine the type of conic
- B
U_GetConicData Get conic data for arc
creation
- B N_curbox
Compute min-max box of a curve
- B N_curcdr
Compute derivative of curvature of curve
- B N_curcgc Is
a curve Gn smoothly closed
- B N_curcrv
Compute curvature and osculating circle of a
curve
- B N_curder
Compute derivatives of a curve
- B N_curevn
Compute a point on a curve
- B N_curext
Compute largest extent of a curve
- B N_curfre
Compute the Frenet frame of a curve at a given
point
- B N_curg1s
Get G1-continuous segments of a curve
- B N_curgds
Get degenerate segments of a curve
- B N_curglc
Get linear and curved segments of a curve
- B N_curipv
Compute minimum position vector of curve control
points
- B N_curkts
Scale knot vector of a curve to given
interval
- B N_curlin
Create line as a curve
- B N_curln2
Create line as a curve 2 points
- B N_curmpv
Compute maximum position vector of curve control
points
- B N_curmwp
Compute curve min-max weights and position
vectors
- B N_curpoi
Create point as a degenerate curve
- B N_curprj
Project a curve onto a plane
- B N_currev
Reverse a curve
- B N_currot
Rotate a curve about a general axis
- B N_cursca
Scale a curve with respect to a point
- B N_curtan
Unit tangent and point of a curve
- B N_curtra
Transform a curve given a 4x4 matrix
- B N_curtrl
Translate a curve
- B N_curtrn
Translate a curve, but not in
place
- B N_curtyp
Determine type of curve
- B N_curunc
Unclamp a curve
- B N_curunu
Unclamp a curve with a given knot vector
- A N_curadm
Compute the average position vector magnitude of a
curve
- A N_curali
Align a curve to a given coordinate
frame
- A N_curbod
Upper bound on second derivative of offset
curve
- A N_curbsd
Upper bound on second derivative of a
curve
- A N_curdrk
Compute derivatives of a curve wrt a
knot
- A N_curesp
Compute equally spaced points on a curve
- A N_cureve
Compute point and derivatives on extended
curve
- A N_curevr
Compute a point on a curve in homogeneous
space
- A N_curfod
1st and 2nd derivatives of functional curve
offset
- A N_curmep
Modify curve so that an endpoint passes through a
point
- A N_curodr
Compute 1st and 2nd derivatives of offset
curves
- A N_currdr
Derivatives of a curve in homogeneous
space
- A N_curswe
Scale weighted control points of curve
- A N_curxcd
Extend a curve a given distance
- A N_curxcp
Extend a curve to a point
- A N_curxcr
Extend a curve a given parametric distance
- B N_cfnder Compute
derivatives of a curve function
- B N_cfnevn Compute a point
on a curve function
- A N_cfndrk Compute
derivatives of a curve function wrt a
knot
- A N_cfnrbf Evaluate rational
basis function given as curve function
- B N_cplder Compute derivatives of a power basis
curve
- B N_cplevn Compute a point on a power basis
curve
- B N_cplrep Reparameterize a power basis
curve
- B N_surbox Compute min-max box of a
surface
- B N_surcgc Is a surface Gn smoothly
closed
- B N_surcrv Compute Gaussian, mean and principal
curvatures
- B N_surder Compute derivatives of a
surface
- B N_suresc Compute a point on a surface
curve
- B N_surevn Compute a point on a
surface
- B N_surext Compute largest extent of a
surface
- B N_surgdp Get degenerate patch strips of a
surface
- B N_surkts Scale knot vectors of a surface to
given rectangle
- B N_surmpv Compute maximum position vector of
surface control points
- B N_surmwp Compute surface min-max weights and
position vectors
- B N_surnor Compute the surface normal at given
parameter values
- B N_surnrp Compute the surface normal at a
pole
- B N_surprj Project a surface onto a
plane
- B N_surrev Reverse a
surface
- B N_surrot Rotate a surface about a general
axis
- B N_sursca Scale a surface with respect to a
point
- B N_surtra Transform a surface given a 4x4
matrix
- B N_surtrl Translate a
surface
- B N_surtyp Determine type of
surface
- B N_surunc Unclamp a
surface
- B N_suruuv Unclamp a surface with given knot
vectors
- A N_surbnd Upper bound on second derivative of
unit normal
- A N_surbod Upper bound on second derivatives of
offset surface
- A N_surbsd Upper bound on second derivative of
a surface
- A N_surdcp Compute derivatives of a surface wrt a
control point
- A N_surdrk Compute derivatives of a
surface wrt a knot
- A N_suresp Compute equally spaced points on a
surface
- A N_sureve Compute point and derivatives on
extended surface
- A N_surevg Compute a grid of points on a
surface
- A N_surfod 1st and 2nd derivatives of
functional surface offset
- A N_surmbc Modify surface to assume new
boundary curve
- A N_surndr Compute 1st and 2nd derivatives of
UNIT surface normal
- A N_surngp Compute points and unit normals at a
grid of points
- A N_surrdr Derivatives of a surface in
homogeneous space
- A N_surswe Scale weighted control points
of surface
- A N_surxsc Extend a surface to a
curve
- A N_surxsd Extend a surface a given
distance
- A N_surxsr Extend a surface a given parametric
distance
- B N_cmsbil Create bilinear
surface
- B N_cmsccp Create a cylinder/cone
surface/patch
- B N_cmsell Create a
ellipsoid/patch
- B N_cmsgcl Create a generalized
cylinder
- B N_cmsgco Create a generalized cone between a
curve and a point
- B N_cmshyp Create a hyperboloid of one
sheet/hyperbolic patch
- B N_cmspar Create a elliptic
parabaloid/patch
- B N_cmsrev Create surface of
revolution
- B N_cmsrls Create a ruled surface between two
arbitrary curves
- B N_cmssph Create a sphere/spherical
patch
- B N_cmstor Create a torus/toroidal
patch
- A N_cmsrul Ruled surface of two curves using
symbolic operators
- A N_ascacb
Approximate cross-boundary derivative
field
- A N_ascadf
Adjust derivative field
- A N_ascase
Approximate surface skinning with error
bound
- A N_ascask
Approximate surface
skinning
- A N_ascasu
Approximate surface skinning with given knot
vector
- A N_ascbbc
Bicubic Coons surface through boundary and
derivatives
- A N_ascbc3
Bicubic Coons surf given bndys, derivs and
tensor-surf
- A N_ascbcc
Bicubic Coons surface through four boundary
curves
- A N_ascblc
Bilinear Coons surface through four boundary
curves
- A N_asccbd
Compute cross-boundary derivative
field
- A N_asccbv
Compute "B" vectors for curve
alignment
- A N_asccd2
Compute cross-boundary derivative
field
- A N_asccd3
Compute cross-boundary derivatives for Coons
surface
- A N_asccpg
Make intersection parameters compatible for Gordon
sur
- A N_ascdfb
Cross-boundary derivative from surface, end twists and
derivatives
- A N_ascdfs Cross-boundary derivative data
from surface
- A N_ascdfv Cross-boundary derivative data from
vector and curve
- A N_ascdvf Cross-boundary derivative data from
vector field
- A N_ascgor Gordon surface trough compatible
non-rational curves
- A N_ascgsk General surface
skinning
- A N_ascgsu Surface skinning with given
parameters and knot vector
- A N_ascgt1 Compute twist vectors for bicubic
Coons surface
- A N_ascgtn Compute tensor product surface for
Coons construction
- A N_ascgws Get weight and scale factor for G1
continuity
- A N_ascici Iso-curve inversion/projection using
Newton's method
- A N_asckim Merge knot vectors to have the same
internal knots
- A N_ascnpi N-sided patch construction to
boundary and derivatives
- A N_ascsbc Approximate skinning with boundary
conditions and rails
- A N_ascske Surface skinning via approximation
of cross-sectional curves
- A N_ascssk General spine curve-based surface
skinning
- A N_ascswe Create a swept
surface
- A N_ascsws Swept surface with boundary
conditions
- A
N_ascSweepCrossTangentCurve
- A N_ascswu Create a swung
surface
- A N_asctsw Create a translational sweep
surface
- B N_sfnder
Compute all derivatives of a surface
function
- B N_sfnevn
Compute a point on a surface
function
- A N_sfnrbf
Evaluate rat basis function given as a surface
function
- A N_sfndrk
Compute derivatives of a surface function wrt a
knot
- A N_sfnevg
Compute a grid of points on a surface
function
- B N_splder
Compute derivatives of a power basis
surface
- B N_splevn
Compute a point on a power basis
surface
- B N_splrep
Reparameterize a power basis
surface
- B N_fitbca
Best fitting circle or circular arc to a set of
points
- B N_fitBArc
Compute a biarc to given end points and end
tangents
- B N_fitCubic
Cubic spline
interpolation
- B N_fitcfs
Curve interpolation through row/column of surface
data
- B N_fitciu
Curve interpolation with specified knot
vector
- B N_fitcpa
Parameterization for global curve
interpolation
- B N_fitcsp
Cubic spline
interpolation
- B
N_fitPeriodicCubic Periodic cubic spline
interpolation
- B N_fitfpa
Parameterization for global functional
interpolation
- B N_fitgca
Global curve approximation with arbitrary
degree
- B N_fitgcc
Curve interpolation to closed data with end
conditions
- B N_fitgcd
Curve interpolation with end derivatives
specified
- B N_fitgch
Curve interpolation with given higher end
derivatives
- B N_fitgci
Global curve interpolation with arbitrary
degree
- B N_fitgct Curve
interpolation with end tangents
specified
- B N_fitgfi
Global function interpolation with arbitrary
degree
- B N_fitgsa
Global surface approximation with arbitrary
degree
- B N_fitgsi
Global surface interpolation with arbitrary
degrees
- B N_fitkna
Compute knot vector for global curve
approximation
- B N_fitknd
Knot vector for curve interpolation with end
derivatives
- B N_fitknh
Knot vector for interpolation with high end
derivatives
- B N_fitkni
Compute knot vector for global curve
interpolation
- B N_fitlin
Best fitting line segment to a set of random
points
- B N_fitpln
Best fitting plane to random
points
- B N_fitsfi
Surface function interpolation with arbitrary
degrees
- B N_fitspa
Parameterization for global surface
interpolation
- A N_fitbia
Compute a biarc to given end points and end
tangents
- A N_fitcae
Curve approximation with error bound
specified
- A N_fitcak
Curve approximation with knots and end
tangents
- A N_fitcat
Global curve approximation with end
tangents
- A N_fitcau
Curve approximation with specified knot
vector
- A N_fitcba
Data approximation with piecewise biarc
segments
- A N_fitcca
Data approximation with piecewise cubic
segments
- A N_fitcdm
Curve interpolation with end derivatives and
matrix
- A N_fitcdu
Curve interpolation with end derivatives and knot
vector
- A N_fitcek
Curve approximation with error bound and knot
vector
- A N_fitcet
Curve approximation with error bound & end
constraints
- A N_fitcfd
Curve interpolation with first derivatives
specified
- A N_fitcfu
Curve interpolation with first derivatives & knot
vector
- A N_fitcik
Curve interpolation with knots and end
tangents
- A N_fitcim
Curve interpolation with specified
matrix
- A N_fitcir
Curve interpolation with piecewise circular
arcs
- A N_fitcis
Interpolate points based on curve
shaping
- A N_fitclc
Curve interpolation with C1 non-rational cubic
curves
- A N_fitclt
Local C1 cubic curve interpolation with end
tangents
- A N_fitcon
Curve interpolation with piecewise conic
arcs
- A N_fitcqa
Data approximation with piecewise conic
segments
- A N_fitcra
Remove all removable knots from an approximating
curve
- A N_fitcrd
Remove all removable knots with derivative
constraints
- A N_fitcrp
Remove knots with derivative constraints and
priorities
- A N_fitctm
Curve interpolation with end derivative and
matrix
- A N_fitctu
Curve interpolation with end derivative and knot
vector
- A N_fitcwl
Weighted & constrained least-squares curve
approximation
- A N_fitcwp Weighted
& constrained least squares periodic fit to
points
- A N_fitcwu
Weighted/constrained least-squares with knot
vector
- A N_fitgac
Curve approximation to closed data with end
conditions
- A N_fitgah
Global curve approximation with end
derivatives
- A N_fitgfu
Function interpolation with given
parameters
- A N_fitghu
Curve approximation with end derivatives and
knots
- A N_fither
Fit Hermite curve to end kth and (k+1)th
derivatives
- A N_fitkad
Knot vector for curve interpolation with all
derivatives
- A N_fitkah
Knot vector for curve approximation with end
derivatives
- A N_fitknf
Knot vectors for random data
approximation
- A N_fitknr
Compute knot vectors for surface approx to random
points
- A N_fitknt
Knot vector for curve interpolation with end
derivative
- A N_fitlca
Check scatter and compute local cubic
approximant
- A N_fitlqa
Check scatter and compute local conic
approximant
- A N_fitpar
Curve interpolation with piecewise parabolic
arcs
- A N_fitpte
Least squares curve fit to
points
- A
N_fitPointsNormals Fit surface to an array of points and
normals
- A N_fitRandomPN Fit
surface to random set of points and
normals.
- A N_fitrma
Compute interpolation matrix for curve
fitting
- A N_fitrp1
Compute parameters for surface fit of random
data
- A N_fitrp2
Compute parameters for surface fit of random
data
- A N_fitrp3
Parameters for surface fitting of random
data
- A N_fitsab
Surface approximation with boundary curves
specified
- A N_fitsae
Surface approximation with error bound
specified
- A N_fitsap
Surface approximation to variable number of
points
- A N_fitsas
Approximate random points based on surface
shaping
- A N_fitsat
Surface approximation with error bounds and
tangents
- A N_fitsau
Surface approximation with given knot
vectors
- A N_fitscp
Smooth 3D points in preparation for curve
fitting
- A N_fitsib
Surface interpolation to a nxm points and
boundaries
- A N_fitsis
Interpolate points based on surface
shaping
- A N_fitsit
Surface interpolation with tangent
constraints
- A N_fitsiu
Surface interpolation with given knot
vectors
- A N_fitslb
Surface interpolation with C11 bicubic
surfaces
- A N_fitspl
Best fitting sphere to a set of
points
- A N_fitspr
Parameterization for surface interpolation in
u/v-dis
- A N_fitspg
Best fitting sphere to a set of
points
- A N_fitsr1
Least squares surface approximation to random
points
- A N_fitsr2
Least squares surface approximation to random
points
- A N_fitsr3 Periodic
Least squares fit to random
points
- A N_fitsra
Remove all removable knots from an approximating
surface
- A N_fitsrb
Update surface removal bound for surface
fitting
- A N_fitsrc
Remove all removable knots from an interpolating
surface
- A N_fitsrt
Remove all removable knots from an approximating
surface
- A N_fitste
Tangent error for one knot removal for
fitting
- A N_fitsvp
Surface interpolation to variable number of
points
- A N_fittau
Curve approximation with end tangents, knots and
pars
- A N_appbca Approximate curve
with circular arcs and
biarcs
- A N_appber Check error of
biarc
approximation
- A N_appcir Approximate
circle A full or arc with non-rational
curve
- A N_appcos Approximate curve
on surface from
uv-curve
- A N_appcu1 Compute number of
ctrl pts for circle
approximation
- A N_appccp Non-rational approximation of cylinder or
cone
- A N_appcra Non-rational approximation of a circle or
arc
- A N_appcu2 Perform
non-rational curve fit to circle
data
- A N_appcSpiral Cubic approximation
of a spiral with error
specified
- A N_appfoc Functional offset
of curve using point
sampling
- A N_appfos Functional offset
of surface using point
sampling
- A N_appgca Approximate
curve with non-rational
curve
- A N_appgck Curve
approximation with knot vector passed
in
- A N_appgsa Approximate
surface with non-rational
surface
- A N_appnca Approximate any
G1 curve with non-rational
curve
- A N_appncp Get points for
approximation of
curves
- A N_appoca Approximate
offset of curve with non-rational
curve
- A N_appocp Offset of
curve
- A N_appocs Offset of
curve using point
sampling
- A N_apposs Offset of
surface using point
sampling
- A N_apppca Approximate
procedural curve with error bound
specified
- A N_apppcf Fit procedural
curve points with error bound
specified
- A N_apppcp Get points for
approximation of procedural
curve
- A N_apprev Non-rational approaximation of surface of
revolution
- A N_appsph Non-rational approximation of
sphere
- A N_appsSiral Sweep a curve along
a spiral ( or
helix)
- A N_appsbs Approximate
subsurface bounded by 4
curves
- A N_appsun Approximate unit
normal of surface
- A N_apptor Non-rational approximation of a
torus
- A N_shacab Shape curve to
approximate given
points
- A N_shacap Shape curve to
approximate given
points
- A N_shacax Axial
deformations of
curves
- A N_shacbe Bend a
curve
- A N_shacca Constraint-based
curve shaping with interp or
approx
- A N_shaccb Constraint-based
curve
modification
- A N_shacfl Flatten a
curve
- A N_shacin Shape curve to
interpolate given
points
- A N_shacmw Modify one curve
weight
- A N_shacra Remove all
removable knots from a curve being
shaped
- A N_shacrb Make rational
basis function for curve
warping
|