METHOD AND SYSTEM FOR APPROXIMATING CURVE, AND GRAPHIC DISPLAY CONTROL METHOD AND APPARATUS

Abstract

A method and system for approximating a curve, and a graphic display control method and apparatus are disclosed. The method for approximating a curve comprises the steps of acquiring number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve, acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points, and connecting the subdividing points with straight lines based on the coordinate information of the subdividing points. The invention could achieve efficient curve approximation and in turn achieve efficient graphic-display control.

Description

TECHNICAL FIELD

The invention relates to graphic processing, and particularly relates to a method and apparatus for approximating a curve and a graphic display control method and apparatus.

BACKGROUND

In computer graphics applications, rendering characters is an important branch. Two-dimensional characters are generally formed by quadratic Bezier curves, cubic Bezier curves, and elliptical curves etc., in a two-dimensional plane.

It is inefficient, for a Graphics Display Controller (GDC) chip, to render curves pixel by pixel by tracking along the curves. With appropriate precision, it is reasonable to approximate a curve with straight lines. It is a tradeoff between precision and speed. For many applications of GDC chips, speed overwhelms precision, such as car navigation, mobile phone, and amusement displayer.

Approximating a curve with straight lines needs to firstly subdivide the curve with subdividing points, then calculate coordinates of the subdividing points, and finally connect adjacent subdividing points via straight lines. It is a long existing problem to approximate a curve. There exist many solutions to approximate Bezier curves, such as direct method, recursive subdivision, forward differencing, and hybrid method. However, these methods are not fast enough.

As Bezier curves are commonly represented by polynomials of parameter t (for example, x(t)=a·t²+b·t+c, y(t)=d·t²+e·t+f for quadratic Bezier curve, where the coefficients a, b, c, d, e, and f can be calculated by control points of the quadratic Bezier curve), the coordinate values of each subdividing point can be calculated directly, given the parameter t at each subdividing point. Although this method is simple and direct, it needs too many multiplications for each subdividing point.

Recursive subdivision is a recursive procedure, to find step by step subdividing points by calculating the middle points on each edge of a control polygon. Connecting adjacent subdividing points will form straight lines. Setting an appropriate threshold of flatness, the straight lines will approximate a curve with reasonable precision. However, the recursive procedure and calculating flatness will take a large amount of time.

Forward differencing is suitable for Bezier curves. The coordinate values of a next subdividing point can be got by adding the coordinate values of a previous subdividing point with difference values. With a fixed step, the coordinate values of each subdividing point can be calculated by just several addition operations. Therefore, the speed is very high. However, the number of the subdividing points (i.e. the step) needs to be determined before calculating the coordinates.

The hybrid method combines recursive subdivision and forward differencing together. It first uses recursive subdivision and flatness to obtains the parameter of each subdividing point, and then uses forward differencing to calculate the coordinate values of each subdividing point. This method is complex for implementation.

Therefore, a method and/or apparatus for approximating a curve, used in curve rendering and more efficient than the abovementioned methods, are needed.

SUMMARY OF THE INVENTION

In view of one or more of the above problems, this invention proposes a method and apparatus for approximating a curve and a graphic-display control method and apparatus.

The method for approximating a curve according to an aspect of the invention, comprising the steps of: acquiring number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve; acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and connecting the subdividing points with straight lines based on the coordinate information of the subdividing points.

The apparatus for approximating a curve according to another aspect of the invention, comprising: a number acquiring unit configured to acquire number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve; a coordinate acquiring unit configured to acquire coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and a curve approximating unit configured to connect the subdividing points with straight lines based on the coordinate information of the subdividing points.

The graphic-display control method according to still another aspect of the invention, comprising the steps of: acquiring number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve; acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and connecting the subdividing points with straight lines based on the coordinate information of the subdividing points and drawing the straight lines connecting the subdividing points according to rendering parameters.

The graphic-display control apparatus according to still another aspect of the invention, comprising: a number acquiring unit configured to acquire number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve; a coordinate acquiring unit configured to acquire coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and a curve rendering unit configured to connect the subdividing points with straight lines based on the coordinate information of the subdividing points and draw the straight lines connecting the subdividing points according to rendering parameters.

To sum up, the invention achieves efficient curve approximation and efficient graphic-display control by acquiring the number information of the subdividing points for subdividing a curve by means of using the coordinate information of the control points of the curve, acquiring the coordinate information of the subdividing points according to the number information of the subdividing points and the coordinate information of the control points.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention can be easily understood from the following description of the preferred embodiments of this invention in conjunction with the drawings, in which

FIG. 1 illustrates schematic diagrams of a quadratic Bezier curve, a cubic Bezier curve and an elliptical curve;

FIG. 2 illustrates schematic diagram of a relationship between an area difference and a subdividing step, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis;

FIG. 3 illustrates a conceptual schematic diagram of forward differencing for approximating a Bezier curve;

FIG. 4 illustrates a schematic diagram of the procedure for affine transforming a unit circle to acquire an ellipse;

FIG. 5 illustrates a block diagram of a graphic-display control apparatus according to an embodiment of the invention;

FIG. 6 illustrates a detailed block diagram of a subdivision module shown in FIG. 5; and

FIG. 7 illustrates a detailed block diagram of a coordinate calculation module shown in FIG. 5.

DESCRIPTIONS OF THE PREFERRED EMBODIMENTS

Features in respective aspects and exemplary embodiments of the invention will be described in detail below. In the following detailed description, a number of specific details are proposed to provide thorough understanding of the invention. However, it is obvious to those skilled in the art that the invention can be implemented without some of the specific details. The following descriptions of the embodiments are merely to provide better understanding of the invention by illustrating examples of the invention. The invention is not limited to any specific configuration and algorithm mentioned below, and covers any modification, substitution and improvement of the elements, components and algorithms without departing from the spirit of the invention. In the figures and the following description, well-known structures and techniques are not disclosed to avoid unnecessarily obscuring the invention.

FIG. 1 illustrates diagrams of a quadratic Bezier curve, a cubic Bezier curve and an elliptical curve. As shown in FIG. 1, the quadratic Bezier curve 102 has three control points: P₀(x₀, y₀), P₁(x₁, y₁) and P₂ (x₂ y₂); the cubic Bezier curve 104 has four control points: P₀(x₀, y₀), P₁(x₁, y₁), P₂ (x₂,y₂) and P₃ (x₃,y₃). These control points constitute a control polygon for each curve respectively. The elliptical curve 106 has a horizontal radius rh, a vertical radius rv, a starting angle θ₀, a terminating angle θ₁, a center point P_c(x_c, y_c), a rotation angle rot and a symbol indicating whether the elliptical curve rotates counterclockwise (CCW) or clockwise (CW).

The parametrical equation of the quadratic Bezier curve is

x(t)=(1−t)²x₀+2t(1−t)x₁+t²x₂

y(t)=(1−t)²y₀+2t(1−t)y₁+t²y₂  (1)

where 0≦t≦1. The parametrical equation of the quadratic Bezier curve can be set as another form:

x(t)=a_qxt²+b_qxt+c_qx

y(t)=a_qyt²+b_qyt+c_qy  (2)

where a_qx=x₂−2x₁+x₀, b_qx=2(x₁−x₀), c_qx=x₀, a_qy=y₂−2y₁+y₀, b_qy=2(y₁−y₀), and c_qy=y₀.

The parametrical equation of the cubic Bezier curve is

x(t)=(1−t)³x₀+3t(1−t)²x₁+3t²(1−t)x₂+t³x₃

y(t)=(1−t)³y₀+3t(1−t)²y₁+3t²(1−t)y₂+t³y₃  (3)

where 0≦t≦1. The parametrical equations of the cubic Bezier curve can also be set as another form:

x(t)=a_cxt³+b_cxt²+c_cxt+d_cx

y(t)=a_cyt³+b_cyt²+c_cyt+d_cy  (4)

wherein a_cx=x₃−3x₂+3x₁−x₀, b_cx=3x₂−6x₁+3x₀, c_cx=3x₁−3x₀, d_cx=x₀, a_cy=y₃−3y₂+3y₁−y₀, b_cy=3y₂−6y₁+3y₀, c_cy,=3y₁−3y₀ and d_cy=y₀.

The parametrical equation of the elliptical curve is

$\begin{array}{cc}\left[\begin{array}{c}x\\ y\\ 1\end{array}\right]=\left[\begin{array}{ccc}\mathrm{rh}·\cos \left(\mathrm{rot}\right)& -\mathrm{rv}·\sin \left(\mathrm{rot}\right)& x_c\\ \mathrm{rh}·\sin \left(\mathrm{rot}\right)& \mathrm{rv}·\cos \left(\mathrm{rot}\right)& y_c\\ 0& 0& 1\end{array}\right]\left[\begin{array}{c}\cos \theta \\ \sin \theta \\ 1\end{array}\right],& \left(5\right)\end{array}$

where θ is the parameter of any point on the elliptical curve, and rot is the rotation angle of the elliptical curve relative to the coordinate system. The elliptical curve can be regarded as a result of affine transforming a unit circle (cos θ, sin θ).

FIG. 2 illustrates a schematic diagram of a relationship between an area difference and a subdividing step, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis.

The area difference ΔA between the area of a curve segment corresponding to a subdividing step Δt with respect to X coordinate axis and the area of a line segment between two points corresponding to the subdividing step on the curve with respect to X coordinate axis can be obtained by the following expression:

ΔA=A−A_a,  (6)

where A is the area of the curve segment corresponding to Δt with respect to X coordinate axis, and A_a is the area of the line segment between two end points on the curve segment with respect to X coordinate axis.

If the curve segment is part of the quadratic Bezier curve, then there exist the following equations

$\begin{array}{cc}\begin{array}{c}A={\int }_t^{t+\Delta t}y\left(t\right)x\left(t\right)\\ ={\int }_t^{t+\Delta t}\left(a_{\mathrm{qy}}t^2+b_{\mathrm{qy}}t+c_{\mathrm{qy}}\right)\left(2a_{\mathrm{qx}}t+b_{\mathrm{qx}}\right)t\\ =\frac{a_{\mathrm{qx}}a_{\mathrm{qy}}}{2}\Delta t^4+\left(2a_{\mathrm{qx}}a_{\mathrm{qy}}t+\frac{a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}}{3}\right)\Delta t^3+\\ \left(\begin{array}{c}3a_{\mathrm{qx}}a_{\mathrm{qy}}t^2+\\ \left(a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}\right)t+\\ \frac{b_{\mathrm{qx}}b_{\mathrm{qy}}+2a_{\mathrm{qx}}c_{\mathrm{qy}}}{2}\end{array}\right)\Delta t^2+\left(\begin{array}{c}2a_{\mathrm{qx}}a_{\mathrm{qy}}t^3+\\ \left(a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}\right)t^2+\\ \left(b_{\mathrm{qx}}b_{\mathrm{qy}}+2a_{\mathrm{qx}}c_{\mathrm{qy}}\right)t+\\ b_{\mathrm{qx}}c_{\mathrm{qy}}\end{array}\right)\Delta t\end{array}& \left(7\right)\\ \mathrm{and}& \\ \begin{array}{c}{A}_a=\frac{\left(y\left(t\right)+y(t+\Delta t)\right)·\left(x(t+\Delta t)-x\left(t\right)\right)}{2}\\ =\frac{1}{2}\left(\begin{array}{c}{a}_{\mathrm{qy}}t^2+b_{\mathrm{qy}}t+c_{\mathrm{qy}}+{a_{\mathrm{qy}}(t+\Delta t)}^2+\\ b_{\mathrm{qy}}(t+\Delta t)+c_{\mathrm{qy}}\end{array}\right)·\\ \left(a_{\mathrm{qx}}\left(\Delta t^2+2t·\Delta t\right)+b_{\mathrm{qx}}\Delta t\right)\\ =\frac{a_{\mathrm{qx}}a_{\mathrm{qy}}}{2}\Delta t^4+\left(2a_{\mathrm{qx}}a_{\mathrm{qy}}t+\frac{a_{\mathrm{qy}}b_{\mathrm{qx}}+a_{\mathrm{qx}}b_{\mathrm{qy}}}{2}\right)\Delta t^3+\\ \left(\begin{array}{c}3a_{\mathrm{qx}}a_{\mathrm{qy}}t^2+\\ \left(a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}\right)t+\\ \frac{b_{\mathrm{qx}}b_{\mathrm{qy}}+2a_{\mathrm{qx}}c_{\mathrm{qy}}}{2}\end{array}\right)\Delta t^2+\left(\begin{array}{c}2a_{\mathrm{qx}}a_{\mathrm{qy}}t^3+\\ \left(a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}\right)t^2+\\ \left(b_{\mathrm{qx}}b_{\mathrm{qy}}+2a_{\mathrm{qx}}c_{\mathrm{qy}}\right)t+\\ b_{\mathrm{qx}}c_{\mathrm{qy}}\end{array}\right)\Delta t\end{array}& \left(8\right)\end{array}$

Therefore, the area difference between the area of the curve segment corresponding to Δt with respect to X coordinate axis and the area of the line segment between the two points on the curve segment corresponding to the subdividing step with respect to X coordinate axis is

$\begin{array}{cc}\begin{array}{c}\Delta A=A-A_a\\ =\left(\frac{a_{\mathrm{qy}}b_{\mathrm{qx}}+2a_{\mathrm{qx}}b_{\mathrm{qy}}}{3}-\frac{a_{\mathrm{qy}}b_{\mathrm{qx}}+a_{\mathrm{qx}}b_{\mathrm{qy}}}{2}\right)\Delta t^3\\ =\frac{a_{\mathrm{qx}}b_{\mathrm{qy}}-a_{\mathrm{qy}}b_{\mathrm{qx}}}{6}\Delta t^3\\ =Q·\Delta t^3\end{array}& \left(9\right)\end{array}$

As can be seen from the above expression, the area difference has no relationship with the parameter t, but with Δt. If ΔA is set to a threshold T, (5 pixels, for example), Δt can be obtained by the following expression:

$\begin{array}{cc}\Delta t=\sqrt[3]{\frac{T}{Q}}.& \left(10\right)\end{array}$

If the curve segment is part of the cubic Bezier curve, then there exist the following equations:

$\begin{array}{cc}\begin{array}{c}A={\int }_t^{t+\Delta t}y\left(t\right)x\left(t\right)\\ ={\int }_t^{t+\Delta t}\left(a_{\mathrm{cy}}t^3+b_{\mathrm{cy}}t^2+c_{\mathrm{cy}}t+d_{\mathrm{cy}}\right)\left(3a_{\mathrm{cx}}t^2+2b_{\mathrm{cx}}t+c_{\mathrm{cx}}\right)t\\ =\frac{a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}\Delta t^6+\left(3a_{\mathrm{cx}}a_{\mathrm{cy}}t+\frac{3a_{\mathrm{cx}}b_{\mathrm{cy}}+2a_{\mathrm{cy}}b_{\mathrm{cx}}}{5}\right)\Delta t^5+\\ \left(\frac{15a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}t^2+\left(\begin{array}{c}2a_{\mathrm{cy}}b_{\mathrm{cx}}+\\ 3a_{\mathrm{cx}}b_{\mathrm{cy}}\end{array}\right)t+\left(\frac{\begin{array}{c}{a}_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 2b_{\mathrm{cx}}b_{\mathrm{cy}}+\\ 3a_{\mathrm{cx}}c_{\mathrm{cy}}\end{array}}{4}\right)\right)\Delta t^4+\\ \left(\begin{array}{c}10a_{\mathrm{cx}}a_{\mathrm{cy}}t^3+\left(\begin{array}{c}4a_{\mathrm{cy}}b_{\mathrm{cx}}+\\ 6a_{\mathrm{cx}}b_{\mathrm{cy}}\end{array}\right)t^2+\left(\begin{array}{c}{a}_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 2b_{\mathrm{cx}}b_{\mathrm{cy}}+\\ 3a_{\mathrm{cx}}c_{\mathrm{cy}}\end{array}\right)t+\\ \frac{b_{\mathrm{cy}}c_{\mathrm{cx}}+2b_{\mathrm{cx}}c_{\mathrm{cy}}+3a_{\mathrm{cx}}d_{\mathrm{cy}}}{3}\end{array}\right)\Delta t^3+\\ \left(\begin{array}{c}\frac{15a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}t^4+\left(\begin{array}{c}4a_{\mathrm{cy}}b_{\mathrm{cx}}+\\ 6a_{\mathrm{cx}}b_{\mathrm{cy}}\end{array}\right)t^3+\left(\frac{\begin{array}{c}3a_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 6b_{\mathrm{cx}}b_{\mathrm{cy}}+\\ 9a_{\mathrm{cx}}c_{\mathrm{cy}}\end{array}}{2}\right)t^2+\\ \left(\begin{array}{c}{b}_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 2b_{\mathrm{cx}}c_{\mathrm{cy}}+\\ 3a_{\mathrm{cx}}d_{\mathrm{cy}}\end{array}\right)t+\frac{c_{\mathrm{cx}}c_{\mathrm{cy}}+2b_{\mathrm{cx}}d_{\mathrm{cy}}}{2}\end{array}\right)\Delta t^2+\\ \left(\begin{array}{c}3a_{\mathrm{cx}}a_{\mathrm{cy}}t^5+\left(\begin{array}{c}2a_{\mathrm{cy}}b_{\mathrm{cx}}+\\ 3a_{\mathrm{cx}}b_{\mathrm{cy}}\end{array}\right)t^4+\left(\begin{array}{c}{a}_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 2b_{\mathrm{cx}}b_{\mathrm{cy}}+\\ 3a_{\mathrm{cx}}c_{\mathrm{cy}}\end{array}\right)t^3+\\ \left(\begin{array}{c}{b}_{\mathrm{cy}}c_{\mathrm{cx}}+\\ 2b_{\mathrm{cx}}c_{\mathrm{cy}}+\\ 3a_{\mathrm{cx}}d_{\mathrm{cy}}\end{array}\right)t^2+\left(c_{\mathrm{cx}}c_{\mathrm{cy}}+2b_{\mathrm{cx}}d_{\mathrm{cy}}\right)t+c_{\mathrm{cx}}d_{\mathrm{cy}}\end{array}\right)\Delta t\end{array}& \left(11\right)\\ \mathrm{and}& \\ \begin{array}{c}{A}_a=\frac{\left(y\left(t\right)+y(t+\Delta t)\right)·\left(x(t+\Delta t)-x\left(t\right)\right)}{2}\\ =\frac{1}{2}\left(\begin{array}{c}{a}_{\mathrm{cy}}t^3+b_{\mathrm{cy}}t^2+c_{\mathrm{cy}}t+d_{\mathrm{cy}}+{a_{\mathrm{cy}}(t+\Delta t)}^3+\\ {b_{\mathrm{cy}}(t+\Delta t)}^2+c_{\mathrm{cy}}(t+\Delta t)+d_{\mathrm{cy}}\end{array}\right)·\\ \left(a_{\mathrm{cx}}\left(\Delta t^3+3t·\Delta t^2+3t^2·\Delta t\right)+b_{\mathrm{cx}}\left(\Delta t^2+2t·\Delta t\right)+c_{\mathrm{cx}}\Delta t\right)\\ =\frac{a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}\Delta t^6+\left(3a_{\mathrm{cx}}a_{\mathrm{cy}}t+\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}+a_{\mathrm{cy}}b_{\mathrm{cx}}}{2}\right)\Delta t^5+\\ \left(\begin{array}{c}\frac{15a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}t^2+\\ \frac{5a_{\mathrm{cy}}b_{\mathrm{cx}}+5a_{\mathrm{cx}}b_{\mathrm{cy}}}{2}t+\\ \frac{a_{\mathrm{cy}}c_{\mathrm{cx}}+b_{\mathrm{cx}}b_{\mathrm{cy}}+a_{\mathrm{cx}}c_{\mathrm{cy}}}{2}\end{array}\right)\Delta t^4+\\ \left(\begin{array}{c}10a_{\mathrm{cx}}a_{\mathrm{cy}}t^3+\frac{9a_{\mathrm{cy}}b_{\mathrm{cx}}+11a_{\mathrm{cx}}b_{\mathrm{cy}}}{2}t^2+\\ \frac{5a_{\mathrm{cx}}c_{\mathrm{cy}}+4b_{\mathrm{cx}}b_{\mathrm{cy}}+3a_{\mathrm{cy}}c_{\mathrm{cx}}}{2}t+\\ \frac{b_{\mathrm{cy}}c_{\mathrm{cx}}+b_{\mathrm{cx}}c_{\mathrm{cy}}+2a_{\mathrm{cx}}d_{\mathrm{cy}}}{2}\end{array}\right)\Delta t^3+\\ \left(\begin{array}{c}\frac{15a_{\mathrm{cx}}a_{\mathrm{cy}}}{2}t^4+\left(4a_{\mathrm{cy}}b_{\mathrm{cx}}+6a_{\mathrm{cx}}b_{\mathrm{cy}}\right)t^3+\\ \frac{3a_{\mathrm{cy}}c_{\mathrm{cx}}+6b_{\mathrm{cx}}b_{\mathrm{cy}}+9a_{\mathrm{cx}}c_{\mathrm{cy}}}{2}t^2+\\ \left(b_{\mathrm{cy}}c_{\mathrm{cx}}+2b_{\mathrm{cx}}c_{\mathrm{cy}}+3a_{\mathrm{cx}}d_{\mathrm{cy}}\right)t+\\ \frac{c_{\mathrm{cx}}c_{\mathrm{cy}}+2b_{\mathrm{cx}}d_{\mathrm{cy}}}{2}\end{array}\right)\Delta t^2+\\ \left(\begin{array}{c}3a_{\mathrm{cx}}a_{\mathrm{cy}}t^5+\left(2a_{\mathrm{cy}}b_{\mathrm{cx}}+3a_{\mathrm{cx}}b_{\mathrm{cy}}\right)t^4+\\ \left(a_{\mathrm{cy}}c_{\mathrm{cx}}+2b_{\mathrm{cx}}b_{\mathrm{cy}}+3a_{\mathrm{cx}}c_{\mathrm{cy}}\right)t^3+\\ \left(b_{\mathrm{cy}}c_{\mathrm{cx}}+2b_{\mathrm{cx}}c_{\mathrm{cy}}+3a_{\mathrm{cx}}d_{\mathrm{cy}}\right)t^2+\\ \left(c_{\mathrm{cx}}c_{\mathrm{cy}}+2b_{\mathrm{cx}}d_{\mathrm{cy}}\right)t+c_{\mathrm{cx}}d_{\mathrm{cy}}\end{array}\right)\Delta t\end{array}& \left(12\right)\\ \mathrm{Then},& \\ \begin{array}{c}\Delta A=A-A_a\\ =\left(\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}-a_{\mathrm{cy}}b_{\mathrm{cx}}}{10}\right)\Delta t^5+\left(\begin{array}{c}\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}-a_{\mathrm{cy}}b_{\mathrm{cx}}}{2}t+\\ \frac{a_{\mathrm{cx}}c_{\mathrm{cy}}-a_{\mathrm{cy}}c_{\mathrm{cx}}}{4}\end{array}\right)\Delta t^4+\\ \left(\begin{array}{c}\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}-a_{\mathrm{cy}}b_{\mathrm{cx}}}{2}t^2+\\ \frac{a_{\mathrm{cx}}c_{\mathrm{cy}}-a_{\mathrm{cy}}c_{\mathrm{cx}}}{2}t+\\ \frac{b_{\mathrm{cx}}c_{\mathrm{cy}}-b_{\mathrm{cy}}c_{\mathrm{cx}}}{6}\end{array}\right)\Delta t^3\end{array}& \left(13\right)\end{array}$

As Δt is between (0,1] under general conditions, two items Δt⁵Δt⁴ can be omitted, then the above mentioned equation (13) becomes

$\begin{array}{cc}\begin{array}{c}\Delta A\approx \left(\begin{array}{c}\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}-a_{\mathrm{cy}}b_{\mathrm{cx}}}{2}t^2+\\ \frac{a_{\mathrm{cx}}c_{\mathrm{cy}}-a_{\mathrm{cy}}c_{\mathrm{cx}}}{2}t+\frac{b_{\mathrm{cx}}c_{\mathrm{cy}}-b_{\mathrm{cy}}c_{\mathrm{cx}}}{6}\end{array}\right)\Delta t^3\\ =C\left(t\right)·\Delta t^3.\end{array}& \left(14\right)\end{array}$

If the maximum value of

$\begin{array}{cc}\begin{array}{c}C\left(t\right)=\frac{a_{\mathrm{cx}}b_{\mathrm{cy}}-a_{\mathrm{cy}}b_{\mathrm{cx}}}{2}t^2+\frac{a_{\mathrm{cx}}c_{\mathrm{cy}}-a_{\mathrm{cy}}c_{\mathrm{cx}}}{2}t+\frac{b_{\mathrm{cx}}c_{\mathrm{cy}}-b_{\mathrm{cy}}c_{\mathrm{cx}}}{6}\\ =L·t^2+M·t+N\end{array}& \end{array}$

can be obtained, then the abovementioned equation (14) will be

ΔA≈C_max·Δt³  (15)

As in general cases, the scope of t is [0.0,1.0], to find the maximum value of C(t) is to find the maximum value of among t=0.0, t=1.0 and

$t=-\frac{M}{2L}.$

These three values are

$\begin{array}{cc}{\mathrm{val}}_{t=0}=\frac{b_xc_y-b_yc_x}{6}{\mathrm{val}}_{t=1}=\frac{a_xb_y-a_yb_x}{2}+\frac{a_xc_y-a_yc_x}{2}+\frac{b_xc_y-b_yc_x}{6}{\mathrm{val}}_{t=-M/\left(2L\right)}=-\frac{M^2}{4L}+N& \left(16\right)\end{array}$

Therefore,

C_max=max(val_t=0,val_t=1,val_t=−M/(2L))  (17)

Finally, if ΔA is set to a threshold T (5 pixels, for example), then the following expression will be gotten:

$\begin{array}{cc}\Delta t=\sqrt[3]{\frac{T}{C_{\max }}}& \left(18\right)\end{array}$

If the curve segment is part of the elliptical curve, which is centered at the original point of the coordinate system, and has no rotation relative to X coordinate axis, then there exist the following equations:

$\begin{array}{cc}\begin{array}{c}A={\int }_t^{t+\Delta t}y\left(t\right)x\left(t\right)\\ ={\int }_t^{t+\Delta t}\left(\mathrm{rv}\sin t\right)\left(-\mathrm{rh}\sin t\right)t\\ =\frac{\mathrm{rh}·\mathrm{rv}}{2}\left(\begin{array}{c}\sin (t+\Delta t)\cos (t+\Delta t)-\\ \sin t\cos t-\Delta t\end{array}\right)\end{array}& \left(19\right)\\ \mathrm{and}& \\ \begin{array}{c}{A}_a=\frac{\left(y\left(t\right)+y(t+\Delta t)\right)·\left(x(t+\Delta t)-x\left(t\right)\right)}{2}\\ =\frac{\left(\mathrm{rv}\sin t+\mathrm{rv}\sin (t+\Delta t)\right)·\left(\mathrm{rh}\cos (t+\Delta t)-\mathrm{rh}\cos t\right)}{2}\\ =\frac{\mathrm{rh}·\mathrm{rv}}{2}\left(\begin{array}{c}\sin t\cos (t+\Delta t)-\sin t\cos t+\\ \sin (t+\Delta t)\cos (t+\Delta t)-\sin (t+\Delta t)\cos t\end{array}\right)\end{array}& \left(20\right)\\ \mathrm{Then}& \\ \begin{array}{c}\Delta A=A-A_a\\ =\frac{\mathrm{rh}·\mathrm{rv}}{2}\left(\sin \Delta t-\Delta t\right)\end{array}& \left(21\right)\end{array}$

The absolute value of ΔA is

$\begin{array}{cc}\begin{array}{c}\Delta A=\frac{\mathrm{rh}·\mathrm{rv}}{2}\left(\Delta t-\sin \Delta t\right)\\ =\frac{\mathrm{rh}·\mathrm{rv}}{2}\left(\Delta t-\left(\Delta t-\frac{\Delta t^3}{3!}+\frac{\Delta t^5}{5!}+\dots \right)\right)\\ \approx \frac{\mathrm{rh}·\mathrm{rv}}{2}\frac{\Delta t^3}{3!}\\ =\frac{\mathrm{rh}·\mathrm{rv}}{12}\Delta t^3\\ =E·\Delta t^3\end{array}& \left(22\right)\end{array}$

Finally, if ΔA is set to a threshold T, (5 pixels, for example), then

$\begin{array}{cc}\Delta t=\sqrt[3]{\frac{T}{E}}& \left(23\right)\end{array}$

After the subdividing step Δt is obtained, the number of the subdividing points can be obtained by the following expression:

n=int(1/Δt)+1  (24)

As the elliptical curve can be obtained by affine transforming a unit circle curve, coordinate information of the subdividing points can be calculated on the unit circle curve. As the number n of the subdividing points has already been obtained and the angle of the circular arc on the unit circle curve corresponding to the elliptical curve is θ₁−θ₀ all, the angle difference between two adjacent subdividing points on the circular arc of the unit circle is (θ₁−θ₀)/n . From θ₀ to θ₁, the coordinates of each subdividing point on the circular arc are calculated according to x=cos θ and y=sin θ. Herein, the number of subdividing points on the circular arc of the unit circle is the same as that of the elliptical curve.

FIG. 3 illustrates a conceptual schematic diagram of forward differencing for approximating a Bezier curve. For any point P_t+Δt on the curve, the coordinate values can be calculated from the coordinate values of the previous point P_t, given the curve length difference ΔP_t, as follows:

P_t+Δt=P_t+ΔP_t  (25)

If P_t+Δt is treated as parameter equations, then

x(t+Δt)=x(t)+Δx(t)

y(t+Δt)=y(t)+Δy(t)  (26)

If the curve is a quadratic Bezier curve, then

Δx(t)=2(X₁−X₀)Δt·t+(X₁−X₀)Δ²t+2X₀Δt

Δy(t)=2(Y₁−Y₀)Δt·t+(Y₁−Y₀)Δ²t+2Y₀Δt  (27)

where X₀=x₁−x₀, Y₀=y₁−y₀, X₁=x₂−x₁, and Y₁=y₂−y₁.

Similarly,

Δx(t+Δt)=Δx(t)+Δ²x(t)

Δy(t+Δt)=Δy(t)+Δ²y(t)  (28)

So,

Δ²x(t)=Δ(Δx(t))=2(X₁−X₀)Δ²t

Δ²y(t)=Δ(Δy(t))=2(Y₁−Y₀)Δ²t  (29)

If the curve is defined in iterative terms x_n+1=x_n+Δx_n, Δx_n=Δx_n−1+Δ²x_n−1, and y_n+1=y_n+Δy_n, y_n+1=y_n+Δy_n, then x_n+1 and y_n+1 can be obtained in an iterative way.

The coordinate values of the first subdividing point, Δx and Δy between the second and first subdividing points can be obtained by substituting the value of t on the first subdividing point into the expressions (1) and (27) respectively. Herein, the value of t can be, for example, 0.

If the curve is a cubic Bezier curve, then

Δx(t)=3A_xΔt·t²+3(A_xΔ²t+2B_xΔt)t+(A_xΔ³t+3B_xΔ²t+3C_xΔt)

Δy(t)=3A_yΔt·t²+3(A_yΔ²t+2B_yΔt)t+(A_yΔ³t+3B_yΔ²t+3C_yΔt)  (30)

where A_x=(X₂−X₁)−(X₁−X₀), B_x=(X₁−X₀), C_x=X₀, X₂=x₃−x₂, A_y=(Y₂−Y₁)−(Y₁−Y₀), B_y=(Y₁−Y₀), C_y=Y₀ and Y₂=y₃−y₂.

Likewise,

Δ²x(t)=Δ(Δx(t))=6A_xΔ²t·t+6A_xΔ³t+6B_xΔ²t

Δ²y(t)=Δ(Δy(t))=6A_yΔ²t·t+6A_yΔ³t+6B_yΔ²t  (31)

and

Δ³x(t)=Δ(Δ²x(t))=6A_xΔ³t

Δ³y(t)=Δ(Δ²y(t))=6A_yΔ³t  (32)

If the curve is defined in iterative terms x_n+1=x_n+Δx_n, Δx_n=Δx_n−1+Δ²x_n−1, Δ²x_n−1=Δ²x_n−2+Δ³x_n−2, and y_n+1=y_n+Δy_n, y_n+1=y_n+Δy_n, Δ²y_n−1=Δ²y_n−2+Δ³y_n−2, then x_n+1 and y_n+1 can be calculated in an iterative way. Likewise, the coordinate values of the first subdividing point, Δx and Δy between the second and first subdividing points, and Δ²x and Δ²y between the second and first subdividing points can be obtained by substituting the value of t on the first subdividing point into the expressions (3), (30) and (31) respectively. Herein, the value of t on the first subdividing point can be, for example, 0.

FIG. 4 illustrates a schematic diagram of the procedure for affine transforming a unit circle, with translation, rotation and scaling, to acquire an ellipse. The unit circle curve can be defined as (x(θ),y(θ),1)^T=(cos θ,sin θ,1)^T, and the ellipse curve can be obtained by first subdividing the unit circle into points and then affine transforming the subdividing points. According to the coordinates (cos θ, sin θ,1)^T of the subdividing points on the unit circle arc and the equation (5), the coordinates (x, y,1)^T of an ellipse curve after affine transformation can be obtained through the following specific calculating formulas:

x=rh·cos(rot)·cos θ−rv·sin(rot)·sin θ+x_c

y=rh·sin(rot)·cos θ+rv·cos(rot)·sin θ+x_c  (33)

FIG. 5 illustrates a block diagram of a graphic-display control apparatus according to an embodiment of the invention. As shown in FIG. 5, the graphic-display control apparatus comprises a subdivision module (corresponding to the number acquiring unit) 502, a coordinate calculation module (corresponding to the coordinate acquiring unit) 504, and a rendering module (corresponding to the curve rendering unit) 506. A curve and rendering parameters are acquired by the graphic-display control apparatus from outside, and the curve is represented by its control points. Firstly, the subdivision module acquires number information of subdividing points for subdividing a curve by using coordinate information of control points of the curve. Secondly, the coordinate calculation module acquires the coordinate information of each subdividing point according to the number information of the subdividing points and the coordinate information of the control points, by using the method of forward difference when the curve is a Bezier curve or the method of affine transformation when the curve is an ellipse curve. Finally the rendering module connects the subdividing points by straight lines according to the coordinate information of each subdividing point and renders the straight lines connecting respective subdividing points by using the rendering parameters.

FIG. 6 illustrates a detailed block diagram of a subdivision module shown in FIG. 5. As shown in FIG. 6, the subdividing module calculates coefficients Q, C_max and E in a curve function according to the coordinate information of the control points of the curve input from outside, acquires the relationship between an area difference and a subdividing step based on the curve function, the area difference being the difference between the area of a curve segment corresponding to the subdividing step on the curve with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis, calculates the subdividing step Δt according to the acquired relationship and a threshold input from outside, and calculates the number n of the subdividing points by using the subdividing step Δt.

FIG. 7 illustrates a detailed block diagram of a coordinate calculation module shown in FIG. 5. As shown in FIG. 7, the coordinate calculation module calculates the parameter difference Δt according to the number of the subdividing points, and calculates the coordinate information of the first subdividing point according to coordinate information of the control points. Then it calculates a curve difference ΔP between adjacent subdividing points for the Bezier curve, and calculates affine transformation coefficients for the ellipse curve. By using the difference value ΔP between adjacent subdividing points, it calculates the coordinate values of the subdividing points of the Bezier curve. By using the affine transformation coefficients, it affine transforms the subdividing points on the unit circle to the subdividing points on the ellipse curve. Finally, the coordinate values of each subdividing point are stored in an external memory for the rendering module.

To sum up, the invention acquires the number information of subdividing points for subdividing a curve by using coordinate information of control points of the curve, and then acquires coordinate information of the subdividing points according to the number information of the subdividing points and the coordinate information of the control points, thereby achieving high efficient curve approximation and further high efficient graphic-display control.

What needs to be noted is that respect modules and/or units shown in FIG. 5 can be implemented by using pre-programmed firmware or hardware component (for example ASIC) or by using data processing devices including EEPROM or other components.

Those skilled in the art will understand that there exist more optional embodiments and modifications for implementing the embodiments of this invention, and the above-mentioned embodiments and examples are only descriptions of one or more embodiments. Therefore, the scope of this invention is restricted only by the claims attached.

Claims

1. A method for approximating a curve, comprising the steps of:

acquiring number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve;

acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and

connecting the subdividing points with straight lines based on the coordinate information of the subdividing points.

2. The method for approximating a curve of claim 1, characterized in that the process of acquiring the number information of the subdividing points comprises the sub-steps of:

acquiring a curve function of the curve based on the coordinate information of the control points;

acquiring a relationship between an area difference and a subdividing step based on the curve function, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step on the curve with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis;

acquiring a subdividing step corresponding to a set area difference based on the relationship between the area difference and the subdividing step; and

acquiring the number information of the subdividing points using the subdividing step corresponding to the set area difference.

3. The method for approximating a curve of claim 1, characterized in that when the curve is a Bezier curve, the coordinate information of the subdividing points is acquired by forward differencing.

4. The method for approximating a curve of claim 1, characterized in that when the curve is an elliptic curve, the coordinate information of the subdividing points is acquired by affine transforming.

5. An apparatus for approximating a curve, comprising:

a number acquiring unit configured to acquire number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve;

a coordinate acquiring unit configured to acquire coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and

a curve approximating unit configured to connect the subdividing points with straight lines based on the coordinate information of the subdividing points.

6. The apparatus for approximating a curve of claim 5, characterized in that the number acquiring unit comprises:

a curve function acquiring unit configured to acquire a curve function of the curve based on the coordinate information of the control points;

a mutual relationship acquiring unit configured to acquire a relationship between an area difference and a subdividing step based on the curve function, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step on the curve with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis;

a subdividing step acquiring unit configured to acquire a subdividing step corresponding to a set area difference based on the relationship between the area difference and the subdividing step; and

a number information acquiring unit configured to acquire the number information of the subdividing points using the subdividing step corresponding to the set area difference.

7. The apparatus for approximating a curve of claim 5, characterized in that in the case that the curve is a Bezier curve, the coordinate acquiring unit acquires the coordinate information of the subdividing points by forward differencing.

8. The apparatus for approximating a curve of claim 5, characterized in that in the case that the curve is an elliptic curve, the coordinate acquiring unit acquires the coordinate information of the subdividing points by affine transforming.

9. A graphic display control method, comprising the steps of:

acquiring number information of subdividing points for subdividing a curve needed to be rendered based on coordinate information of control points of the curve;

acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and

connecting the subdividing points with straight lines based on the coordinate information of the subdividing points and drawing the straight lines connecting the subdividing points according to rendering parameters.

10. The graphic display control method of claim 9, characterized in that the process of acquiring the number information of the subdividing points comprises the sub-steps of:

acquiring a curve function of the curve based on the coordinate information of the control points;

acquiring a relationship between an area difference and a subdividing step based on the curve function, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step on the curve with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis;

acquiring a subdividing step corresponding to a set area difference based on the relationship between the area difference and the subdividing step; and

acquiring the number information of the subdividing points using the subdividing step corresponding to the set area difference.

11. A graphic display control apparatus comprising:

a number acquiring unit configured to acquire number information of subdividing points for subdividing a curve needed to be rendered based on coordinate information of control points of the curve;

a coordinate acquiring unit configured to acquire coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points; and

a curve rendering unit configured to connect the subdividing points with straight lines based on the coordinate information of the subdividing points and draw the straight lines connecting the subdividing points according to rendering parameters.

12. The graphic display control apparatus of claim 11, characterized in that the number acquiring unit comprises:

a curve function acquiring unit configured to acquire a curve function of the curve based on the coordinate information of the control points;

a mutual relationship acquiring unit configured to acquire a relationship between an area difference and a subdividing step based on the curve function, wherein the area difference is the difference between the area of a curve segment corresponding to the subdividing step on the curve with respect to X coordinate axis and the area of a line segment of two points corresponding to the subdividing step on the curve with respect to X coordinate axis;

a subdividing step acquiring unit configured to acquire a subdividing step corresponding to a set area difference based on the relationship between the area difference and the subdividing step; and

a number information acquiring unit configured to acquire the number information of the subdividing points using the subdividing step corresponding to the set area difference.