WO2019214489A1 - 曲线擦除 - Google Patents
曲线擦除 Download PDFInfo
- Publication number
- WO2019214489A1 WO2019214489A1 PCT/CN2019/085045 CN2019085045W WO2019214489A1 WO 2019214489 A1 WO2019214489 A1 WO 2019214489A1 CN 2019085045 W CN2019085045 W CN 2019085045W WO 2019214489 A1 WO2019214489 A1 WO 2019214489A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- curve
- polygon
- point
- intersection
- determining
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/80—Creating or modifying a manually drawn or painted image using a manual input device, e.g. mouse, light pen, direction keys on keyboard
Definitions
- the present application relates to the field of graphics technology, and in particular, to a curve erasing method and apparatus.
- the present application provides a curve erasing method and device, which can simplify the process of curve erasing, improve the efficiency of curve erasing, and improve user experience.
- a curve erasing method includes: acquiring an erase curve for erasing a drawing curve; connecting a start point and an end point of the erase curve to obtain a polygon; and determining a partial curve located within the polygon from the drawing curve, and The partial curve is erased.
- a curve erasing device comprises: an erase curve acquisition module, a polygon acquisition module and a drawing curve erasing module.
- the erase curve acquisition module is used to acquire an erase curve for erasing the drawing curve.
- the polygon acquisition module is configured to connect the start point and the end point of the erase curve to obtain a polygon.
- a draw curve erase module is used to determine a partial curve located within the polygon from the drawing curve and erase the partial curve.
- an electronic device comprising a processor and a memory configured to store processor executable instructions.
- the processor is configured to perform any of the above-described curve erasing methods.
- a computer readable storage medium having stored thereon a computer program that, when processed by a processor, implements any of the above-described curve erasing methods.
- the curve erasing method and apparatus obtains an erase curve for erasing a drawing curve, and connects a start point and an end point of the erasing curve to obtain a polygon, and further determines from the drawing curve that the image is located Part of the curve inside the polygon and erase.
- the arbitrarily complex curve can be segmented, and the curve located in the erased region after the segmentation can be erased at one time, thereby simplifying the process of curve erasing, improving the efficiency of curve erasing, and thereby improving the user.
- the arbitrarily complex curve can be segmented, and the curve located in the erased region after the segmentation can be erased at one time, thereby simplifying the process of curve erasing, improving the efficiency of curve erasing, and thereby improving the user.
- FIG. 1A is a flowchart of a curve erasing method according to an exemplary embodiment of the present application
- FIG. 1B is a schematic diagram showing the effect of a curve erasing method according to an exemplary embodiment of the present application
- 2A is a flow chart showing how a partial curve located within the polygon is determined from the drawing curve, according to an exemplary embodiment of the present application
- 2B is a flow chart showing how to determine an intersection of the polygon and a drawing curve, according to an exemplary embodiment of the present application
- FIG. 3 is a flow chart showing how a screening point of the drawing curve is filtered out from at least one determined intersection point according to an exemplary embodiment of the present application
- FIG. 4A is a flowchart showing whether the intersection point is a crossing intersection according to the positional relationship according to an exemplary embodiment of the present application
- 4B is a schematic diagram showing a positional relationship between a polygonal line of a drawing curve of an intersection point and a side line of a polygon according to an exemplary embodiment of the present application;
- 4C is a schematic diagram showing a positional relationship between a polygonal line of a drawing curve of a intersection point and a side line of a polygon, which is shown in another exemplary embodiment of the present application;
- FIG. 5A is a flowchart showing how a partial curve of the drawing curve located within the polygon is determined according to the dividing point and the starting point position information of the drawing curve according to an exemplary embodiment of the present application;
- FIG. 5B is a schematic diagram of dividing a drawing curve according to the dividing point and starting point position information of the drawing curve according to an exemplary embodiment of the present application;
- FIG. 6 is a flow chart showing how the starting point of the drawing curve is located within or outside the polygon according to the starting point position information of the drawing curve, according to an exemplary embodiment of the present application;
- FIG. 7 is a structural block diagram of a curve erasing apparatus according to an exemplary embodiment of the present application.
- FIG. 8 is a structural block diagram of a curve erasing apparatus according to still another exemplary embodiment of the present application.
- FIG. 9 is a structural block diagram of an electronic device according to an exemplary embodiment of the present application.
- first, second, third, etc. may be used to describe various information in this application, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other.
- first information may also be referred to as the second information without departing from the scope of the present application.
- second information may also be referred to as the first information.
- word "if” as used herein may be interpreted as "when” or “when” or “in response to a determination.”
- the curve erasing method includes erasing points on a line, erasing a polygon, erasing an intersection of a regular erase area, and the like. These curve erasing methods cannot segment arbitrary complex curves, and it is difficult to erase multiple complex curves at one time, and these curve erasing methods are usually performed for existing line segments, or at the end points. Split. These methods are not flexible enough to be accurately erased according to the user's intention, which in turn takes a lot of time and increases the spatial complexity of the algorithm.
- the drawing curve located inside the polygon can be erased at one time, which can reduce the spatial complexity of the algorithm and improve the complexity.
- the accuracy of the curve erasure greatly improves the continuity of the erase mode.
- FIG. 1A is a flow chart of a curve erasing method according to an exemplary embodiment of the present application.
- FIG. 1B is a schematic diagram showing the effect of a curve erasing method according to an exemplary embodiment of the present application.
- This embodiment can be used for terminal devices such as smart phones, tablets, PCs, PDAs (Personal Digital Assistants), wearable devices, and the like.
- the method includes steps S101-S103.
- the curve in the present application is a generalized curve, which may include a straight line, a broken line, a line segment, an arc, and the like.
- the drawing curve in the present application may be a straight line, a broken line, a line segment, an arc, or a combination thereof, or may be a shape of a character, a pattern of a drawing, or the like.
- the erase curve in the present application may be a straight line, a broken line, a line segment, an arc, or a combination thereof for erasing.
- step S101 may specifically be: acquiring an erase curve for erasing the drawing curve in the erase mode, the drawing curve being a curve in the pen mode.
- the user can draw a continuous curve of arbitrary length on the writing interface of the terminal device through a writing tool (such as a stylus, a finger or a mouse, etc.), which is a curve that can be self-intersecting.
- a writing tool such as a stylus, a finger or a mouse, etc.
- the drawing curve can be displayed on the writing interface, and the drawing curve can be described as a set of points, which is denoted as Vector ⁇ Point>Path (representing an array of points drawn by the curve) .
- Vector ⁇ Point>Path representing an array of points drawn by the curve
- the writing interface can be switched from the pen mode to the erasing mode, and then the above writing tool can freely draw a curve on the writing interface, and the curve is an erasing curve. You can also intersect yourself.
- the erase curve can be displayed on the writing interface, and the erase curve can be described as a set of points, denoted as Vector ⁇ Point>erasePath (representing an erase curve) An array of points).
- the terminal device can connect the starting point of the erasing curve (ie, the user's pen down point) and the end point (ie, the current point of the movement) by a line segment, so that the erasing curve is closed and formed. a polygon.
- the edge of the polygon can divide the drawing curve on the writing interface into a two-part curve: located in the above-mentioned polygon (ie, the erasing area) The first part of the curve, and the second part of the curve outside the polygon.
- the parity decision criterion of the polygon is: directing rays from any point to be determined (for example, to the left), and calculating the number of intersections formed by the edges of the ray and the polygon, if the number of intersections is even (including 0), then the point is outside the polygon; if the number of intersection points is odd, the point is inside the polygon.
- the first part of the curve located inside the polygon can be deleted, and the second part of the curve outside the polygon can be displayed.
- the drawing curve ABCDE is divided into AA', A'B', B'BCC', C'DD', D'E, A'B' and by polygons P1-P2-P3-P4-P5.
- C'DD' will be deleted once in the polygon, and the final result will be: AA', B'BCC', D'E.
- the present embodiment obtains an erasing curve for erasing a drawing curve drawn in an erasing mode, and connects a start point and an end point of the erasing curve to obtain a polygon, thereby determining from the drawing curve.
- a part of the curve located inside the polygon is erased, and the arbitrarily complex drawing curve can be segmented when the drawing curve is erased, and the curve located in the erasing area after the segmentation can be erased once. Therefore, the process of curve erasing can be simplified, the efficiency of curve erasing can be improved, and the user experience can be improved.
- FIG. 2A is a flow chart showing how a partial curve located within the polygon is determined from the drawing curve, according to an exemplary embodiment of the present application. This embodiment is based on the above embodiment, and is exemplified by how to determine a partial curve located within the polygon from the drawing curve as an example. As shown in FIG. 2A, determining a partial curve located within the polygon from the drawing curve in the above step S103 may include the following steps S201-S203.
- S201 Determine at least one intersection formed by the polygon and the drawing curve.
- the function of the erase curve is to divide a complete drawing curve into a plurality of line segments whose dividing points are located at the intersection of the edges of the polygon formed by the drawing curve and the erasing curve.
- the method for determining the intersection of the polygon and the drawing curve can be selected by the developer according to the actual business needs, such as the segment tree SegmentTree algorithm or the scan line SweepLine algorithm, which is not limited in this embodiment.
- the segmentation points for segmenting the drawing curve may be selected from the intersection points.
- intersections are segmentation points, because these intersections include intersections that intersect the intersection (the intersection of the curve drawn through the polygon's edge) and the non-traversal intersection (the intersection of the curve that does not cross the polygon's edge) Therefore, the intersection of the polygon and the drawing curve can be determined first, and on this basis, the crossing point is determined as the dividing point from the intersection points.
- the positional relationship of the starting point of the drawing curve with respect to the polygon may be determined according to the starting point position information of the drawing curve (such as the coordinates of the starting point of the drawing curve), and then according to the parity determination of the polygon.
- the criteria determine a portion of the curve in the curve that is within the polygon.
- the embodiment determines at least one intersection point of the polygon and the drawing curve, and filters a dividing point of the drawing curve from the at least one intersection point, and further according to the dividing point and the
- the starting point position information of the drawing curve determines a part of the curve in the drawing curve that is located within the polygon, so that a part of the curve located within the polygon can be accurately determined from the drawing curve, thereby implementing subsequent arbitrary
- the complex curve is segmented, and the curve in the erased region after the segmentation can be erased at one time, which simplifies the process of curve erasure, improves the efficiency of curve erasure, and improves the user experience.
- determining the intersection formed by the polygon and the drawing curve in the above step S201 may include the following steps S211-S212.
- the line segment tree SegmentTree may be constructed according to each edge of the polygon as an element.
- segment tree SegmentTree can be referred to the related art, which is not specifically limited in this embodiment.
- S212 Determine, by using the SegmentTree, at least one intersection of the polygon and the drawing curve.
- an erased area may be used to simultaneously erase multiple curves. Therefore, the line segment tree constructed by using the edge of the polygon as an element may be reused until the above polygon and the drawing curve are calculated. All the intersections.
- the present embodiment can accurately determine the polygon and the drawing curve by constructing a line segment tree with the edge of the polygon as an element and determining at least one intersection formed by the polygon and the drawing curve by using the SegmentTree.
- the intersection formed In this embodiment, by using the classical algorithm SegmentTree in computer graphics to calculate the intersection formed by the drawing curve and the polygon edge line, the intersection formed by an erase curve and a plurality of drawing curves can be determined, thereby achieving the purpose of reducing the time complexity. Effectively avoid the problem of interface delay response after subsequent curve erasure.
- FIG. 3 is a flow chart showing how to select a segmentation point of the drawing curve from at least one of the determined intersection points according to an exemplary embodiment of the present application. Based on the above embodiment, the present embodiment is exemplified by how to filter the segmentation points of the drawing curve from the determined at least one intersection. As shown in FIG. 3, the screening points of the drawing curve are selected from the determined at least one intersection point in the foregoing step S202, which may include the following steps S301-S305.
- the position information of the intersection point includes a first straight line segment between the drawing curve and the intersection point by the first designated end point (such as a prefix line segment of a drawing curve associated with the intersection point), along which the intersection point is along And drawing a second straight line segment between the curve to the second specified end point (such as a suffix line segment of the drawing curve associated with the intersection point), the third specified end point along the edge of the polygon to the intersection between the intersection points a three-line segment (such as a prefix edge of the polygon associated with the intersection), and a fourth line segment between the edge of the polygon and the fourth designated endpoint by the intersection (such as a polygon associated with the intersection) Suffix edge).
- first designated endpoint and the second designated endpoint are endpoints on the drawing curve that are closest to the intersection, and the third designated endpoint and the fourth designated endpoint are edges of the polygon. The nearest endpoint to the intersection.
- the line segment drawn first among the two line segments may be referred to as a prefix line segment according to the drawing order of the drawing curve (ie, ending with the intersection point).
- Line segment), and the line segment drawn later is called the suffix line segment (that is, the line segment starting from the intersection point).
- the line segment drawn first in the two line segments may be referred to as a prefix edge line according to the drawing order of the edge line (ie, the edge line ending with the intersection point). ), and the line segment drawn later is called the suffix edge (that is, the edge starting from the intersection).
- the manner of calculating the location information of the intersection point may include calculating the location information parameter of each intersection point after determining each intersection point, the parameter includes: an index of a prefix line segment associated with the intersection point (eg, a number of a prefix line segment), and the intersection point is prefixed
- the position metric on the line segment, the index of the suffix line segment associated with the intersection point (for example, the number of the suffix line segment), the position metric value on the intersection suffix line segment, the index of the prefix edge line associated with the intersection point (eg, the number of the prefix edge line), and the intersection point
- the position metric on the prefix edge, the index of the suffix edge associated with the intersection eg, the number of the suffix edge
- the position metric of the intersection on the suffix edge and the coordinates of the intersection (eg, abscissa x, ordinate y) .
- S302. Determine a first target line of the intersection according to a first straight line segment and a second straight line segment of each of the intersection points, and determine the intersection point according to the third straight line segment and the fourth straight line segment of each of the intersection points. Second goal line.
- the first target line of the intersection point may be determined according to the first straight line segment and the second straight line segment (hereinafter referred to as a broken line for drawing a curve); and determining a second target line of the intersection point (hereinafter simply referred to as an edge of the polygon) according to the third straight line segment and the fourth straight line segment of each of the intersection points.
- a positional relationship between the first target line and the second target line may be determined.
- the above location relationship may include a through relationship, a non-traversing not_through relationship, a coincidence to leave the coincidence_leave relationship, or a separation to coincidence away_coincide relationship, wherein the through relationship is used to characterize the first target line crossing the second target line; the non-traversing not_through relationship is used for Characterizing a second relationship that the first target line does not traverse the second target line; coincident to leave the coincidence_leave relationship for characterizing that the first target line and the second target line are coincident to leave; separating to coincidence away_coincide relationship for characterizing the first target line Separated to coincide with the second target line.
- crossing intersection is used to represent the edge line where the intersection point intersects the polygon.
- Determining the positional relationship between the first target line and the second target line associated with the intersection point ie, the positional relationship between the fold line of the associated drawing curve and the edge line of the polygon
- determining the positional relationship according to the positional relationship Draw whether the polyline of the curve crosses the edge of the polygon. If it crosses, it can be determined that the intersection is a crossing intersection; if it is not crossed, it can be determined that the intersection is a non-traversing intersection.
- the correspondence between the positional relationship and the crossing point or the non-traversing intersection point may be pre-built, and then the correspondence relationship may be queried after determining the positional relationship, and the intersection point is determined to be a crossing intersection point or a non-traversing intersection point.
- intersection point is a crossing intersection point
- the intersection point is determined as a division point of the drawing curve.
- the crossing intersection point After traversing the intersection point from the intersection point, the crossing intersection point may be determined as a division point of the subsequent division of the drawing curve.
- the position information of each intersection point is calculated in the embodiment, and the positional relationship between the fold line of the drawing curve associated with the intersection point and the edge line of the polygon is determined according to the position information of each intersection point, and then according to the position
- the positional relationship determines whether the intersection point is a crossing intersection point, and when the intersection point is determined to be a crossing intersection point, the intersection point is determined as a division point for dividing the drawing curve.
- the segmentation point of the segmentation drawing curve can be accurately selected from a plurality of intersection points, and then the subsequent drawing of the drawing curve based on the segmentation point can be performed, and the arbitrarily complex curve can be segmented, and the segmentation can be performed after the segmentation.
- the process of curve erasing can be simplified, the efficiency of curve erasing can be improved, and the user experience can be improved.
- FIG. 4A is a flowchart illustrating whether the intersection is a crossing intersection according to the positional relationship according to an exemplary embodiment of the present application
- FIG. 4B is a polygonal line and a polygon of a drawing curve of an intersection point shown by an exemplary embodiment of the present application
- FIG. 4C is a schematic diagram showing the positional relationship between the fold line of the intersection curve of the intersection point and the edge of the polygon shown by another exemplary embodiment of the present application;
- the present embodiment is exemplified by determining whether the intersection point is a crossing intersection point according to the positional relationship. As shown in FIG. 4A, whether the intersection is a crossing intersection according to the positional relationship in the foregoing step S304 may include the following steps S401-S405.
- step S401 Determine whether the location relationship is a first relationship (that is, a through relationship); if yes, execute step S402; if no, perform step S403.
- step S403. Determine whether the location relationship is a second relationship (ie, a non-traversing not_through relationship); if yes, execute step S404; if no, perform step S405.
- intersection point is a crossing intersection point or a non-traversing intersection point.
- the intersection point P0 if the associated line of the drawn curve (hereinafter referred to as a broken line) is P2-P0-P1, and the edge of the associated polygon is P4-P0-P3, then As can be seen from FIG. 4B, the polyline P2-P0-P1 traverses the edge P4-P0-P3 of the polygon, and it can be determined that the positional relationship is a through-through relationship. In this case, the intersection p0 can be determined as the crossing intersection.
- the fold line of the drawing curve associated with the intersection point P0 (hereinafter referred to as the fold line) is P2-P0-P1
- the edge of the associated polygon is P5-P0-P6
- the fold line P2-P0 -P1 does not cross the edge P5-P0-P6 of the polygon (ie, the two sides of P2-P0-P1 are located on the same side of the edge P5-P0-P6 of the polygon)
- the positional relationship is a non-traversing not_through relationship
- it can be determined that the intersection p0 is a non-passing intersection.
- the fold line of the P0-related drawing curve is P2-P0-P1, that is, the prefix line segment is P2-P0, the suffix line segment is P0-P1, and the prefix edge line of the polygon associated with the intersection point P0 is F1-P0
- the suffix edge of the polygon associated with the intersection point P0 is P0-P3
- the relationship is a coincidence-leave relationship, that is, the first half P2-P0 of the drawing curve P2-P0-P1 coincides with the edge F1-P0 of the polygon (coincide).
- the second half P0-P1 does not coincide with the edge P0-P3 of the polygon, but leaves the edge of the polygon, thus determining that the relationship is coincident_leave, that is, from coincidence to departure.
- intersection curve of the intersection curve P0 is P1-P0-P2, that is, the prefix line segment is P1-P0, the suffix line segment is P0-P2, and the edge of the polygon associated with the intersection point P0 is P3-P0-F1 (or F1). -P0-P3), it can be determined that the relationship is away_coincide, that is, the first half P1-P0 of the drawing curve P1-P0-P2 does not overlap with the edge F1-P0 of the polygon, and the second half P0-P2 and the polygon The edges P0-F1 coincide, that is, from separation to coincidence (away_coincide).
- intersection point may be determined as a crossing intersection point or a non-traversing intersection point according to the idea of the limit, and the idea is specifically explained below.
- judging whether the polyline of any drawing curve crosses the polygon only needs to judge whether the line segment and the edge of the polygon intersect.
- the polyline overlaps with the edge of the polygon ie, the erased boundary region
- the endpoint of the drawn curve falls on the boundary of the erased region.
- the coincident line segment is regarded as infinitely approaching the side line from one side of the edge of the polygon, and recording where it is located.
- One side stipulates that the subsequent results of the record are not changed, so that the degradation situation can be completely converted into a non-degenerate situation, which reduces the complexity of the engineering implementation to some extent.
- F1-P0-P3 ie, Q2-P0-P3
- P4-F1 the positional relationship between P4-F1-P0 (ie, P4-F1-Q1) and P2-P0 is not_through, that is, it is determined that F1-P0 is also located.
- an intermediate variable IdMap can be utilized to record information.
- the crossing condition of the intersection F1 that is, calculating the positional relationship of P2-P0 and F1-P0 for the first time
- the id pair (id1, id2) of P2-P0 and F1-P0 is the key key
- Q is located at P2-P0.
- the left left (Q1 position in Fig. 4C) is the value value, and the obtained key value pair key-value is inserted into the IdMap.
- P3-P0 and P4-F1 are located on the same side of P2-P0
- the result can be obtained: P4-F1, F1- Q1, Q1-P0, and P0-P3 are all located outside the polygon (the assumption that the point P4 is outside the polygon before the previous point is still used), that is, the intersection points F1 and P0 are non-traversing intersections.
- the positional relationship between the polyline of the drawing curve associated with the intersection point and the edge of the polygon in the embodiment is a through relationship, a non-traversing not_through relationship, a coincidence to leave the coincident_leave relationship, or a separation to coincidence away_coincide relationship, and then according to The resulting positional relationship determines whether the intersection is a crossing intersection. In this way, it can be accurately determined whether each intersection point is a crossing intersection point, and then the division point of the segmentation drawing curve can be selected from the intersection point, and the subsequent drawing curve is divided based on the segmentation point, and the arbitrarily complex curve can be segmented. And a one-time erasure of the segmented curve, which simplifies the process of curve erasure, improves the efficiency of curve erasure, and enhances the user experience.
- the method of determining whether the drawing curve is in the erasing area is usually to treat the drawing curve as a polyline, and then to judge the two end points of the polyline, but this can only judge whether the two end points are respectively located within the polygon, and for the non-convex polygon, Even if both ends of the line segment are inside the polygon, it cannot be concluded that the polyline is entirely inside the polygon.
- the erasing area is relatively complicated, it is necessary to sequentially calculate whether each end point is located in the erasing area, and whether each end point is located in the polygon. For the complex polygon, it is also necessary to compare with each side in turn, and the calculation amount is large.
- the parity decision criterion of the polygon by using the parity decision criterion of the polygon, it can be known that each time the drawing curve crosses the edge of the polygon, the topological property relative to the polygon is changed once, that is, from inside to outside or from outside to inside, so that only Determining the order of intersections and plotting whether the curve crosses the polygon at each intersection eliminates a lot of computation and reduces the interface response delay after erasure.
- it can be effective for any polygon instead of being able to be effective only for convex polygons or some polygons satisfying certain conditions, that is, theoretically, it can theoretically support arbitrarily complex erase regions.
- FIG. 5A is a flowchart showing how a partial curve of the drawing curve located within the polygon is determined according to the dividing point and the starting point position information of the drawing curve according to an exemplary embodiment of the present application
- FIG. 5B is a flowchart
- a schematic diagram of dividing a drawing curve according to the dividing point and the starting point position information of the drawing curve is shown in an exemplary embodiment of the present application.
- the present embodiment is exemplified by how to determine a partial curve of the drawing curve that is located within the polygon according to the segmentation point and the starting point position information of the drawing curve.
- the partial curve in the drawing curve that is located in the polygon according to the dividing point and the starting point position information of the drawing curve in the above step S203 may include the following steps S501-S503. .
- step S501 Determine whether a starting point of the drawing curve is located inside or outside the polygon; if yes, execute step S502; if no, perform step S503.
- the starting point position information of the drawing curve it may be determined according to the information whether the starting point of the drawing curve is located inside or outside the polygon.
- the inner and outer regions of the polygon may be determined according to the position information of each end point of the polygon and the connection relationship between the adjacent end points, and then the position information of the starting point of the drawing curve may be determined whether the starting point is located in the polygon or outer.
- the odd-numbered segment curve is an odd-numbered curve obtained by dividing the drawing curve based on the segmentation point, such as a curve numbered 1, 3, 5, ... (2n-1), where n is a positive integer. .
- the even-numbered segment curve is an even numbered curve obtained by dividing the drawing curve based on the dividing point, such as a curve numbered 2, 4, 5, ... (2n), wherein n is a positive integer.
- the coordinates of each segmentation point and its order on the drawing curve can be recorded, and the drawing curve can be segmented according to the position of the starting point of the obtained drawing curve with respect to the polygon.
- P0-P1-P2-P3-P4-P5 represents a drawing curve
- the obtained dividing points (ie, crossing intersection points) are C1, C2, and C3, and the drawing curve can be divided into The following multi-segment sub-curves.
- the position of the multi-segment sub-curve relative to the polygon can be determined according to the position of the starting point P0 of the drawing curve relative to the polygon, as shown in Table 1 below.
- the odd curve of the odd segment ie, the first segment: P0-P1, the third segment: C2-P3-C3
- a second partial curve other than the polygon, and the even-numbered segment ie, the second segment: C1-P1-P2-C2, the fourth segment: C3-P4-P5) sub-curve may be determined to be located in the polygon The first part of the curve inside.
- the odd-numbered segment ie, the first segment: P0-P1, the third segment: C2-P3-C3 sub-curve is determined to be located within the polygon.
- the first part of the curve, and the even-numbered segment ie, the second segment: C1-P1-P2-C2, the fourth segment: C3-P4-P5) sub-curve is determined as the first partial curve outside the polygon.
- the present embodiment determines whether the starting point is located within the polygon or outside, and when the starting point is located within the polygon, determining the odd-numbered sub-curves to be located within the polygon. a partial curve, and when the starting point is outside the polygon, the even-numbered sub-curve is determined as a partial curve located within the polygon, and the drawing curve can be segmented based on the dividing point, thereby realizing the segmentation
- the part of the curve drawn inside the polygon is erased once, which simplifies the process of curve erasure, improves the efficiency of curve erasure and enhances the user experience.
- FIG. 6 is a flowchart showing how the starting point of the drawing curve is located within or outside the polygon according to the starting point position information of the drawing curve according to an exemplary embodiment of the present application; the embodiment is implemented in the above embodiment.
- how to determine whether the starting point of the drawing curve is located inside or outside the polygon according to the starting point position information of the drawing curve is exemplified.
- determining whether the starting point of the drawing curve is located inside or outside the polygon according to the starting point position information of the drawing curve in step S501 may include the following steps S601-S605.
- step S601 determining whether the starting point is located on an edge of the polygon; if not, executing step S602; if yes, executing step S603.
- S602. Determine, according to the starting point position information of the drawing curve, whether the starting point is located inside or outside the polygon by using a winding number WindingNumber algorithm.
- step S604 when the simulated point leaves the edge of the polygon for the first time, it is determined whether the simulated point is currently located within the polygon, and if yes, step S605 is performed; if not, step S606 is performed.
- FIG. 7 is a structural block diagram of a curve erasing apparatus according to an exemplary embodiment of the present application.
- the apparatus includes an erase curve acquisition module 110, a polygon acquisition module 120, and a drawing curve erasing module 130.
- the erase curve acquisition module 110 is configured to acquire an erase curve for erasing the drawing curve.
- the polygon acquisition module 120 is configured to connect the start point and the end point of the erase curve to obtain a polygon.
- the drawing curve erasing module 130 is configured to determine a partial curve located within the polygon from the drawing curve and erase the partial curve.
- an erasing curve for erasing a drawing curve is acquired, and a start point and an end point of the erasing curve are connected to obtain a polygon, and then determined from the drawing curve to be located in the polygon.
- the partial curve is erased, so that the arbitrarily complex curve can be segmented, and the curve located in the erased region after the segmentation can be erased at one time, thereby simplifying the process of curve erasing and improving the curve erasure.
- the efficiency which in turn can enhance the user experience.
- the erase curve acquisition module 110 is configured to acquire an erase curve for erasing a drawing curve drawn in an erase mode, the drawing curve being a curve drawn in a pen mode.
- the writing interface of the terminal device may have a pen drawing mode and an erasing mode.
- the user can draw one or more continuous curves of arbitrary length on the writing interface of the terminal device through a writing tool (such as a stylus, a finger or a mouse, etc.), the curve is a curve, which can be self-intersecting .
- the writing interface can be switched from the pen mode to the erasing mode, and then the above writing tool can be used to draw a curve freely on the writing interface, the curve is the erasing curve, which can also Self-intersection.
- FIG. 8 is a structural block diagram of a curve erasing apparatus according to still another exemplary embodiment of the present application.
- the erase curve acquisition module 210, the polygon acquisition module 220, and the drawing curve erasure module 230 have the same functions as the erase curve acquisition module 110, the polygon acquisition module 120, and the drawing curve erasure module 130 in the foregoing embodiment shown in FIG. I will not repeat them here.
- the drawing curve erasing module 230 may include an intersection determining unit 231, a dividing point determining unit 232, and a partial curve determining unit 233.
- the intersection determining unit 231 is configured to determine at least one intersection formed by the polygon and the drawing curve.
- the segmentation point determining unit 232 is configured to filter out the segmentation point of the drawing curve from the determined at least one intersection point; the partial curve determining unit 233 is configured to determine, according to the segmentation point and the starting point position information of the drawing curve, Draw a partial curve in the curve that lies within the polygon.
- the segmentation point determining unit 232 is further configured to: determine location information of one of the at least one intersection point, where the location information of the one intersection point includes the first specified endpoint along the drawing curve to the intersection between the intersection points a straight line segment, a second straight line segment from the intersection point along the drawing curve to the second designated end point, a third straight line segment between the intersection point along the edge of the polygon from the third designated end point And a fourth straight line segment between the edge of the polygon and the fourth designated end point by the intersection point; the first designated end point and the second designated end point being the intersection point on the drawing curve
- the most recent endpoint, the third designated endpoint and the fourth designated endpoint are endpoints on the edge of the polygon that are closest to the intersection.
- a positional relationship between the first target line and the second target line is determined. Determining whether the intersection point is a crossing intersection according to the positional relationship. When it is determined that the intersection point is a crossing intersection point, the intersection point is determined as a division point of the drawing curve.
- the split point determining unit 232 is further configured to: if the positional relationship is a first relationship for characterizing the first target line crossing the second target line, determining the intersection point as a crossing intersection point; if the positional relationship is for Determining that the first target line does not traverse the second relationship of the second target line, determining that the intersection point is a non-traversing intersection point; if the positional relationship is used to represent that the first target line and the second target line are coincident to leave The third relationship, or a fourth relationship for characterizing the first target line and the second target line from separation to coincidence, determines whether the intersection point is a crossing intersection point according to the idea of the limit.
- the partial curve determining unit 233 may be further configured to: determine, according to the starting point position information of the drawing curve, whether a starting point of the drawing curve is located inside or outside the polygon; when the starting point is located within the polygon Determining an odd-numbered curve as a partial curve located within the polygon, the odd-numbered curve being an odd-numbered curve obtained by dividing the drawn curve based on the dividing point; when the starting point is located in the polygon
- the even-numbered curve is determined as a partial curve located within the polygon, and the even-numbered curve is an even-numbered curve obtained by dividing the drawn curve based on the dividing point.
- the partial curve determining unit 233 may be further configured to: determine whether the starting point is located on an edge of the polygon; if not, determine the starting point by using a winding number WindingNumber algorithm based on starting point position information of the drawing curve Whether it is located inside or outside the polygon; if so, moving the simulation point along the drawing curve from the starting point, when the simulated point leaves the edge of the polygon for the first time, if the simulated point is currently located Within the polygon, it is determined that the starting point is outside the polygon; otherwise, the starting point is determined to be within the polygon.
- Embodiments of the curve erasing apparatus of the present application can be applied to a network device.
- the device embodiment may be implemented by software, or may be implemented by hardware or a combination of hardware and software. Taking the software implementation as an example, as a logical means, the processor of the device in which it is located reads the corresponding computer program instructions in the non-volatile memory into the memory. From a hardware level, as shown in FIG. 9, a hardware structure diagram of the device where the curve erasing device of the present application is located, except for the processor, the network interface, the memory, and the non-volatile memory shown in FIG.
- the device in which the device is located in the embodiment may also include other hardware, such as a forwarding chip responsible for processing the message, and the like.
- the device may also be a distributed device, which may include multiple interface cards, so that Extension of message processing at the hardware level.
- the embodiment of the present application further provides a computer readable storage medium, on which a computer program is stored, and when the program is processed by the processor, any of the embodiments shown in FIG. 1 to FIG. 6 is implemented.
- the device embodiment since it basically corresponds to the method embodiment, reference may be made to the partial description of the method embodiment.
- the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the objectives of the present application. Those of ordinary skill in the art can understand and implement without any creative effort.
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Processing Or Creating Images (AREA)
- Image Generation (AREA)
Abstract
Description
P0位置 | P0-C1 | C1-P1-P2-C2 | C2-P3-C3 | C3-P4-P5 | 拆分结果 |
外 | 外 | 内 | 外 | 内 | P0-C1,C2-P3-C3 |
内 | 内 | 外 | 内 | 外 | C1-P1-P2-C2,C3-P4-P5 |
Claims (16)
- 一种曲线擦除方法,包括:获取用于擦除绘制曲线的擦除曲线;将所述擦除曲线的起点和终点相连得到多边形;确定所述绘制曲线中位于所述多边形之内的部分曲线,并且擦除所述部分曲线。
- 根据权利要求1所述的方法,其特征在于,获取用于擦除所述绘制曲线的所述擦除曲线,包括:获取擦除模式下绘制的用于擦除绘制曲线的擦除曲线,所述绘制曲线为绘笔模式下绘制的曲线。
- 根据权利要求1所述的方法,其特征在于,确定所述绘制曲线中位于所述多边形之内的所述部分曲线,包括:确定所述多边形与所述绘制曲线形成的至少一个交点;从所述至少一个交点中筛选出所述绘制曲线的分割点;根据所述分割点以及所述绘制曲线的起始点位置信息,确定所述绘制曲线中位于所述多边形之内的所述部分曲线。
- 根据权利要求3所述的方法,其特征在于,从所述至少一个交点中筛选出所述分割点,包括:针对所述至少一个交点中的每个交点,确定所述交点对应的位置信息,所述交点的位置信息包括:由第一指定端点沿着所述绘制曲线至所述交点之间的第一直线段、由所述交点沿着所述绘制曲线至第二指定端点之间的第二直线段、由第三指定端点沿着所述多边形的边线至所述交点之间的第三直线段、及由所述交点沿着所述多边形的边线至第四指定端点之间的第四直线段;所述第一指定端点和所述第二指定端点为所述绘制曲线上距离所述交点最近的端点,所述第三指定端点和所述第四指定端点为所述多边形的边线上距离所述交点最近的端点;根据所述第一直线段和所述第二直线段确定所述交点的第一目标线;根据所述第三直线段和所述第四直线段确定所述交点的第二目标线;根据所述第一目标线和所述第二目标线之间的位置关系,确定所述交点是否为穿越交点;若确定所述交点为穿越交点,则将所述交点确定为所述绘制曲线的分割点。
- 根据权利要求4所述的方法,其特征在于,根据所述第一目标线和所述第二目标线之间的位置关系,确定所述交点是否为穿越交点,包括:若所述位置关系表征所述第一目标线穿越所述第二目标线,则确定所述交点为穿越交点;若所述位置关系表征所述第一目标线未穿越所述第二目标线,则确定所述交点为非穿越交点;若所述位置关系表征所述第一目标线与所述第二目标线由重合至离开,则依据极限 的思想确定所述交点是否为穿越交点;若所述位置关系表征所述第一目标线与所述第二目标线由分离至重合,则依据极限的思想确定所述交点是否为穿越交点。
- 根据权利要求3所述的方法,其特征在于,根据所述分割点以及所述绘制曲线的起始点位置信息,确定所述绘制曲线中位于所述多边形之内的所述部分曲线,包括:根据所述绘制曲线的起始点位置信息,确定所述绘制曲线的起始点位于所述多边形之内还是之外;若所述起始点位于所述多边形之内,则将奇数段曲线确定为位于所述多边形之内的所述部分曲线,所述奇数段曲线为基于分割点对所述绘制曲线进行分割得到的编号为奇数的曲线;若所述起始点位于所述多边形之外,则将偶数段曲线确定为位于所述多边形之内的所述部分曲线,所述偶数段曲线为基于分割点对所述绘制曲线进行分割得到的编号为偶数的曲线。
- 根据权利要求6所述的方法,其特征在于,根据所述绘制曲线的起始点位置信息,确定所述绘制曲线的起始点位于所述多边形之内还是之外,包括:确定所述起始点是否位于所述多边形的边线上;若否,则基于所述绘制曲线的起始点位置信息,利用卷绕数WindingNumber算法判定所述起始点是否位于所述多边形之内;若是,则从所述起始点开始沿着所述绘制曲线移动模拟点,在所述模拟点首次离开所述多边形的边线时,若所述模拟点当前位于所述多边形之内,则确定所述起始点位于所述多边形之外;否则,确定所述起始点位于所述多边形之内。
- 一种曲线擦除装置,包括:擦除曲线获取模块,用于获取用于擦除绘制曲线的擦除曲线;多边形获取模块,用于将所述擦除曲线的起点和终点相连得到多边形;绘制曲线擦除模块,用于确定所述绘制曲线中位于所述多边形之内的部分曲线并擦除所述部分曲线。
- 根据权利要求8所述的装置,其特征在于,所述擦除曲线获取模块用于,获取擦除模式下绘制的用于擦除绘制曲线的擦除曲线,所述绘制曲线为绘笔模式下绘制的曲线。
- 根据权利要求8所述的装置,其特征在于,所述曲线擦除模块包括:交点确定单元,用于确定所述多边形与所述绘制曲线形成的至少一个交点;分割点确定单元,用于从所述至少一个交点中筛选出所述绘制曲线的分割点;曲线确定单元,用于根据所述分割点以及所述绘制曲线的起始点位置信息,确定所述绘制曲线中位于所述多边形之内的部分曲线。
- 根据权利要求10所述的装置,其特征在于,所述分割点确定单元用于,针对所述至少一个交点中的每个交点:确定所述交点对应的位置信息,所述交点的位置信息包括:由第一指定端点沿着所述绘制曲线至所述交点之间的第一直线段、由所述交点沿着所述绘制曲线至第二指定端点之间的第二直线段、由第三指定端点沿着所述多边形的边线至所述交点之间的第三直线段、以及由所述交点沿着所述多边形的边线至第四指定端点之间的第四直线段;所述第一指定端点和所述第二指定端点为所述绘制曲线上距离所述交点最近的端点,所述第三指定端点和所述第四指定端点为所述多边形的边线上距离所述交点最近的端点;根据所述第一直线段和所述第二直线段确定所述交点的第一目标线;根据所述第三直线段和所述第四直线段确定所述交点的第二目标线;根据所述第一目标线和所述第二目标线之间的位置关系,确定所述交点是否为穿越交点;当确定所述交点为穿越交点时,将所述交点确定为所述绘制曲线的分割点。
- 根据权利要求11所述的装置,其特征在于,所述分割点确定单元还用于:若所述位置关系表征所述第一目标线穿越所述第二目标线,则确定所述交点为穿越交点;若所述位置关系表征所述第一目标线未穿越所述第二目标线,则确定所述交点为非穿越交点;若所述位置关系表征所述第一目标线与所述第二目标线由重合至离开,则依据极限的思想确定所述交点是否为穿越交点;若所述位置关系表征所述第一目标线与所述第二目标线由分离至重合,则依据极限的思想确定所述交点是否为穿越交点。
- 根据权利要求10所述的装置,其特征在于,所述部分曲线确定单元还用于:根据所述绘制曲线的起始点位置信息,确定所述绘制曲线的起始点位于所述多边形之内还是之外;当所述起始点位于所述多边形之内时,将奇数段曲线确定为位于所述多边形之内的所述部分曲线,所述奇数段曲线为基于分割点对所述绘制曲线进行分割得到的编号为奇数的曲线;当所述起始点位于所述多边形之外时,将偶数段曲线确定为位于所述多边形之内的所述部分曲线,所述偶数段曲线为基于分割点对所述绘制曲线进行分割得到的编号为偶数的曲线。
- 根据权利要求12所述的装置,其特征在于,所述部分曲线确定单元还用于:确定所述起始点是否位于所述多边形的边线上;若否,则基于所述绘制曲线的起始点位置信息,利用卷绕数WindingNumber算法判定所述起始点位于所述多边形之内还是之外;若是,则从所述起始点开始沿着所述绘制曲线移动模拟点,在所述模拟点首次离开所述多边形的边线时,若所述模拟点当前位于所述多边形之内,则确定所述起始点位于所述多边形之外;否则,确定所述起始点位于所述多边形之内。
- 一种电子设备,所述电子设备包括处理器和被配置为存储处理器可执行指令的存储器;其中,所述处理器被配置为执行权利要求1-7中任一项所述的曲线擦除方法。
- 一种计算机可读存储介质,其上存储有计算机程序,该程序被处理器处理时实现权利要求1-7中任一项所述的曲线擦除方法。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810429247.3A CN110458920B (zh) | 2018-05-08 | 2018-05-08 | 一种笔迹擦除方法及装置 |
CN201810429247.3 | 2018-05-08 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2019214489A1 true WO2019214489A1 (zh) | 2019-11-14 |
Family
ID=68467683
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2019/085045 WO2019214489A1 (zh) | 2018-05-08 | 2019-04-29 | 曲线擦除 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN110458920B (zh) |
WO (1) | WO2019214489A1 (zh) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111274344A (zh) * | 2020-01-20 | 2020-06-12 | 东南大学 | 对各弧段进行有规律的取舍的多目标缓冲区合并方法 |
CN113592735A (zh) * | 2021-07-23 | 2021-11-02 | 作业帮教育科技(北京)有限公司 | 文本页面图像还原方法及系统、电子设备和计算机可读介质 |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111736745B (zh) * | 2020-07-27 | 2020-12-25 | 深圳市千分一智能技术有限公司 | 笔画擦除方法、装置、设备及可读存储介质 |
CN111736751B (zh) * | 2020-08-26 | 2021-03-26 | 深圳市千分一智能技术有限公司 | 笔画重绘方法、设备及可读存储介质 |
CN113282214A (zh) * | 2021-05-21 | 2021-08-20 | Oppo广东移动通信有限公司 | 笔画渲染方法、装置、存储介质以及终端 |
CN113345384B (zh) * | 2021-05-28 | 2022-06-10 | 深圳市爱码讯实业发展有限公司 | 一种手写板的笔迹擦除方法及系统 |
CN113610946B (zh) * | 2021-08-03 | 2024-05-14 | 深圳市闪联信息技术有限公司 | 一种利用板擦功能分割绘图笔迹的方法 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020027554A1 (en) * | 2000-09-01 | 2002-03-07 | Nec Corporation | Graphic editing apparatus for adding or deleting curve to/from graphics by interactive processing |
CN101477694A (zh) * | 2008-12-02 | 2009-07-08 | 广东威创视讯科技股份有限公司 | 笔迹擦除的方法及装置 |
CN105574907A (zh) * | 2015-12-18 | 2016-05-11 | 广州视睿电子科技有限公司 | 信息处理方法及装置 |
CN106097414A (zh) * | 2016-05-31 | 2016-11-09 | 福建天泉教育科技有限公司 | 曲线擦除方法及系统 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101609560B (zh) * | 2009-07-16 | 2011-09-14 | 广东威创视讯科技股份有限公司 | 一种擦除笔迹的方法 |
WO2015192271A1 (zh) * | 2014-06-19 | 2015-12-23 | 福建福昕软件开发股份有限公司北京分公司 | 一种擦除记录板上的电子笔迹的方法 |
CN104537701A (zh) * | 2015-01-22 | 2015-04-22 | 江苏中威科技软件系统有限公司 | 矢量线条操作方法 |
CN104992460B (zh) * | 2015-05-28 | 2019-05-07 | 深圳市创易联合科技有限公司 | 擦除矢量笔迹的方法 |
CN106325737B (zh) * | 2016-08-03 | 2021-06-18 | 海信视像科技股份有限公司 | 一种书写路径擦除方法及设备 |
CN106910232A (zh) * | 2017-02-24 | 2017-06-30 | 青岛海信电器股份有限公司 | 画线擦除方法及装置 |
-
2018
- 2018-05-08 CN CN201810429247.3A patent/CN110458920B/zh active Active
-
2019
- 2019-04-29 WO PCT/CN2019/085045 patent/WO2019214489A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020027554A1 (en) * | 2000-09-01 | 2002-03-07 | Nec Corporation | Graphic editing apparatus for adding or deleting curve to/from graphics by interactive processing |
CN101477694A (zh) * | 2008-12-02 | 2009-07-08 | 广东威创视讯科技股份有限公司 | 笔迹擦除的方法及装置 |
CN105574907A (zh) * | 2015-12-18 | 2016-05-11 | 广州视睿电子科技有限公司 | 信息处理方法及装置 |
CN106097414A (zh) * | 2016-05-31 | 2016-11-09 | 福建天泉教育科技有限公司 | 曲线擦除方法及系统 |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111274344A (zh) * | 2020-01-20 | 2020-06-12 | 东南大学 | 对各弧段进行有规律的取舍的多目标缓冲区合并方法 |
CN113592735A (zh) * | 2021-07-23 | 2021-11-02 | 作业帮教育科技(北京)有限公司 | 文本页面图像还原方法及系统、电子设备和计算机可读介质 |
Also Published As
Publication number | Publication date |
---|---|
CN110458920B (zh) | 2021-09-21 |
CN110458920A (zh) | 2019-11-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2019214489A1 (zh) | 曲线擦除 | |
US10373359B2 (en) | Method and device for erasing a writing path on an infrared electronic white board, and a system for writing on an infrared electronic white board | |
Takayama et al. | Sketch-based generation and editing of quad meshes. | |
JP7179695B2 (ja) | 車線追跡方法及び装置 | |
WO2019085709A1 (zh) | 一种应用于卷积神经网络的池化处理的方法及系统 | |
CN107943365B (zh) | 线条笔迹的呈现方法、装置、电子设备及存储介质 | |
CN110544255B (zh) | 面向3d打印的三角网格孔洞的分割方法及系统 | |
CN107564077B (zh) | 一种绘制道路网的方法及装置 | |
JP2020098387A (ja) | 因果関係表示システム及び方法 | |
CN108564645B (zh) | 房屋模型的渲染方法、终端设备及介质 | |
CN114283099A (zh) | 一种图处理的方法,系统以及装置 | |
CN107544863B (zh) | 一种数据存储方法及装置 | |
KR20230145197A (ko) | 공간 관계 결정 방법, 장치, 컴퓨터 기기 및 저장 매체 | |
CN104572917A (zh) | 数据锁定方法、装置及分布式存储系统 | |
CN105468538A (zh) | 一种内存迁移方法及设备 | |
CN108804016A (zh) | 基于触摸屏的物体识别方法,装置及电子设备 | |
JP2020013577A (ja) | 仮想キーボードの誤タイピングを補正するための方法、システム、およびコンピュータプログラム | |
CN104503868A (zh) | 数据同步方法、装置以及系统 | |
CN109739859B (zh) | 一种关系图谱绘制方法、系统及相关装置 | |
JP6365102B2 (ja) | データ処理装置およびプログラム | |
US10424096B1 (en) | Technique for orthogonal edge routing of directed layered graphs with edge crossings reduction | |
CN111833452B (zh) | 多面体切割三角网的切割方法及系统 | |
KR20230099120A (ko) | 동적 후보 공간을 이용한 연속적 부분 그래프 매칭 방법 및 장치 | |
CN114690786A (zh) | 一种移动机器的路径规划方法和装置 | |
CN103020402A (zh) | 建模方法和装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 19800493 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 19800493 Country of ref document: EP Kind code of ref document: A1 |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 19800493 Country of ref document: EP Kind code of ref document: A1 |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 10.05.2021) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 19800493 Country of ref document: EP Kind code of ref document: A1 |