CN106447724A - Method for determining region limit based on scan conversion algorithm and mesh compression - Google Patents
Method for determining region limit based on scan conversion algorithm and mesh compression Download PDFInfo
- Publication number
- CN106447724A CN106447724A CN201610817035.3A CN201610817035A CN106447724A CN 106447724 A CN106447724 A CN 106447724A CN 201610817035 A CN201610817035 A CN 201610817035A CN 106447724 A CN106447724 A CN 106447724A
- Authority
- CN
- China
- Prior art keywords
- grid
- code
- mesh
- polygon
- conversion algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method for determining region limit based on scan conversion algorithm and mesh compression, and relates to the Internet of Vehicles. The method includes the following steps: 1. a pre-processing step: firstly creating a mesh, then determining the attributes of each unit in the mesh for establishing whether the unit is in the mesh or outside the mesh, then compressing the mesh; 2. a determining step: based on the parameter of the created mesh, obtaining the positions of the parameters in the mesh from the longitudes and attitudes of the testing points; then computing a MD code, locating the MD code in a quadtree, and if the MD code can not be located, entering the next layer for locating the MD code; if the MD code can be located, returning to the attribute corresponding to the MD code, obtaining the result of determining whether a to-be-tested point is with a polygon. The quadtree compression algorithm is used to store the mesh. The method requires less time for performing pre-processing, reduces the time for determination, and can be applied to regions of any shape, a circle or a polygon.
Description
Technical field
The present invention relates to car networking, especially relate to a kind of restriction of region based on scan conversion algorithm and mesh compression and sentence
Disconnected method.
Background technology
Point, with respect to Polygon position detection, is one of basic problem in computational geometry.This problem is easy to explanation：
Whether an a given polygon P and arbitrary point Q, wonder point Q in polygon P.It is at GIS-Geographic Information System (GIS)
Have a wide range of applications [1] with fields such as computer graphics.Although there being many effectively methods, find more effectively
Solve problem remains necessary, because it is the basis of other algorithms many, such as algorithm for polygon clipping and ray tracing
Algorithm etc. [1], and their efficiency is had a great impact.Additionally, with the development of application, for point with respect to polygon morpheme
Putting detection has new requirement.As the dynamic monitoring [2] of the flood zones in GIS, vehicle region restriction etc. in car networking.
Car networking (IOV) is an application [2] in intelligent transportation system (ITS) for the Internet of Things.IOV is one based on embedded
Formula electronic equipment, cordless communication network and cloud computing system intelligent information service system.Vehicle with embedded electronic equipment can
With shared between vehicle and vehicle, the infrastructure of vehicle and roadside fixation, status information and real-time traffic between vehicle and people
Information.
It is one of widest function of car networking that the region of vehicle limits.Vehicular manufacturer, dealer or car owner wish to supervise
Superintend and direct and limit the area in a closing for their vehicle.When the border of restricted area crossed by supervised vehicle, this platform will
Produce an alert notice relevant people.Zone boundary is represented with a series of continuity points, with the current location of vehicle as test point, will
The alarm decision that region limits is converted to a little decision problem in polygon.
To point, decision algorithm in polygon proposes new requirement to region bound problem in vehicle net：
(1) polygon in actual geographic is not a plane, but sphere, therefore can not directly set up uniform grid.
(2) substantial amounts of data passed back by vehicle.Assume there are 30000 cars, each car sends back a secondary data, system in every 30 seconds
Must have the ability to process 1000 data at least per second.This requires decision algorithm as fast as possible.
(3) region restriction module should be as few as possible using memory headroom, because car networking system has multiple complexity
Function.
Point decision problem in polygon has been widely studied, and has been proposed for various effective methods.These sides
Method is broadly divided into two classes.It is to calculate and the certain parameter of assessment in the feature of first kind method, this method does not need pre- place
Reason, including ray intersecting method [3], based on the method [4] of triangle operation, calculates displacement symbol [5] and based on angle and [6].
Because each polygonal side must calculate, their time complexity is all O (N), and wherein n is the number on polygonal side
Mesh.
Equations of The Second Kind method is complex polygon to be resolved into simple polygon form, such as triangulation method [7], trapezoidal method,
Convex polygon and boundary layer method [8].Additionally, being also introduced into various spaces sub-structure, to reduce complexity, such as grid, triangle
Deng.Same polygonal many points are tested, their time complexity is less than O（N）, wherein n is polygonal side
Number [9].However, the pretreatment of these methods typically requires long time.
(1) ray method
Ray method is that point judges algorithm the most classical in polygon.It can successfully process polytype polygon, and
And time complexity is O（N）(n is polygon edge number).Draw a ray from test point, calculate ray and polygonal intersection point
Number；If odd number, it shows that test point is located in polygon.If even number, then point is located at polygonal outside [10].
(2) convex polygon method
Complicated polygon resolves into one group of convex polygon first, and then these convex polygons are organized in a binary system
Tree.Therefore, binary tree is used as a search tree, finds the convex polygon most possibly comprising test point.Then start
Calculate whether this point is located in convex polygon.The quantity that polygon resolves into one group of convex polygon generally much smaller than resolves into its ladder
The quantity of shape.Therefore, convex polygon divided method is generally than trapezoidal method faster.Pretreatment has two steps：Convex decomposition and foundation
Binary tree.Decision is divided into two steps：Find the convex polygon of the measurement point most possibly comprising, and decision-point whether position
In convex polygon.
(3) grid element center point methods
In pretreatment, it constructs uniform grid, calculates and record the position attribution (polygon of each grid element center point
Outside interior/polygon), judge the position attribution of this point by the relation of measured point and unit center that it is located point when judging.
The conclusion released based on ray method based on grid element center point methods：Given polygon P, known location attribute (P
In outward/P) grid element center point M and measured point Q, if then the intersection point number on the side of line segment MQ and P is even number, the position attribution of Q
Identical with the position attribution of M；Otherwise contrary.
Bibliography:
[1] Li Nan, Wu Xincai, Ma Jinjin, Wang Zhong. arbitrarily simple with the vector line chart of R- tree space index based on grid
Polygon window trimming algorithm. computer engineering and science, 2012 (34), 11:96-103.
[2]De Berg M,Van Kreveld M,Overmars M,Schwarzkpf O.,Computational
Geometry:Algorithms and Applications.2nd ed.,Springer,Berlin,2000.
[3]Chen Wen,LI Xiaojun,Research on Architecture and Key Technologies
of Internet of Vehicles,Microcomputer Information,2011.
[4]S.Yang,J.Yong,J.Sun,H.Gu,J.C.Paul,A point-in-polygon method based
on a quasi-closest point,Computers&Geosciences,vol.36(2),pp.205-213,2010.
[5]J.J.Jiménez,F.R.Feito,R.J.Segura,A new hierarchical triangle-based
point-in-polygon data structure,Computers&Geosciences,vol.35(9),pp.1843-1853,
2009.
[6]Wang WC,Li J,Wu EH.2D point-in-polygon test by classifying edges
into layers.Computers&Graphics,2005,29(3):427-439.
[7] Li Jing, Wang Wencheng, Wu Enhua. efficient judgement in polygon for the point based on convex subdivision. natural science enters
Exhibition, 17 (7)：636-648,2007.
[8] Li Jing, Wang Wencheng. efficient judgement in polygon for the point based on grid element center point is based on grid element center point
Efficient judgement in polygon for the point. Journal of Software, 2014,21 (3):85–92.
[9]J.Li,W.Wang.,Point-in-polygon tests by determining grid center
points in advance,Signal and Information Processing Association Annual Summit
and Conference(APSIPA),2013Asia-Pacific.
[10]Zheng Meisheng,ChenNing,Song chao.An algorithm for determining
the largest internal ciecle in arbitrary polygons.Machinery Design&
Manufacture,2005(09):84-84.
Content of the invention
It is an object of the invention to provide a kind of region based on scan conversion algorithm and mesh compression limits determination methods.
The present invention comprises the following steps：
1) pre-treatment step：
First create a grid, then determine the attribute of each of grid unit, that is, this unit is in grid or grid
Outward, then compress grid；
2) determination step, concrete grammar is as follows：
By test point longitude and latitude, according to the parameter setting up grid, obtain parameter position within a grid；Calculate MD code again,
Search this MD code in quaternary tree, if search less than, enter next layer search；If it is found, returning this corresponding genus of MD code
Property value is it is simply that the measured point whether judged result in polygon.
In step 1) in, the concrete grammar of one grid of described establishment can be：
Determine grid granularity, according to car networking practical situations, by whole grid size of population be defined as less times greater than
Zone boundary；
The described attribute determining each of grid unit can adopt scan conversion algorithm, the tool of described scan conversion algorithm
Body method is as follows：
Using every for grid a line as horizontal scan line, from top to bottom or from top to bottom scanning area, every scan line can and
Region produces a series of crosspoints, and latitude is pressed to sequence, the attribute of determining unit lattice simultaneously in these crosspoints.
Described compression grid concrete grammar can be：Encode in record quaternary tree using based on metric Morton code (MD)
Site position, the computational methods of described Morton code are that ranks number is converted to binary system, carry out binary system cross transposition and obtain newly
Binary number, then to change into the decimal system be exactly required Morton code：
The present invention, in pre-treatment step, establishes a Grid by input area.It is to cover and somewhat big
In actual area, each point of zone boundary is exactly actual longitude and latitude.Then scan conversion algorithm is used for scanning area
Domain, and determine the position attribution (whether in region) of each cell.Then, deposit using based on the quaternary tree that Morton code encodes
Storage and compression grid, reduce memory headroom.In determination step, calculate the Morton code of test point first, then pass through lookup four
Fork is set and to be obtained the cell that test point falls, and this cell attribute is exactly the result judging.
Compared with the conventional method, the present invention has advantages below：
1) with quaternary tree compression algorithm come save mesh.It is better than the divided method of traditional a large amount of memory space of requirement.
2) pretreatment time is short, because carrying out sweep polygon using the Xin Bianbiao and active edges table of scan line, rather than meter
Calculate the intersection point of scan line and each zone boundary, this calculates the calculating of intersection point by reducing.
3) determine test point position within a grid by quaternary tree searching algorithm, greatly reduce the judgement time.Sentencing
Regularly, it does not have singularity to consider it is not necessary to consider special circumstances.Because in pretreatment, in scan conversion algorithm, can consider
And wipe the situation that those can lead to singularity.
4) region of any shape can be used, either circular or polygon (includes concave polygon and selfing is polygon
Shape), can be processed in pre-treatment step.
Brief description
Fig. 1 is scan line and Polygon position graph of a relation in scan conversion algorithm.
Fig. 2 is that the new side producing in scan conversion algorithm represents intention.
Specific embodiment
Following examples will combine accompanying drawing, and the present invention is further illustrated.
The present invention comprises the following steps：
1) pre-treatment step：
First create a grid, then determine the attribute of each of grid unit, that is, this unit is in grid or grid
Outward, then compress grid；
In step 1) in, the concrete grammar of one grid of described establishment can be：
Determine grid granularity, according to car networking practical situations, by whole grid size of population be defined as less times greater than
Zone boundary.
On same warp, once actual range difference is about 111km to difference of latitude, and on Same Latitude, difference of longitude was once
Actual range difference about 111cos α km (α is latitude value), if setting up uniform grid, then on different latitude line, cell
Quantity will be different, and this can affect mesh compression efficiency and search speed.Secondly, on vehicle car-mounted terminal pass back gps data with
The deviation of actual location data is in 0～20m, but does not need for cell to be sized such that 20m, because doing on zone boundary
Gray scale buffers, and now border is not clear and definite, when vehicle progress gray scale band, produces warning immediately, is determined according to these information
Cell size.
The described attribute determining each of grid unit can adopt scan conversion algorithm, the tool of described scan conversion algorithm
Body method is as follows：
Using every for grid a line as horizontal scan line, from top to bottom or from top to bottom scanning area, every scan line can and
Region produces a series of crosspoints, and latitude is pressed to sequence, the attribute of determining unit lattice simultaneously in these crosspoints.
Using Xin Bianbiao and active edges table scan region, observe 1 based on following two) several only related every time sides can
Can there is intersection point with scan line, therefore all of side need not be carried out asking friendship to calculate；2) adjacent scan line and same straightway
There is stepping relation in intersection point, this relation is relevant with the slope of straightway place straight line；
One simple scanning process is as shown in Figure 1.The Xin Bianbiao's producing during scanning is as shown in Figure 2.Scan line y=4
And LP1P2、LP3P4Intersecting, now there is L in active edges tableP1P2、LP3P4.For scan line y=5, new side LP4P5Add Xin Bianbiao, and
LP3P4Remove from active edges table.Certainly, this will greatly reduce pretreatment time.
Described compression grid concrete grammar can be：Encode in record quaternary tree using based on metric Morton code (MD)
Site position, ranks number is converted to binary system, carries out binary system cross transposition and obtains new binary number, then changes into the decimal system
It is exactly required Morton code, Morton code calculation is as follows：
In order to save memory space, it is necessary that grid is compressed, present grid data compressed encoding side
Method includes flowing compresses in length algorithm, difference mapping algorithm and quadtree coding compression algorithm [11].Wherein quaternary tree compression is
Effectively.
In cell row=5 (row within a grid:OK), col=7 (col:Row), then its Morton code is by ranks
Binary representation intersects to form.MD=55.In 8 × 8 grid, Morton code table is as shown in table 1.
Table 1
2) determination step, concrete grammar is as follows：
By test point longitude and latitude, according to the parameter setting up grid, obtain parameter position within a grid；Calculate MD code again,
Search this MD code in quaternary tree, if searched less than entrance last layer is searched.If it is found, returning this corresponding genus of MD code
Property value is it is simply that the measured point whether judged result in polygon.
Assume there is N number of cell in grid, need before compression to be stored as O (N), after compression, memory space greatly reduces,
On searching time complexity, after compression, the time searches the number of plies for quaternary tree, up to
Verify the present invention in actual car networking project, in project, message server is ActiveMQ 5.9.0, cloud computing
Platform OpenStack, database MySQL and MongoDB.
Select 6 regions, different types of regional edge number is as shown in table 2.
Table 2
| Region name | Side number |
| pol 5 | 5 |
| pol 10 | 10 |
| pol 50 | 50 |
| pol 100 | 100 |
| pol 223 | 223 |
| circle1 | Circle |
About 10,000 cars in system, every 30s passes a secondary data back, and data is sent to message server, car from vehicle termination
The data processing module monitoring information server of networked platforms obtains the position data of vehicle, and region limits alarm module parsing number
According to obtaining longitude and latitude and the limited region of vehicle, carry out region decision, if not doing other process in region, if exceeding region
Then send a warning message.Only change point evaluation algorithm in region, in the case that other conditions are constant, during record system execution
Between.
Comparing result is as shown in table 3.Represent ray method with RC, RCC represents the innovatory algorithm of ray method, CPS represents convex many
Side shape method, SLGC represents the present invention, and SLGC-1 represents the not SLGC method through quaternary tree compression.TpRepresent pretreatment time
(unit second), TqRepresent the total time (unit second) that 12500 test point execution points judge in region, TtRepresent total time, Tt
=Tp+Tq(unit second).S represents assist storage space (unit K B).RsRepresent the saving rate of memory space, such as algorithm
SLGC, memory space saving rate computational methods are：
Rs=(S [SLGC]-S [SLGC-1])/S [SLGC]
Rq,RtRepresent T respectivelyq,TtRate of acceleration.For example for algorithm SLGC, memory space saving rate computational methods are：
Rq=(Tq[old]-Tq[SLGC])/Tq[SLGC]
Rt=(Tt[old]-Tt[SLGC])/Tt[SLGC]
Wherein, old represents other algorithms of contrast.
Table 3
Test result indicate that, 70% auxiliary storage can be reduced by more than after mesh compression.In preprocessing process, SLGC-1
Algorithm is than additive method faster.The pretreatment of SLGC algorithm is slow, because mesh compression process is time-consuming, but can accept
, because it is several seconds, and only runs when system starts and once pre-process.
Decision stage, does not have additive method to have obvious advantage for the contrast of polygon pol5 ray method, because it is not
Need to process too many edge.But, when polygonal side is continuously increased and polygon becomes more complicated, and present invention contrast
Additive method is more stable and faster.For border circular areas, the present invention still ratio is very fast, because considering region in pre-treatment step
Shape and singularity, so dissimilar region does not result in impact in decision stage.
According to actual car networking system problem present in the restriction of region it is necessary to running quick enough and storing few.For
This, the present invention proposes a region restriction determination methods algorithm combining scan conversion algorithm and mesh compression algorithm.Pre-
In process step, using scan conversion algorithm, and improve scan-line algorithm speed by noting down active edges table and Xin Bianbiao, and
Need to calculate scan line and all sides situation.Then the scan matrix being obtained with quaternary tree compression storage.By based on Morton code
Quaternary tree compression, the present invention has lower storage than other scan-line algorithms.In decision stage it is only necessary to calculate test
The Morton code of point, then looks up quaternary tree, obtains result of determination.Show, the present invention is than other by real data test result
Point decision algorithm in region has time the shortest and less storage.Polygonal side is more, and shape is more complicated, this
Bright advantage is more obvious, is very suitable for processing the region of any shape and substantial amounts of query point.
Claims (3)
1. a kind of region based on scan conversion algorithm and mesh compression limits determination methods it is characterised in that including following walking
Suddenly：
1) pre-treatment step, concrete grammar is as follows：
First create a grid, then determine the attribute of each of grid unit, that is, this unit in grid or outside grid, so
Compress grid afterwards；
2) determination step, concrete grammar is as follows：
By test point longitude and latitude, according to the parameter setting up grid, obtain parameter position within a grid；Calculate MD code again, four
Fork tree in search this MD code, if search less than, enter next layer search；If it is found, returning this corresponding property value of MD code,
It is exactly judged result whether in polygon for the measured point.
2. a kind of region based on scan conversion algorithm and mesh compression limits determination methods, its feature as claimed in claim 1
It is in step 1) in, the concrete grammar of one grid of described establishment is：
Determine grid granularity, according to car networking practical situations, whole grid size of population is defined as less times greater than region
Border；
The described attribute determining each of grid unit can adopt scan conversion algorithm, the concrete side of described scan conversion algorithm
Method is as follows：
Using every for grid a line as horizontal scan line, from top to bottom or from top to bottom scanning area, every scan line meeting and region
Produce a series of crosspoints, latitude is pressed to sequence, the attribute of determining unit lattice simultaneously in these crosspoints.
3. a kind of region based on scan conversion algorithm and mesh compression limits determination methods, its feature as claimed in claim 1
It is in step 1) in, the concrete grammar of described compression grid is：Encode record quaternary tree using based on metric Morton code
Middle site position, the computational methods of described Morton code are that ranks number is converted to binary system, carry out binary system cross transposition and obtain
New binary number, then to change into the decimal system be exactly required Morton code：
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610817035.3A CN106447724A (en) | 2016-09-12 | 2016-09-12 | Method for determining region limit based on scan conversion algorithm and mesh compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610817035.3A CN106447724A (en) | 2016-09-12 | 2016-09-12 | Method for determining region limit based on scan conversion algorithm and mesh compression |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106447724A true CN106447724A (en) | 2017-02-22 |
Family
ID=58167544
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610817035.3A Pending CN106447724A (en) | 2016-09-12 | 2016-09-12 | Method for determining region limit based on scan conversion algorithm and mesh compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106447724A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110019984A (en) * | 2017-12-27 | 2019-07-16 | 北京小度信息科技有限公司 | Spatial index method for building up, device, electronic equipment and readable storage medium storing program for executing |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350013A (en) * | 2007-07-18 | 2009-01-21 | 北京灵图软件技术有限公司 | Method and system for searching geographical information |
| CN104063509A (en) * | 2014-07-09 | 2014-09-24 | 武汉大学 | Information pushing system and method based on mobile geofence |
| CN104598475A (en) * | 2013-10-31 | 2015-05-06 | 中国移动通信集团公司 | Storage and indexing method and system based on traffic consumption model event |
-
2016
- 2016-09-12 CN CN201610817035.3A patent/CN106447724A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350013A (en) * | 2007-07-18 | 2009-01-21 | 北京灵图软件技术有限公司 | Method and system for searching geographical information |
| CN104598475A (en) * | 2013-10-31 | 2015-05-06 | 中国移动通信集团公司 | Storage and indexing method and system based on traffic consumption model event |
| CN104063509A (en) * | 2014-07-09 | 2014-09-24 | 武汉大学 | Information pushing system and method based on mobile geofence |
Non-Patent Citations (1)
| Title |
|---|
| KUNHUI LIN ET AL: "SLGC: A Fast Point-in-Area Algorithm based on Scan-Line Algorithm and Grid Compression", 《THE 11TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION (ICCSE 2016)》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110019984A (en) * | 2017-12-27 | 2019-07-16 | 北京小度信息科技有限公司 | Spatial index method for building up, device, electronic equipment and readable storage medium storing program for executing |
| CN110019984B (en) * | 2017-12-27 | 2021-10-29 | 北京星选科技有限公司 | Spatial index establishing method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109840660B (en) | Vehicle characteristic data processing method and vehicle risk prediction model training method | |
| CN104050817B (en) | Speed limiting information base generation and speed limiting information detection method and system | |
| CN107145991B (en) | Time-varying random network dynamic path searching method considering road section correlation | |
| CN113935442B (en) | Method and device for classifying automatic driving function test roads of automobile and storage medium | |
| CN113935441B (en) | Method and device for selecting automobile automatic driving function test road and storage medium | |
| CN105425320A (en) | Probabilistic forecasting method and system of coastal gale caused by tropical cyclone | |
| CN107958312B (en) | Electric transmission line galloping prediction method and system based on inversion algorithm and storage medium | |
| CN113836999A (en) | Tunnel construction risk intelligent identification method and system based on ground penetrating radar | |
| CN113536659A (en) | Method, system and storage medium for rapidly predicting post-earthquake road disaster area | |
| CN115100819A (en) | Landslide hazard early warning method and device based on big data analysis and electronic equipment | |
| CN106447724A (en) | Method for determining region limit based on scan conversion algorithm and mesh compression | |
| CN116824868B (en) | Method, device, equipment and medium for identifying illegal parking points and predicting congestion of vehicles | |
| CN111881566B (en) | Landslide displacement detection method and device based on live-action simulation | |
| CN116384255B (en) | Park dangerous situation perception method and system based on multi-source data fusion | |
| CN111080080B (en) | Village geological disaster risk prediction method and system | |
| CN113792992B (en) | Landslide collapse emergency evaluation method and system based on remote sensing big data | |
| Weiqiang et al. | A cloud-based approach for ship stay behavior classification using massive trajectory data | |
| Lin et al. | SLGC: a fast point-in-area algorithm based on scan-line algorithm and grid compression | |
| Cipolla et al. | Identification of spatio-temporal outliers through minimum spanning tree | |
| CN114332009A (en) | Similar weather situation recognition method, device, equipment and storage medium | |
| CN111144612A (en) | Gas station position point prediction method and device, storage medium and terminal | |
| CN112783891A (en) | Method and device for matching adjacent polygonal areas based on longitude and latitude | |
| CN112581060A (en) | Cargo allocation demand degree detection method, device and equipment based on vehicle loading and unloading points | |
| CN108009510B (en) | Security situation analysis method and device | |
| CN111291720B (en) | Building advertisement identification system based on cloud computing network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170222 |