• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.159-169
• /
• 2005

An algorithmic approach to degree reduction of rational Bezier curves is presented. The algorithms are based on the degree reduction of polynomial Bezier curves. The method is introduced with the following steps: (a) convert the rational Bezier curve to polynomial Bezier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bezier curve, (c) determine weights of degree reduced curve, (d) convert the Bezier curve obtained through step (b) to rational Bezier curve with weights in step (c).

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.267-281
• /
• 2016

In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.

• Phonetics and Speech Sciences
• /
• v.12 no.2
• /
• pp.9-16
• /
• 2020

The present study examines the degree of suffix reduction that occurs when the Korean suffix [-nɨn] was attached to the root in spontaneous Seoul Korean speech. Specifically, it focuses on the degrees of reduction produced by individual speakers. The degree of reduction was assessed as the duration of the suffix [-nɨn] to clarify the continuum between the full and reduced forms. The results revealed that, first, the reduced forms of the suffix [-nɨn] were significantly distinguished from the full forms in the suffixation processes. Second, regarding parts of speech, the differences among individual speakers on the degrees of reduction were clearer when the suffix [-nɨn] was attached to verbs, rather than nouns and pronouns. Finally, the length of a root played a critical role in determining the degree of reduction of the suffix [-nɨn]. The degrees of reduction for individual speakers significantly differed when the suffix [-nɨn] was attached to two-syllable roots than three- and four-syllable roots. In conclusion, individual differences in the degrees of reduction were likely to occur when the roots are verbs and when two-syllable roots.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.875-883
• /
• 1999

서로 다른 기하학적 모델링 시스템에 사용되는 곡선 및 곡면의 자료 교환에서, 시스템이 지원하는 그 곡선 및 곡면의 최대 차수에 제한이 있을 때, 낮은 차수로의 차수 감소가 필요하다. 본 논문에서는 근사 변환에 의한 B-spline 곡선의 차수 감소 방법을 제시한다. 기존의 Bzier 곡선의 차수감소 방법들을 적용하고, 그 방법들을 비교 분석한다. B-spline 곡선의 knot 제거 알고리즘이 자료 감소를 위해 차수 감소 과정에 적용된다.Abstract The degree reduction of B-splines is required in exchanging parametric curves and surfaces of the different geometric modeling systems because some systems limit the supported maximal degree. We propose an approximate degree reduction method of B-spline curves using the existing Bzier degree reduction methods. Knot removal algorithm is used to reduce data in the degree reduction process.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.7-12
• /
• 2003

Because some systems limit the supported maximal degree, the degree reduction of NURBS is necessary in Parametric curves and surfaces of the different geometric modeling systems. Therefore an approximate degree reduction method of NURBS curves was introduced in this research. Also the existing Eck's B$\'{e}$zier degree reduction method and knot removal algorithm were used to reduce data in the degree reduction process. Finally we found that this method was stable, efficient for implementations, and easy to use algorithms.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.605-614
• /
• 2008

In this paper, we find the matrix representation of multi-degree reduction by $L_{\infty}$ of $B{\acute{e}}zier$ curves with constraints of endpoints continuity. Using the basis transformation between Chebyshev polynomials and Bernstein polynomials we can derive the matrix representation of multi-degree reduction of $B{\acute{e}}zier$ with respect to $L_{\infty}$ norm.

• The Pure and Applied Mathematics
• /
• v.31 no.1
• /
• pp.57-81
• /
• 2024

We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.35-44
• /
• 2005

The degree reduction of B-splines is necessary in exchanging parametric curves and surfaces of the different geometric modeling systems because some systems limit the supported maximal degree. In this paper, We provide an our experimental results in approximate conversion for B-splines apply to degree reduction. We utilize the existing Bezier degree reduction methods, and analyze the methods. Also, knot removal algorithm is used to reduce data in the degree reduction Process.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.819-827
• /
• 2001

An algorithmic approach to degree reduction of B-spline curves is presented. The new algorithms are based on the blossoming spline curves are obtained by the generalized least square method. The computations are carried out by minimizing the $L_2$ distamce between the two curves.

• Journal of Environmental Health Sciences
• /
• v.27 no.1
• /
• pp.14-19
• /
• 2001

The physical and chemical transformation and reduction degree of food waste were investigated in a food waste reduction machine using thermophilic bacteria. The first operation of the reduction machine for grain, vegetables, fishes and flesh wastes proceeded during three weeks. The first and second reduction percentages of the wastes were 98.3% and 93.2%, respectively. The residue of food waste was composed of fruits, fish, and vegetables. The temperature distribution of the reduction machine ranged between 30 and 6$0^{\circ}C$ appropriate for growth of thermophilic bacteria. At initial stage the pH in the reduction machine decreased with organic acids produced, but increased as the organic acids decomposed by different thermophilic bacteria. In the reduction machine, the moisture content of the food waste was reduced from 80-90% to 10-20% after 24 hours, and the salinity of residue was 0.29% after the second operation. The degree of odor was most high between 2 and 4 hours.