Özkan inik1,∗, Erkan Ülker2, ismail Koç2
Computer Systems Science and Engineering, Vol.35, No.6, pp. 431-440, 2020, DOI:10.32604/csse.2020.35.431
Abstract The location of knot points and estimation of the number of knots are undoubtedly known as one of the most difficult problems in B-Spline curve
approximation. In the literature, different researchers have been seen to use more than one optimization algorithm in order to solve this problem. In this
paper, Big Bang-Big Crunch method (BB-BC) which is one of the evolutionary based optimization algorithms was introduced and then the approximation
of B-Spline curve knots was conducted by this method. The technique of reverse engineering was implemented for the curve knot approximation. The
detection of knot locations and the number of… More >
Login
Register
