Regularity and Convexity of NURBS Curves

Article Preview

Abstract:

Determining regularity and convexity of NURBS curves is necessary in computer aided geometric design. In this paper, the problems above are converted to the questions related to polynomials. Then based on properties of algebraic equations and isolation theorem of roots, a simple and practical method for determining those geometric properties of NURBS curves is put forward. Compared with traditional method it will save us much computation

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 655-657)

Pages:

1300-1303

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] F.Z. Shi: Computer Aided Geometric Design and N-Uniform Rational B-spline, in Chinese, 2001.

Google Scholar

[2] I. Juhasz, M. Hoffmann, Computer-Aided Design, vol. 36(2004), pp.437-445

Google Scholar

[3] M. Pourazady, X. Xu, Advances in Engineering Software, vol. 31(2000), pp.107-118

Google Scholar

[4] L. Diegl, M. Tiller, The NURBS Book, splinger, Berlin, 1997.

Google Scholar

[5] L. Z. Nie, S.S. Ding, Introduction to Algebraic, in Chinses, Higher Education press, Beijing, 2000 .

Google Scholar

[6] T. A. Grandine, Computer Aided Geometric Design, vol . 6, (1989), pp.129-136

Google Scholar

[7] H.W. Lin,Q. Wang, H.J. Bao, Jounal of Software, in Chinese,vol .17(2006), pp.516-524

Google Scholar

[8] J. Kryser, T. Culver, D. Manoncha, S. Krisnan, Computer-Aided Design, vol. 32(2000), pp.649-662

Google Scholar