Natasha Dejdumrong

Learn More
There are several techniques used for plotting a Bézier curve, i.e., using direct Bernstein basis computation, employing the de Casteljau algorithm, and polar form approach. However, all of them suffer from the computational complexity and there are several attempts to enhance the efficiency for the construction of Bézier curves. Iterative(More)
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the sets of pixel information. Thus, the determination of curve matching is to compare pixel by pixel, which is time consuming. On the contrary, for vector graphics images, there have(More)
In this paper, a normalized totally positive (NTP) basis given by Delgado and Pena is used to form non-rational and rational DP-Ball curves. The relationships between rational Bezier and rational DP-Ball curves are given using homogeneous coordinates. Consequently, an efficient algorithm with linear computational complexity is introduced in order to be used(More)
There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former method, evaluating a curve using their basis functions is a tedious task because their equations need to be solved by using complicated formulae computations. Whereas for the latter(More)
A new approach to Thai font type recognition that is presented in this paper is based on linear interpolation analysis of the character contour. The algorithm can perform effectively and classify font type obviously. The same font type show high similarity coefficient which is 83.95 but the different font types is below 35.54.
DP curve is a recent representation of the polynomial curves, proposed by Delgado and Pena in 2003. This curve has been claimed for its normalized totally positive (NTP) property and requires only the linear time computation. These properties indicate the shape preservation and the efficiency of evaluating the points on DP curves. Among several important(More)
Typically, the shape preserving property for a parametric curve can be verified by checking for the total positivity of the collocation matrix or finding the existence of corner cutting algorithm as presented in [8]. However, there are several cases that although the curve is satisfied the shape preserving property, the shape of the curve does not preserve(More)