The evaluation of surface points and derivatives of NURBS surfaces for parameter values that are regularly distributed in a rectangular structure is considered. Because of the regularity, parts of the computations can be done on just a small portion of all parameter values and computed data is stored and reused for many other parameter values. Hence, the evaluation of NURBS surfaces can be performed faster when the regularity is used. We are making a complexity analysis of the number of floating point operations, which is required for the evaluations. To get knowledge about how the evaluations perform in practice, we are doing a numerical experiment where we are measuring the runtime to obtain the output both by using ordinary evaluation of the NURBS surface and by making use of the regular structure. Making use of the regularity gives significantly faster output.

References

1.
Dimas
,
E.
, and
Briassoulis
,
D.
,
1999
, “
3D Geometric Modelling Based on NURBS: A Review
,”
Adv. Eng. Software
,
30
(
9–11
), pp.
741
751
.10.1016/S0965-9978(98)00110-0
2.
Farin
,
G.
,
1992
, “
From Conics to NURBS: A Tutorial and Survey
,”
IEEE Comput. Graphics Appl.
,
12
(
5
), pp.
78
86
.10.1109/38.156017
3.
Piegl
,
L.
,
1991
, “
On NURBS: A Survey
,”
IEEE Comput. Graphics Appl.
,
11
(
1
), pp.
55
71
.10.1109/38.67702
4.
Hoschek
,
J.
, and
Lasser
,
D.
,
1993
,
Fundamentals of Computer Aided Geometric Design
,
A. K. Peters, Ltd.
,
Natick, MA
.
5.
Coons
,
S. A.
,
1967
, “
Surfaces for Computer Aided Design of Space Forms
,” MIT, Cambridge, MA, Technical Report No. MAC-TR-41.
6.
Versprille
,
K. J.
,
1975
, “
Computer-Aided Design Applications of the Rational B-Spline Approximation Form
,” Ph.D. thesis, Syracuse University, Syracuse, NY.
7.
Piegl
,
L.
, and
Tiller
,
W.
,
1987
, “
Curve and Surface Constructions Using Rational B-Splines
,”
Comput. Aided Des.
,
19
(
9
), pp.
485
498
.10.1016/0010-4485(87)90234-X
8.
Tiller
,
W.
,
1983
, “
Rational B-Splines for Curve and Surface Representation
,”
IEEE Comput. Graphics Appl.
,
3
(
6
), pp.
6
69
.10.1109/MCG.1983.263244
9.
Cox
,
M. G.
,
1972
, “
The Numerical Evaluation of B-Splines
,”
IMA J. Appl. Math.
,
10
(
2
), pp.
134
149
.10.1093/imamat/10.2.134
10.
de Boor
,
C.
,
1972
, “
On Calculating With B-Splines
,”
J. Approximation Theory
,
6
(
1
), pp.
50
62
.10.1016/0021-9045(72)90080-9
11.
Boo
,
M.
,
Bruguera
,
J. D.
, and
Lopez-Zapata
,
E.
,
2000
, “
Parallel Architecture for the Computation of NURBS Surfaces
,”
Proc. SPIE.
3970
, pp.
37
48
.10.1117/12.375243
12.
Gopi
,
M. S.
, and
Manohar
,
S.
,
1995
, “
A VLSI Architecture for the Computation of NURBS Patches
,”
Proceedings of the 8th International Conference on VLSI Design, VLSID'95
,
IEEE
Computer Society,
New Delhi, India
, Jan. 4–7, pp.
326
331
10.1109/ICVD.1995.512133.
13.
Krishnamurthy
,
A.
,
Khardekar
,
R.
,
McMains
,
S.
,
Haller
,
K.
, and
Elber
,
G.
,
2009
, “
Performing Efficient NURBS Modeling Operations on the GPU
,”
IEEE Trans. Visualization Comput. Graphics
,
15
(
4
), pp.
530
543
.10.1109/TVCG.2009.29
14.
Luken
,
W. L.
, and
Cheng
,
F.
,
1996
, “
Comparison of Surface and Derivative Evaluation Methods for the Rendering of NURB Surfaces
,”
ACM Trans. Graphics
,
15
(
2
), pp.
153
178
.10.1145/234972.234977
15.
Balázs
,
Á.
,
Guthe
,
M.
, and
Klein
,
R.
,
2004
, “
Efficient Trimmed NURBS Tessellation
,”
J. WSCG
,
12
(
1
), pp.
27
33
.
16.
Espino
,
F. J.
,
Bóo
,
M.
,
Amor
,
M.
, and
Bruguera
,
J.
,
2003
, “
Adaptive Tessellation of NURBS Surfaces
,”
J. WSCG
,
11
(
1
), pp.
133
140
.
17.
Luken
,
W. L.
,
1996
, “
Tessellation of Trimmed NURB Surfaces
,”
Comput. Aided Geom. Des.
,
13
(
2
), pp.
163
177
.10.1016/0167-8396(95)00019-4
18.
Piegl
,
L. A.
, and
Richard
,
A. M.
,
1995
, “
Tessellating Trimmed NURBS Surfaces
,”
Comput. Aided Des.
,
27
(
1
), pp.
16
26
.10.1016/0010-4485(95)90749-6
19.
Piegl
,
L.
, and
Tiller
,
W.
,
1997
,
The NURBS Book
, 2nd ed.,
Springer-Verlag
,
New York
10.1007/978-3-642-59223-2.
20.
de Boor
,
C.
,
2001
,
A Practical Guide to Splines
, Rev. ed.,
Springer-Verlag
,
New York
.
You do not currently have access to this content.