CN110599568B

CN110599568B - Line generation method, device, equipment and storage medium

Info

Publication number: CN110599568B
Application number: CN201910865670.2A
Authority: CN
Inventors: 余冬
Original assignee: Guangzhou Shiyuan Electronics Thecnology Co Ltd; Guangzhou Shirui Electronics Co Ltd
Current assignee: Guangzhou Shiyuan Electronics Thecnology Co Ltd; Guangzhou Shirui Electronics Co Ltd
Priority date: 2019-09-12
Filing date: 2019-09-12
Publication date: 2023-06-06
Anticipated expiration: 2039-09-12
Also published as: CN110599568A

Abstract

The invention discloses a line generation method, a line generation device, line generation equipment and a storage medium. The method comprises the following steps: displaying an application interface; receiving a drawing operation acting on an application interface; displaying an original point in the application interface according to the drawing operation; sorting the original points, and taking the sorted original points as target points; fitting candidate points between every two target points, wherein the candidate points accord with the convexity of the curves passing through all the target points; generating a line passing through the target point and the candidate point; a line is displayed in the application interface. According to the method, candidate data points are continuously inserted among given original data points, the Bezier curve is generated according to adjacent coordinate points, when the data points are rare or unevenly distributed, a smooth curve can be generated due to the inserted candidate data points, sharp inflection points cannot occur, the curve can pass through all given points, and the real trend of all given data points can be represented.

Description

Line generation method, device, equipment and storage medium

Technical Field

The embodiment of the invention relates to an image display technology, in particular to a line generation method, device, equipment and storage medium.

Background

With the popularization of intelligent devices such as computers and paperless offices, more and more work needs to be carried out by means of electronic devices. Because of the powerful data processing capability of computers, the use of computers to directly generate charts from large amounts of data has become a mainstream trend, essentially replacing the operations of drawing again by manual statistics.

The existing curve expression modes include a line graph, a ladder diagram, a quadratic Bezier curve and a Cardina1 curve. The disadvantage of both the line and step graphs is that there is no slope and the trend and rate of change of the data points presented are not well represented. The common quadratic Bezier curve algorithm takes the first given data as a starting point, the last given data amount as an end point, and the data points between the starting point and the end point as control points, so that the generated quadratic Bezier curve passes through the starting point and the end point, but does not pass through the control points between the starting point and the end point, and the control points influence the direction of the generated curve. The secondary Bezier curve has the advantages of being capable of expressing the change trend of a given data point and attractive, but has the disadvantage that the generated curve cannot accurately pass through a specific given data point and cannot express an accurate data point.

When the front trend graph is plotted, if the distribution of the given data points is uneven, the resulting corresponding graph is prone to sharp inflection points or to curve in an undesirable direction. In more serious cases, the overall curve may not be perfectly smooth. At the junction of the two curves, there may be two non-coincident tangents.

Disclosure of Invention

The invention provides a line generation method, device, equipment and storage medium, which are used for solving the problem that a line generated according to an original point has a sharp inflection point or is bent in an unexpected direction.

In a first aspect, an embodiment of the present invention provides a method for generating a line, including:

displaying an application interface;

receiving a drawing operation acting on the application interface;

displaying an original point in the application interface according to the drawing operation;

sorting the original points, and taking the sorted original points as target points;

fitting candidate points between every two target points, wherein the candidate points accord with the concave-convex performance of curves passing through all the target points;

generating a line passing through the target point and the candidate point;

and displaying the line in the application interface.

On this basis, the display application interface comprises:

generating an application interface;

displaying a coordinate system in the application interface, wherein the coordinate system is provided with an original point and/or a candidate point and a line passing through the original point and/or the candidate point.

On the basis, the drawing operation comprises a generating operation, a dragging operation and a deleting operation;

the displaying the original point in the application interface according to the drawing operation includes:

determining a first position in the application interface where the generating operation is received;

setting the candidate point as an original point when the first position coincides with the candidate point;

when the first position is not coincident with the candidate point, setting the candidate point nearest to the first position as an original point;

or,

determining an original point acted by the dragging operation in the application interface;

determining a second position of the end of the dragging operation in the application interface;

transferring the origin point to the second location;

or,

determining an original point acted by the deleting operation in the application interface;

and deleting the original point.

On the basis, the processing for sorting the original points takes the sorted original points as target points, and comprises the following steps:

Determining the abscissa of the origin;

and sequencing the original points according to the abscissa to obtain target points.

On the basis, the fitting of the candidate points between every two target points comprises the following steps:

determining the convexity between the target points;

and adding candidate points conforming to the convexity between every two target points.

On this basis, the concavity and convexity are expressed as a second derivative;

the fitting of the candidate points between every two target points comprises the following steps:

constructing a first polynomial, wherein the first polynomial has a first coefficient, a second coefficient, a third coefficient and a fourth coefficient, the first coefficient is the coordinate of a first target point, the second coefficient is the coordinate of a second target point, the third coefficient is a second derivative corresponding to the first target point, the fourth coefficient is a second derivative corresponding to the second target point, and the first target point and the second target point are adjacent target points;

constructing a second polynomial, wherein the second polynomial represents a broken line passing through the coordinates of the first target point and the coordinates of the second target point;

if the first polynomial approximates to the second polynomial, constructing a third polynomial by the first polynomial and the second polynomial;

Candidate points are added between the first target point and the second target point based on the third polynomial.

constructing a fourth polynomial, wherein the fourth polynomial has a fifth coefficient, a sixth coefficient, a seventh coefficient and an eighth coefficient, the fifth coefficient is the coordinate of a first test point, the sixth coefficient is the coordinate of a second test point, the seventh coefficient is a second derivative corresponding to the first test point, the eighth coefficient is a second derivative corresponding to the second test point, if the first test point is the target point, the second test point is a candidate point adjacent to the target point, and if the first test point is the candidate point, the second test point is other candidate points or target points adjacent to the candidate point;

constructing a fifth polynomial, wherein the fifth polynomial represents a broken line passing through the coordinates of the first check point and the coordinates of the second check point;

if the fourth polynomial approximates to the fifth polynomial, constructing a sixth polynomial by the fourth polynomial and the fifth polynomial;

Candidate points are added between the first and second checkpoints based on the sixth polynomial.

On the basis, if the first polynomial and the second polynomial approach, constructing a third polynomial by the first polynomial and the second polynomial, including:

determining a first longitudinal axis distance on a longitudinal axis between the first polynomial and coordinates of the first target point;

determining a second longitudinal axis distance on the longitudinal axis between the coordinates of the first polynomial and the second target point;

calculating a ratio between a vertical axis distance difference and a horizontal axis distance difference, wherein the vertical axis distance difference is a difference value between the second vertical axis distance and the first vertical axis distance, and the horizontal axis distance difference is a distance between coordinates of the second target point and coordinates of the first target point on a horizontal axis;

subtracting the first vertical axis distance from the abscissa of the ninth coefficient and the first target point to obtain a tenth coefficient;

when the ninth coefficient is zero, constructing a third polynomial based on the ninth coefficient and the tenth coefficient;

when the tenth coefficient is zero, a third polynomial is constructed based on the tenth coefficient.

In a second aspect, an embodiment of the present invention further provides a line generating device, which is characterized in that the device includes:

the interface display module is used for displaying an application interface;

the operation receiving module is used for receiving drawing operation acted on the application interface;

the original point display module is used for displaying an original point in the application interface according to the drawing operation;

the target point acquisition module is used for carrying out sorting on the original points and taking the sorted original points as target points;

a candidate point fitting module, configured to fit a candidate point between each two target points, where the candidate point conforms to the concave-convex property of a curve passing through all the target points;

the line generation module is used for generating a line passing through the target point and the candidate point;

and the line display module is used for displaying the line in the application interface.

In a third aspect, an embodiment of the present invention further provides an electronic device, including:

one or more processors;

a memory for storing one or more programs;

the one or more programs, when executed by the one or more processors, cause the one or more processors to implement a method of generating a line as described in the first aspect.

In a fourth aspect, an embodiment of the present invention further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements a method for generating a line according to the first aspect.

The embodiment of the invention displays the application interface; receiving a drawing operation; displaying an original point in the application interface according to the drawing operation; sorting the original points to obtain target points; fitting candidate points between every two target points, wherein the candidate points accord with trends among the target points; generating a line passing through the target point and the candidate point; a line is displayed in the application interface. According to the method, candidate data points are continuously inserted among given original data points, the Bezier curve is generated according to adjacent coordinate points, when the data points are rare or unevenly distributed, a smooth curve can be generated due to the inserted candidate data points, sharp inflection points cannot occur, the curve can pass through all given points, and the real trend of all given data points can be reflected.

Drawings

Fig. 1A is a flowchart of a method for generating a line according to a first embodiment of the present invention;

FIG. 1B is a schematic diagram of a target point according to a first embodiment of the present invention;

FIG. 1C is a schematic diagram of an addition candidate point according to a first embodiment of the present invention;

fig. 2A is a flowchart of a method for generating a line according to a second embodiment of the present invention;

FIG. 2B is a schematic diagram of a display coordinate system according to a second embodiment of the present invention;

FIG. 2C is a schematic diagram of a display coordinate system according to a second embodiment of the present invention;

FIG. 2D is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention;

FIG. 2E is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention;

FIG. 2F is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention;

FIG. 2G is a schematic diagram of adding candidate points to an original point according to a second embodiment of the present invention;

fig. 3 is a block diagram of a line generating device according to a third embodiment of the present invention;

fig. 4 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.

Detailed Description

The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.

Example 1

Fig. 1A is a flowchart of a line generating method according to an embodiment of the present invention. The method and the device are suitable for receiving the original points generated by a user through drawing operation, fitting the candidate points between the original points, and finally generating a scene of the line passing through the target point and the candidate points. The method may be performed by a line generating device, which may be implemented in software and/or hardware. The line in this embodiment refers to a straight line or a curved line that passes through at least two original points. Referring to fig. 1A, the method includes:

s101, displaying an application interface.

The application interface is an interface for interaction with a user, and the application interface can be displayed through a display device of a computer component, can be displayed through a display device of an integrated tablet device, and can also be displayed through a small mobile electronic device such as a mobile phone, a tablet and the like.

In one possible implementation, an application interface is displayed, which is a blank interface. Possibly, the starting point and the ending point, and a line segment connecting the starting point and the ending point may also be displayed in the application interface according to a starting point and an ending point preset by a user or the device. Possibly, a plurality of origin points and a curve passing through the origin points may also be included in the application interface.

S102, receiving drawing operation acted on the application interface.

The drawing operation is an operation performed by the user on the application interface, and may be adding an original point, deleting the original point, changing the position of the original point, and the like.

In one possible implementation, the user increases the origin by a drawing operation. Such as by adding an original point by double clicking in the application interface or by adding an original point by filling in coordinates in the application interface.

In one possible implementation, the user deletes the origin through a drawing operation. E.g. by the user deleting the original point in the application interface.

In one possible implementation, the user changes the position of the origin point by a drawing operation. Such as a user can change the position of an origin point by selecting the origin point and dragging it. If the user can move the original to the final coordinates by selecting an original point and inputting the final coordinates of the original point.

S103, displaying an original point in the application interface according to the drawing operation.

After the drawing operation is received, the original point is displayed in the application interface according to the content displayed by the application interface and the specific content of the drawing operation.

In a possible implementation manner, the application interface is a blank interface, and at this time, according to the drawing operation, the added original point is displayed in the application interface.

In a possible implementation, a plurality of original points and a curve passing through the plurality of original points are included in the application interface, and then one or more original points are deleted, one or more original points are added, or the positions of one or more original points are changed according to the drawing operation.

S104, sorting the original points, and taking the sorted original points as target points.

The original point is a point with a coordinate system, and the original point is sequenced according to a certain mode to obtain a sequenced target point.

In a possible implementation, the manner of sorting the original points may be time sequence, that is, determining the original points through which the curve passes successively according to the time when the original points are added by the user. The original points may be sorted in a position order, or may be sorted from small to large on the abscissa of the original points, or may be sorted from small to large on the ordinate of the original points.

And S105, fitting candidate points between every two target points, wherein the candidate points conform to the concave-convex performance of the curves passing through all the target points.

The candidate points are points added in the middle of every two target points to describe the trend between the target points.

In a possible implementation, fig. 1B is a schematic diagram of a target point according to a first embodiment of the present invention. In fig. 1B, point A1 (0, 0), point A2 (65, 389), point A3 (125, 1380), point A4 (190, 2496), and point A5 (256, 3000) are all original points. By the line segment connecting the original points, it can be seen that the original points in fig. 1B can be formed by a concave curve (two line segments formed by points A1, A2, and A3) and a convex curve (two line segments formed by points A3, A4, and A5). Fig. 1C is a schematic diagram of an addition candidate point according to a first embodiment of the present invention. If the candidate point B1 is added between the points A1 and A2, the candidate point B2 is added between the points A2 and A3, the candidate point B3 is added between the points A3 and A4, and the candidate point B4 is added between the points A4 and A5. The candidate points B1, B2 follow the trend of the concave curve between the target points A1, A2, A3, and the candidate points B3, B4 follow the trend of the convex curve between the target points A3, A4, A5.

S106, generating a line passing through the target point and the candidate point.

When the distance between the target point and the candidate point is small enough, the adjacent target point and the candidate point can be connected through the line segment, so that a smooth curve can be generated. Of course, the calculation force of the computer can be saved by directly adopting a line segment mode, but when the line is enlarged to a certain degree, the problem of saw tooth shape can occur. In this case, the problem of jaggy can be solved by generating a bezier curve between adjacent points.

In one possible implementation, among the given data points, two adjacent data points are taken in sequence: determining two control points between the two data points; and respectively taking the two data points as a starting point and an ending point, and generating a Bezier curve between the two data points according to the two control points. In this embodiment, the two extracted adjacent data points are used as a starting point and an ending point respectively, and based on the two control points, a bezier curve of the two extracted adjacent data points is generated, and because two control points are determined between every two adjacent data points, the generated bezier curve is a cubic bezier curve, which is smoother than a quadratic bezier curve, and when the data points are rare or unevenly distributed, a smooth curve can be generated, no sharp inflection point appears, and the curve can pass through all the given points, so that the true trend of all the given data points can be reflected.

And S107, displaying the line in the application interface.

When the computer component generates a line passing through the target point and the candidate point, the line is rendered to an application interface so as to display the line.

In a possible implementation, to respond to the operation performed by the user on the original point in time, the lines in the application interface may be refreshed at a certain time interval.

The embodiment of the invention displays the application interface; receiving a drawing operation; displaying an original point in the application interface according to the drawing operation; sorting the original points to obtain target points; fitting candidate points between every two target points, wherein the candidate points accord with trends among the target points; generating a line passing through the target point and the candidate point; a line is displayed in the application interface. According to the method, candidate data points are continuously inserted among given original data points, the Bezier curve is generated according to adjacent coordinate points, when the data points are rare or unevenly distributed, a smooth curve can be generated due to the inserted candidate data points, sharp inflection points cannot occur, the curve can pass through all given points, and the real trend of all given data points can be represented.

Example two

Fig. 2A is a flowchart of a method for generating a line according to a second embodiment of the present invention. This embodiment is a refinement made on the basis of embodiment one, describing the detailed step of fitting the candidate points in between each two of the target points. Referring to fig. 2A, the method includes:

S201, generating an application interface.

In one possible implementation, an application interface is generated in a display device in response to a user operation. The application having the application interface is an application having a line generation function.

The application may be integrated in a mobile device, the application interface being provided by the mobile device in which the application program is installed. Of course, the application may also be integrated on an immovable display screen. In particular, the application may be provided by an interactive tablet. An application interface is generated in the display device when a user opens the interactive tablet or activates an application in the interactive tablet.

S202, displaying a coordinate system in the application interface.

The coordinate system has an origin and/or a candidate point and a line passing through the origin and/or the candidate point.

In one possible implementation, a coordinate system is displayed in the application interface. In which there is an origin and a line passing through the origin. When there are only two original points in the application interface, a straight line passing through the two original points is generated. Fig. 2B is a schematic diagram of a display coordinate system according to a second embodiment of the present invention, which includes an origin A1 (0, 0), an origin A5 (256, 3000), and a straight line passing through the origins A1, A5.

In one possible implementation, when there are three or more origin points in the application interface, a line is generated that passes through the three or more origin points. When the original point is not on a straight line, the line passing through the original point is a curve. To generate a line of the curve, it is necessary to add candidate points conforming to the trend of the original points in the original points. At this time, the generated curve passes through the original point and the candidate point. Fig. 2C is a schematic diagram of a display coordinate system according to a second embodiment of the present invention, which includes a point A1 (0, 0), a point A2 (65, 389), a point A3 (125, 1380), a point A4 (190, 2496) and a point A5 (256, 3000), and candidate points conforming to the convexity of the original point, and curves passing through all the original points and the candidate points.

S203, receiving drawing operation acted on the application interface.

And receiving a drawing operation of a user, wherein the drawing operation comprises a generating operation, a dragging operation, a deleting operation and the like. The generating operation is an operation of generating an original point, the dragging operation is an operation of dragging an original point to a new position, and the deleting operation is an operation of deleting an original point.

S204, displaying an original point in the application interface according to the drawing operation.

In one possible implementation, the drawing operation is a generating operation. Fig. 2D is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention. Fig. 2C is displayed in the application interface in which the first location (points A6 and A7 in fig. 2D) where the generating operation is received is determined. If the distance between the first position and the line does not meet the threshold (set by the person skilled in the art), the declaration operation cannot be realized; and triggering the generation operation when the distance between the first position and the line meets the threshold value. When the first position coincides with the candidate point on the line, the candidate point is set as the original point. When the first position does not coincide with the candidate point, the candidate point closest to the first position is set as the original point. Wherein the candidate points are data points fitted for representing the concavity and convexity between the original points, and thus the candidate points cannot be directly manipulated, and the manipulation of the candidate points requires first modifying the properties thereof to the original points.

In one possible implementation, the drawing operation is a drag operation. Fig. 2E is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention. The drag operation is directed to an original point, and if a candidate point is to be dragged, the candidate point is first determined as the original point through the add operation. Determining an original point (A3) acted by the dragging operation in the application interface, after determining the original point, performing the dragging operation on the original point in the application interface, and determining a second position at which the dragging operation is finished; the original point is transferred to a second location.

In some techniques, after determining the origin of the drag operation, only the curve associated with the origin of the drag operation is adjusted. If an original point is directly dragged, the curves at the left end and the right end of the original data point are adjusted, and other curves are not changed; if one candidate point is dragged after being modified to the original point, the curve between the two original data points closest to the candidate point is adjusted, and other curves are not changed. In some techniques, the entire line is not smooth because only part of the curve is changed and other curve segments are not changed. In this embodiment, candidate data points are regenerated according to the original points, and then the curve is regenerated, so as to ensure the smoothness of the curve.

In one possible implementation, the drawing operation is a delete operation. The object of the deleting operation is also an original point, and the original point acted by the deleting operation is determined in the application interface; the original point is then deleted. Fig. 2F is a schematic diagram showing an original point in an application interface according to a second embodiment of the present invention. Compared to fig. 2C, the original point A2 is deleted.

S205, determining the abscissa of the original point.

In a possible implementation, a plurality of origin points such as A, B, C, D … are given in order, and coordinates are (x 1, y 1), (x 2, y 2), (x 3, y 3), (x 4, y 4) …, (xn, yn) in order.

S206, sorting the original points according to the abscissa so as to obtain target points.

In one possible implementation, the X-axis coordinate values of each data point are sequentially incremented by X1< X2< X3< X4< … < xn, and two adjacent data points are sequentially taken as a and B, B and C, and C and D …. The ordered data points are determined as target points.

In one possible implementation, the original points are ordered and the target points are retrieved as the data points (both the original and candidate points are referred to as data points) are plotted. The coordinates of the original point A, B, C, D are (x 1, y 1), (x 2, y 2), (x 3, y 3), (x 4, y 4) in this order, and A, B, C, D is the target point when x1< x2< x3< x 4. The user now performs a drag operation on data point B (x 2, y 2) such that x1< x3< x2< x4, then A, C, B, D is sequentially taken as the target point.

S207, determining the concave-convex performance between the target points.

Convexity is an important property describing the direction of curvature of a functional image. The second derivative reflects the rate of change of the slope and appears as a convexity of the function on the image of the function.

In a possible implementation, any two points are taken on the image of the function, and if the portion of the image of the function between the two points is always below the line segment connecting the two points, then the function is a concave function. The convex function is the image that projects upward. For example, if the function is second-order-derivative over interval I, then the constraint that the function is a concave function over interval I is f' (x) 0; the filling condition for the function to be a convex function over interval I is f "(x) <0. A function derives a first derivative (e.g. greater than 0) that only accounts for increasing, but not knowing whether increasing is faster or slower (the idea of acceleration can be analogized), and the increasing speed, i.e. convexity, is known by the second derivative.

In a possible implementation, the original points are first ordered according to the abscissa to determine the target points, and then the second derivatives between the target points are acquired and recorded as the second derivative list F (n). The second derivative list F (n) may be obtained by:

1. a first derivative list of the target points is obtained, denoted D (n).

The description will be given taking the original points as point A1 (0, 0), point A2 (65, 389), point A3 (125, 1380), point A4 (190, 2496) and point A5 (256, 3000) as examples. It is known that the first derivative D0 is 0.0 and that a three-diagonal algorithm is used to decompose the set of cyclic data points. The last derivative D [ n-1] is 0.0.

Wherein the data point set is a group of 3 Points, such as Points [ i-1], points [ i ], points [ i+1], and the sequence numbers are incremented from 1. The difference X1 between the abscissa of the Points [ i ] and the abscissa of the Points [ i-1], the difference X2 between the abscissa of the Points [ i+1] and the abscissa of the Points [ i ], X1/X2 obtain the ratio a% of the Points [ i ] in the horizontal direction in the group, and the product obtained by multiplying the ratio in the horizontal direction by the first derivative D [ i-1] is added with an offset 2 to obtain the derivative entropy. Subtracting the horizontal direction duty ratio (i.e. the duty ratio of the horizontal distance of Points [ i ] -Points [ i+1] on Points [ i-1] -Points [ i+1 ]) to obtain the ith first derivative DIj.

2. A list E of first order polarization derivatives (n-1) is obtained.

The description will be given taking the original points as point A1 (0, 0), point A2 (65, 389), point A3 (125, 1380), point A4 (190, 2496) and point A5 (256, 3000) as examples. It is known that the first polarization derivative E0 is 0.0 and that a three-diagonal algorithm is used to decompose the set of cyclic data points.

Wherein the data point set is composed of 3 Points as a group such as Points [ i-1], points [ i ], points [ i+1], and the sequence numbers are incremented from 1. The difference X1 between the abscissa of the Points [ i ] and the abscissa of the Points [ i-1], and the difference X2 between the abscissa of the Points [ i+1] and the abscissa of the Points [ i ], X1/X2 give the ratio a% of the Points [ i ] in the horizontal direction within the group. The product obtained by multiplying the horizontal direction duty ratio by the first derivative D [ i-1] is added with an offset 2 to obtain a derivative entropy. The slope S1 of Points [ i+1] and Points [ i ], the slope S2 of Points [ i ] and Points [ i-1], and the difference between S1 and S2, obtain the slope difference of two line segments. The difference in slope divided by the horizontal distance between Points i+1 and Points i-1 multiplied by the derivative polarization coefficient 6.0 is the polarization distance L1. Meanwhile, the polarization distance L2 is obtained by multiplying the last derivative polarization E (i-1) by the duty ratio a%. The difference between L1 and L2 is divided by the derivative entropy, to obtain the polarization derivative E (i).

3. From the first derivative list, a second derivative list F (n) is calculated using a system of tri-diagonal linear equations, in a round-robin fashion.

Wherein the first derivative list D (n) is reverse-cycled, wherein 2 groups of derivatives are used as a group such as Dn-2, dn-1, and Dn-2 is used for carrying out the reassignment of Dn-2. And n serial numbers decrease from small to large until 0, and repeating the step two.

And S208, fitting a candidate point between every two target points. The candidate points conform to the convexity of the curve passing through all the target points, it being understood that the candidate points conforming to the convexity are added in between each two of the target points.

Candidate points are added between the two original points according to the second derivative of the original points determined in step S207, and the number of candidate points added between the original points may be different. Fig. 2G is a schematic diagram of adding candidate points to an original point according to a second embodiment of the present invention, and it can be seen from fig. 2G that the higher the curvature of a line passing through the original point, the more candidate points need to be added. The data points are denser than the data points in box 22 as in box 21.

In one possible implementation, a polyline approximation polynomial is used to obtain a series of dense data point sets, and the data point sets are subjected to processing such as de-duplication to determine candidate points added between original points. The polyline approximation polynomial can be understood as: a polyline is formed by A, B two points, and two new ordinate are obtained through A, B abscissa of the two points according to polynomial calculation. A quadrangle is constructed from the abscissa and the ordinate of the two points of A, B, and the area of the quadrangle is calculated. If the area is greater than the preset difference, two new ordinate and polynomial analyses are used to obtain a list of intermediate point values until the "approximated difference" approaches the preset difference.

In a possible implementation, two adjacent target points (denoted as a and B) are selected, and the second derivatives corresponding to the two target points are sorted to obtain coefficients of the subinterval polynomial denoted as (a, B, c, d). And constructing a polynomial according to the coefficient of the subinterval polynomial. The difference polynomial between the polynomial and the straight line passing through the two target points is obtained by the polynomial, the abscissa of the point A and the abscissa of the point B. And according to the difference polynomial, the first derivative of the polynomial is obtained by arrangement, and then the polynomial root is analyzed and found. Checking the extreme value of the differential polynomial, and if the extreme value is reasonable, describing the approximation of the cubic polynomial. The approximated points are added to the set of data point points. The two adjacent data points are reselected if the analyzed approximated points have not reached the programmed accuracy. In this case, two adjacent data points may be one target point, one candidate point, or two candidate points.

In a possible implementation, a candidate point is added between two target points. Step S208 may include the following sub-steps:

s2081, constructing a first polynomial.

Two target Points are determined, and in order from the abscissa to the abscissa, as a first target point and a second target point, the first target point is designated as Points [ n-1], and the second target point is designated as Points [ n ]. And determining the coordinates of the first target point as the first coefficient, the coordinates of the second target point as the second coefficient, the second derivative corresponding to the first target point as the third coefficient, denoted as F n-1, and the second derivative corresponding to the second target point as the fourth coefficient, denoted as F n. Wherein coefficients of the subinterval polynomials A (a, b, c, d) are assigned as A (Points [ n-1], points [ n ], F [ n-1], F [ n ]), respectively, and polynomials are constructed based on A (Points [ n-1], points [ n ], F [ n-1], F [ n ]).

S2082, constructing a second polynomial.

The second polynomial describes a polyline. The broken line refers to a zigzag line formed by connecting a plurality of line segments end to end in turn, or a graph formed by connecting a plurality of points (called end points) which are not on a straight line in turn by line segments (at most two line segments are connected at each public end). When the starting point (first point) coincides with the ending point (last point), it is a closed polyline, i.e., a polygon. Sometimes, the image of the function is a polyline.

In one possible implementation, a second polynomial representing a polyline is constructed that passes through the first target point Points [ n-1] and the second target point Points [ n ].

S2083, if the first polynomial and the second polynomial approach, constructing a third polynomial by the first polynomial and the second polynomial.

By approximating the polynomial with the polyline, the difference polynomial between the polynomial and the straight line through its node, the third polynomial, is obtained and is denoted as the displacement.

In particular, a first longitudinal axis distance on the longitudinal axis between the first polynomial and the coordinates of the first target point may be determined, which may be understood as calculating the value y1 of the first polynomial to the point n-1 point abscissa x 1. Determining a second longitudinal axis distance on the longitudinal axis between the coordinates of the first polynomial and the second target point may be understood as calculating the value y2 of the first polynomial to the point n x 2. The ratio between the difference in the vertical axis distance and the difference in the horizontal axis distance is calculated as a ninth coefficient, that is, by (y 2-y 1)/(x 2-x 1), to obtain a new polynomial coefficient a (ninth coefficient). The longitudinal axis distance difference is the difference between the second longitudinal axis distance and the first longitudinal axis distance, and the transverse axis distance difference is the distance between the coordinates of the second target point and the coordinates of the first target point on the transverse axis; subtracting the ninth coefficient from the first vertical axis distance to obtain a tenth coefficient; a new polynomial coefficient b (tenth coefficient) is obtained by y1-a x 1.

When the ninth coefficient is zero, a third polynomial is constructed based on the ninth coefficient and the tenth coefficient. It can be understood that: if a= =0, the difference between the original Polynomial and the new Polynomial (new double [ ] { b, a } formed by a, b is returned.

When the tenth coefficient is zero, a third polynomial is constructed based on the tenth coefficient. It can be understood that: if b= =0, the difference between the original Polynomial and the new Polynomial (new double [ ] { b } formed by b alone is returned.

S2084, adding a candidate point between the first target point and the second target point based on the third polynomial.

In the difference polynomial, it is determined whether the four values are all 0. Wherein, the expression [0] - -expression [3] is a polynomial coefficient. If so, two data Points composed of the abscissa of the first target point Points [ n-1] and the second target point Points [ n ] and the third polynomial calculated values y1, y2, respectively, are directly returned. The two data points are taken as candidate points added between the first target point and the second target point.

If the approximation meets the tolerance, two points with a difference of 0 are also added. It is understood that the first derivative polynomial is obtained by the extraction [0] - -extraction [3]3 values. The first derivative root of this polynomial is found. The true root is found in the two abscissas x1, x 2. And checking the extreme value of the difference polynomial, and if the distance between the difference polynomial extraction and the root is smaller than or equal to a given tolerance, directly returning two points formed by two abscissa coordinates and polynomial calculated values y1 and y2 respectively.

In a possible implementation, when the candidate points need to be further added between the first target point and the closest candidate point after adding two candidate points between the two target points, step S208 may include the following sub-steps:

s2085, constructing a fourth polynomial.

Determining a first check point and a second check point, wherein if the first check point is a target point, the second check point is a candidate point adjacent to the target point; if the first inspection point is a candidate point, the second inspection point is another candidate point or target point adjacent to the candidate point. Similarly, the first checkpoint may be denoted as Points [ n-1], and the second checkpoint as Points [ n ]. And determining the coordinates of the first check point as a fifth coefficient and determining the coordinates of the second check point as a sixth coefficient. And determining the second derivative corresponding to the first test point as the seventh coefficient, denoted as F n-1, and determining the second derivative corresponding to the second test point as the eighth coefficient, denoted as F n. Wherein coefficients of the subinterval polynomials A (a, b, c, d) are assigned as A (Points [ n-1], points [ n ], F [ n-1], F [ n ]), respectively, and polynomials are constructed based on A (Points [ n-1], points [ n ], F [ n-1], F [ n ]).

S2086, constructing a fifth polynomial.

The fifth polynomial represents a polyline through the coordinates of the first checkpoint and the coordinates of the second checkpoint.

In one possible implementation, a fifth polynomial representing a polyline is constructed that passes through the first checkpoint Points [ n-1] and the second checkpoint Points [ n ].

S2087, if the fourth polynomial and the fifth polynomial approach, constructing a sixth polynomial by the fourth polynomial and the fifth polynomial.

Substantially the same as step S2083, the difference polynomial between the polynomial and the straight line passing through its node, namely the sixth polynomial, is obtained by approximating the polynomial with the polyline, denoted as expression

S2088 adding a candidate point between the first and second inspection points based on the sixth polynomial.

In the sixth polynomial, it is determined whether the four values are all 0 or not. If so, two data Points composed of the abscissa of the first target point Points [ n-1] and the second target point Points [ n ] and the third polynomial calculated values y1, y2, respectively, are directly returned. The two data points are taken as candidate points added between the first target point and the second target point. If the approximation meets the tolerance, two points with a difference of 0 are also added.

S209, generating a line passing through the target point and the candidate point.

And S210, displaying the line in the application interface.

Example III

Fig. 3 is a block diagram of a line generating device according to a third embodiment of the present invention. The device comprises: an interface display module 31, an operation receiving module 32, an original point display module 33, a target point acquisition module 34, a candidate point fitting module 35, a line generation module 36, and a line display module 37. Wherein:

an interface display module 31 for displaying an application interface;

an operation receiving module 32 for receiving a drawing operation acting on the application interface;

an origin display module 33, configured to display an origin in the application interface according to the drawing operation;

a target point acquisition module 34, configured to use the original points after sorting as target points;

a candidate point fitting module 35, configured to fit a candidate point between each two target points, where the candidate point conforms to the concave-convex property of the curve passing through all the target points;

a line generation module 36, configured to generate a line passing through the target point and the candidate point;

a line display module 37, configured to display the line in the application interface.

On the basis of the above embodiment, the interface display module 31 includes:

an application interface generation sub-module for generating an application interface;

and the coordinate system display sub-module is used for displaying a coordinate system in the application interface, wherein the coordinate system is provided with an original point and/or a candidate point and a line passing through the original point and/or the candidate point.

On the basis of the above embodiment, the drawing operation includes a generating operation, a dragging operation, and a deleting operation;

or,

transferring the origin point to the second location;

or,

and deleting the original point.

On the basis of the above embodiment, the target point acquisition module 34 includes:

an abscissa determining sub-module for determining an abscissa of the origin;

and the target point obtaining sub-module is used for sequencing the original points according to the abscissa so as to obtain the target point.

Based on the above embodiment, the candidate point fitting module 35 includes:

a concavity and convexity determination submodule for determining concavity and convexity between the target points;

And the candidate point adding sub-module is used for adding the candidate points conforming to the convexity between every two target points.

On the basis of the above embodiment, the candidate point adding submodule includes:

a first polynomial construction unit, configured to construct a first polynomial, where the first polynomial has a first coefficient, a second coefficient, a third coefficient, and a fourth coefficient, the first coefficient is coordinates of a first target point, the second coefficient is coordinates of a second target point, the third coefficient is a second derivative corresponding to the first target point, the fourth coefficient is a second derivative corresponding to the second target point, and the first target point and the second target point are adjacent target points;

a second polynomial construction unit configured to construct a second polynomial representing a broken line passing through the coordinates of the first target point and the coordinates of the second target point;

a third polynomial construction unit, configured to construct a third polynomial with the first polynomial and the second polynomial if the first polynomial approximates the second polynomial;

a first candidate point adding unit for adding a candidate point between the first target point and the second target point based on the third polynomial.

a fourth polynomial construction unit, configured to construct a fourth polynomial, where the fourth polynomial has a fifth coefficient, a sixth coefficient, a seventh coefficient, and an eighth coefficient, where the fifth coefficient is a coordinate of a first test point, the sixth coefficient is a coordinate of a second test point, the seventh coefficient is a second derivative corresponding to the first test point, the eighth coefficient is a second derivative corresponding to the second test point, if the first test point is the target point, the second test point is a candidate point adjacent to the target point, and if the first test point is the candidate point, the second test point is another candidate point or the target point adjacent to the candidate point;

a fifth polynomial construction unit configured to construct a fifth polynomial representing a broken line passing through the coordinates of the first inspection point and the coordinates of the second inspection point;

a sixth polynomial construction unit, configured to construct a sixth polynomial with the fourth polynomial and the fifth polynomial if the fourth polynomial approximates the fifth polynomial;

a second candidate point adding unit configured to add a candidate point between the first check point and the second check point based on the sixth polynomial.

On the basis of the above embodiment, the third polynomial construction unit includes:

a first longitudinal axis distance determination subunit configured to determine a first longitudinal axis distance on a longitudinal axis between the first polynomial and coordinates of the first target point;

a second longitudinal axis distance determining subunit configured to determine a second longitudinal axis distance on a longitudinal axis between the first polynomial and coordinates of the second target point;

a ninth coefficient determining subunit, configured to calculate, as a ninth coefficient, a ratio between a difference between a vertical axis distance and a horizontal axis distance, where the difference between the vertical axis distance and the first vertical axis distance is a difference between the coordinates of the second target point and the coordinates of the first target point, and the horizontal axis distance is a distance between the coordinates of the second target point and each other on the horizontal axis;

a tenth coefficient determination subunit, configured to subtract the first vertical axis distance from an abscissa of the ninth coefficient and the first target point to obtain a tenth coefficient;

a polynomial first construction subunit configured to construct a third polynomial based on the ninth coefficient and the tenth coefficient when the ninth coefficient is zero;

a polynomial second construction subunit configured to construct a third polynomial based on the tenth coefficient when the tenth coefficient is zero.

The line generating device provided by the embodiment can be used for executing the line generating method provided by the first embodiment and the second embodiment, and has corresponding functions and beneficial effects.

Example IV

Fig. 4 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention. As shown in fig. 4, the electronic device includes a processor 40, a memory 41, a communication module 42, an input device 43, and an output device 44; the number of processors 40 in the electronic device may be one or more, one processor 40 being taken as an example in fig. 4; the processor 40, the memory 41, the communication module 42, the input means 43 and the output means 44 in the electronic device may be connected by a bus or other means, in fig. 4 by way of example.

The memory 41 is a computer-readable storage medium that can be used to store a software program, a computer-executable program, and modules corresponding to a method of generating a line in the present embodiment (for example, an interface display module 31, an operation receiving module 32, an original point display module 33, a target point acquisition module 34, a candidate point fitting module 35, a line generating module 36, and a line display module 37 in a device for generating a line). The processor 40 executes various functional applications of the electronic device and data processing by executing software programs, instructions and modules stored in the memory 41, i.e. implements one of the line generation methods described above.

The memory 41 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for functions; the storage data area may store data created according to the use of the electronic device, etc. In addition, memory 41 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, memory 41 may further include memory located remotely from processor 40, which may be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

And the communication module 42 is used for establishing connection with the display screen and realizing data interaction with the display screen. The input means 43 may be used for receiving input numeric or character information and for generating key signal inputs related to user settings and function control of the electronic device.

The electronic device provided by the embodiment of the invention can execute the line generating method provided by any embodiment of the invention, and the method has specific corresponding functions and beneficial effects.

Example five

A fifth embodiment of the present invention also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are for performing a method of generating a line, the method comprising:

displaying an application interface;

receiving a drawing operation acting on the application interface;

generating a line passing through the target point and the candidate point;

and displaying the line in the application interface.

Of course, the storage medium containing the computer executable instructions provided in the embodiments of the present invention is not limited to the above-described method operations, and may also perform the related operations in the line generating method provided in any of the embodiments of the present invention.

From the above description of embodiments, it will be clear to a person skilled in the art that the present invention may be implemented by means of software and necessary general purpose hardware, but of course also by means of hardware, although in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, etc., and include several instructions for causing a computer electronic device (which may be a personal computer, a server, or a network electronic device, etc.) to execute the method according to the embodiments of the present invention.

It should be noted that, in the embodiment of the line generating apparatus, each unit and module included in the line generating apparatus are only divided according to the functional logic, but are not limited to the above-mentioned division, so long as the corresponding functions can be implemented; in addition, the specific names of the functional units are also only for distinguishing from each other, and are not used to limit the protection scope of the present invention.

Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.

Claims

1. The method for generating the line is characterized by comprising the following steps of:

displaying an application interface;

receiving a drawing operation acting on the application interface;

generating a line passing through the target point and the candidate point;

displaying the line in the application interface;

the drawing operation comprises a generating operation, a dragging operation and a deleting operation;

or,

transferring the origin point to the second location;

Or,

and deleting the original point.

2. The method of claim 1, wherein the displaying the application interface comprises:

generating an application interface;

3. The method according to claim 1, wherein the sorting the original points, taking the sorted original points as target points, comprises:

determining the abscissa of the origin;

4. A method according to any one of claims 1-3, wherein the relief is represented by a second derivative;

5. A method according to any one of claims 1-3, wherein the relief is represented by a second derivative;

6. The method of claim 4, wherein if the first polynomial approximates the second polynomial, constructing a third polynomial from the first polynomial and the second polynomial comprises:

7. A line generating device, characterized by comprising:

the interface display module is used for displaying an application interface;

the line display module is used for displaying the line in the application interface;

or,

transferring the origin point to the second location;

or,

and deleting the original point.

8. An electronic device, comprising:

one or more processors;

a memory for storing one or more programs;

when executed by the one or more processors, causes the one or more processors to implement a method of generating a line as claimed in any one of claims 1 to 6.

9. A computer-readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements a method of generating a line as claimed in any one of claims 1-6.