loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth International Conference on Information Visualisation (IV'05)
Curve Approximation with Quadratic B-Splines
London, England
July 06-July 08
ISBN: 0-7695-2397-8
Asif Masood, University of Engineering and Technology - Lahore
Muhammad Sarfraz, King Fahd University of Petroleum and Minerals
Shaiq A. Haq, University of Engineering and Technology - Lahore
A curve approximation technique using quadratic B-splines is presented in this paper which automatically computes data points to minimize errors. This technique can be useful for efficient storage of geometric shapes in any graphic or CAD applications. The computed data points are the control points and knots of approximating quadratic B-spline curve rather than simple interpolants. Curve approximation is a three step process, involving computation of initial data points from the opening angle plot of given curve, new knot(s) insertion at appropriate location and error minimization by changing knot positions. The algorithm is simple, efficient and robust to any curve model. Demonstrated results show that even higher degree polynomial curves can be approximated with very few data points with reasonable accuracy.
Index Terms:
Curve approximation, Quadratic B-splines, Data Points, Knots, Opening angle plot
Citation:
Asif Masood, Muhammad Sarfraz, Shaiq A. Haq, "Curve Approximation with Quadratic B-Splines," iv, pp.419-424, Ninth International Conference on Information Visualisation (IV'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.