CN108153887A - A kind of method according to GPS coordinate quick search administrative region - Google Patents

A kind of method according to GPS coordinate quick search administrative region Download PDF

Info

Publication number
CN108153887A
CN108153887A CN201711460223.6A CN201711460223A CN108153887A CN 108153887 A CN108153887 A CN 108153887A CN 201711460223 A CN201711460223 A CN 201711460223A CN 108153887 A CN108153887 A CN 108153887A
Authority
CN
China
Prior art keywords
point
administrative
administrative division
points
inquiry
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
Application number
CN201711460223.6A
Other languages
Chinese (zh)
Inventor
张睿楠
周春英
朱明杰
高强
姜松涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Krypton Information Technology Co Ltd
Original Assignee
Shanghai Krypton Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Krypton Information Technology Co Ltd filed Critical Shanghai Krypton Information Technology Co Ltd
Priority to CN201711460223.6A priority Critical patent/CN108153887A/en
Publication of CN108153887A publication Critical patent/CN108153887A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases

Abstract

The present invention relates to a kind of methods according to GPS coordinate quick search administrative region, belong to map datum process field, and this method includes having the following steps:The map datum on administrative division boundary is acquired from map platform of increasing income;The source data of acquisition is pre-processed, pretreatment is to maintain original number for representing under the premise of administrative division figure is basically unchanged, simplifying description shape zoning point;Third walks, to storage data structure optimization;Make description each cut after figure point number be no more than 200, to accelerate inquiry velocity;4th step is put query optimization to high-volume, is carried out by the way of cluster.The method of the present invention provides the data engineering tool of the foundation GPS coordinate inquiry administrative division of version under efficient maintainable line for X Behavior services, under the premise of administrative division inquiry precision is met, substantially increases search efficiency and reliability.

Description

A kind of method according to GPS coordinate quick search administrative region
Technical field
The present invention relates to computer digital animations, are related specifically to a kind of foundation GPS coordinate quick search administrative region Method.
Background technology
In current geodata inquiry, most of using GPS coordinate, common numerical map has Google, hundred Degree and high moral etc..Geographical location query facility is developed as data engineering, generally there is following inquiry mode:1. line upper type. It is inquired by the API service that the map service platforms such as Baidu or Google provide into line up-regulation, such service advantage exists In limitation that is accurate, but being limited by network factors, the efficiency that can not meet real-time calling on enterprise's line is allowed in Engineering Service It is required that.2. under line or offline mode.Specific exemplary applications have the project Reverse_Geocoder (authors on Github Thampiman)。
Under above application mode, during data call process, its actual test speed in 20 milliseconds or so of a single point, But the inquiry velocity in this mode cannot meet the online service test speed demand of company, its accuracy rate is non-in addition It is often poor.This is because the project is based on the speciality of data structure KD-Tree (K Wei Shu), also its corpus for using is each Only there are one points for administrative division, cause the non-core site polling accuracy rate of borderline region and city very low.
Invention content
It is an object of the invention to overcome the shortcomings of above-mentioned on-line off-line inquiry effect, provide it is a kind of based on GPS coordinate come The method of quick search administrative division.The method for quickly querying of the present invention can be done under the premise of concrete application scene is met To rapid inquiry administrative region, it can not only accomplish the quick search of a single point, additionally it is possible to multiple points of quick search or even entire Administrative division.
In order to reach foregoing invention purpose, the technical solution that patent of the present invention provides is as follows:
A kind of method according to GPS coordinate quick search administrative region, which is characterized in that this method includes having the following steps:
The first step, acquires the map datum on administrative division boundary from map platform of increasing income, and the source data of the map datum is WGS84 forms;
Second step pre-processes the source data of acquisition, and pretreatment is to maintain original to represent administrative division figure substantially not Under the premise of change, simplify the number of description shape zoning point, set the parameter k of a tolerance first, from a figure most Distally two points(Assuming that A and E)Start with, calculate among two points(B-D)Point and the distance between AE straight lines, if the distance Less than parameter k, then this point is just deleted, if arbitrary point(Assuming that C points)The distance between AE straight lines are more than parameter k, then C Point retains, and then AC and CE carries out line and repeats above-mentioned analysis;Until an administrative division can be described with 300-2000 point;
Third walks, to storage data structure optimization;
Administrative division data boundary after storage is simplified, the data structure for borrowing Rtree optimize the data structure of storage, First the rectangle of the northeast of each region on each administrative grade and southwest corner construction is established with Rtree indexes, and accelerates single The inquiry of a point;Each administrative division is cut again with recurrence thought, so as to make a point of figure after description is each cut Number is no more than 200, to accelerate inquiry velocity;
Pattern cut concrete mode is:Tablet pattern(g)-- it is initially an administrative division figure, if the points of g are more than 200, then intermediate point is taken to cut off in x and y directions, cut again for cutting off latter two figure, until describing single figure The sum of points be less than 200;
4th step puts query optimization to high-volume;
During extensive GPS point inquiry administrative division information, carried out by the way of cluster, multiple close points are bundled into a figure Shape, inquires whether the figure belongs to some administrative division, if belonged to, all the points in the figure belong to this row Administrative division domain;
5th step, the figure after being clustered according to the above method carries out carrying out Integrated query in each administrative grade, if this group of institute The polygon of composition is then cut using above-mentioned clustering method again across multiple administrative regions, and when cutting needs to select more Small distance parameter is preferably reduced into original half, until inquiring each group of administrative division.
In a kind of method according to GPS coordinate quick search administrative region of the present invention, clustered in the 4th step Mode refers to, selects point centered on a point at random, if next point is in a distance parameter of arbitrary central point before(k) Within, then it is one kind, otherwise the point is one group of central point certainly.
Based on above-mentioned technical proposal, the method for foundation GPS coordinate quick search administrative region of the invention achieves as follows Technique effect:
1. method for quickly querying using the present invention, the inquiry of single GPS coordinate point is greatly increased at 2-4 milliseconds or so Search efficiency.
2. in the method for the present invention, by the method for the cutting pattern of recurrence thought, accelerate the inquiry speed of Rtree figures Degree saves inquiry velocity by being packaged multiple points, and core is efficient clustering method and recursive query logic so that Duo Gedian In the case that algorithm after optimization carries out more than 1000 points of inquiry of multiple points, each point that averagely gets off is taken on 1 millisecond of left side It is right.
3. the method for the present invention can believe that the Site characterization monitoring of X-Behavior provides reliable GPS administrative areas to krypton Domain inquiry service, under the premise of meeting inquiry precision, substantially increases search efficiency and reliability.
Description of the drawings
Fig. 1 is a kind of flow diagram of method according to GPS coordinate quick search administrative region of the present invention.
Fig. 2 is to administrative area cutting-up in a kind of embodiment of the method according to GPS coordinate quick search administrative region of the present invention The schematic diagram cut.
Specific embodiment
Our attached drawings and specific embodiment are come a kind of to the present invention according to GPS coordinate quick search administrative region below Method is further elaborated, and in the hope of being more clearly understood its process flow and realization method, but cannot be limited with this Protection scope of the present invention processed.
As shown in Figure 1, the present invention is a kind of method according to GPS coordinate quick search administrative region, this method includes Following steps:
The first step, acquires the map datum on administrative division boundary from map platform of increasing income, and the source data of the map datum is WGS84 forms, the form are a kind of satellite positioning calculation of longitude & latitude agreements defined by U.S. Department of Defense, are determined for the GPS whole world The coordinate system that position system is used and established.
Second step pre-processes the source data of acquisition, and pretreatment is to maintain original to represent administrative division figure base Under the premise of this is constant, simplify the number of description shape zoning point, the algorithm for realizing the purpose is:Douglas-Peucker is calculated Method.Letter is done to the figure of administrative division after being applied on end to end figure by changing Douglas-Peucker Change, need that 2 points of the distalmost end of set function (an often line) first is changed to farthest 2 points of distance on 2 dimension figures, do so Actual effect tend in the case where artwork deformation is moved less than 0.01%, one administration is just only described with 300-2000 point Zoning.
The explanation of Douglas-Peucker and the application on map datum:The algorithm is a kind of based on recurrence thought The algorithm of one geometric function number is described.It briefly describes:The parameter k of a tolerance is set first, from a figure most Distally two points(Assuming that A and E)Start with, calculate among two points(B-D)Point and the distance between AE straight lines, if the distance Less than parameter k, then this point is just deleted, if arbitrary point(Assuming that C points)The distance between AE straight lines are more than parameter k, then C Point retains, and then AC and CE carries out line and repeats above-mentioned analysis;Until finally an administrative area can be described with 300-2000 point It draws.
Third walks, to storage data structure optimization;
Administrative division data boundary after storage is simplified, the data structure for borrowing Rtree optimize the data structure of storage. First the rectangle of the northeast of each region on each administrative grade and southwest corner construction is established with Rtree indexes, and accelerates single The inquiry of a point;According to Rtree this data structure query point whether data structure feature inside, put the linear increasing of number Length can bring the geometric growth of query time, each administrative division be cut again with recurrence thought, so as to make description each The point number of figure is no more than 200 after cutting, to accelerate inquiry velocity.R-Tree data structures are a kind of dynamic index knots Structure is proposed by Antomn Guttman, is mainly used for the search of spatial data.It is another that Rtree is that Btree develops to hyperspace A kind of form, it is divided object space by range, and each node corresponds to a region and a disk page, non-leaf node The regional extent of its all child node is stored in disk page, the region of all child nodes of non-leaf node all falls the region model at it Within enclosing;The boundary rectangle of all spatial objects within its regional extent is stored in the disk page of leaf node.
The concrete mode of pattern cut is:Tablet pattern(g)-- it is initially an administrative division figure, if the points of g More than 200, then intermediate point is taken to cut off in x and y directions, cut again for cutting off latter two figure, it is single until describing The sum of points of figure are less than 200;
4th step puts query optimization to high-volume;
During extensive GPS point inquiry administrative division information, carried out by the way of cluster, the mode of cluster is to select one at random Point centered on point, if next point is in a distance parameter of arbitrary central point before(k)Within, then it is one kind, otherwise should Point is one group of central point certainly.Multiple close points are bundled into a figure, inquire whether the figure belongs to some administrative area It draws, if belonged to, all the points in the figure belong to this administrative region.
5th step, the figure after being clustered according to the above method carry out carrying out Integrated query in each administrative grade, if should The formed polygon of group is then cut using above-mentioned clustering method again across multiple administrative regions, and when cutting needs to select With smaller distance parameter, original half is preferably reduced into, until inquiring each group of administrative division.
Embodiment 1
In order to which the foundation GPS coordinate that the X-Behavior services believed to krypton provide version under efficiently maintainable line inquires administrative area The data engineering tool drawn.
1. the pretreatment of data source:
Map datum carrys out Source Description:It is collected in the administrative division boundary of map platform of increasing income (Open Street Mapper).Source Data format:Each corresponding up to ten thousand of administrative division (such as Jiangsu Province) connects the GPS that can sketch the contours administrative division figure Coordinate is WGS84 forms about GPS coordinates, it is a kind of satellite positioning calculation of longitude & latitude defined by U.S. Department of Defense Agreement.Under the background of real-time calculating speed demand, simplified processing has been carried out to collected data source, main purpose is, Maintaining original number for representing under the premise of administrative division figure is basically unchanged, simplifying point.
The algorithm for realizing the purpose is Douglas-Peucker algorithms.The explanation of Douglas-Peucker algorithms and Application on map datum:The algorithm is a kind of algorithm of one geometric function number of description based on recurrence thought.Briefly retouch It states:Parameter (k) for setting a tolerance first starts with first from two points of the distalmost end of a figure (assuming that A and E), The distance between the point of (B-D) and AE straight lines among two points are calculated, if the distance is less than parameter k, then this point is just Be deleted, if arbitrary point (assuming that C points) and the straight wire spacings of AE are more than k, then C points are retained, then to AC and CE into Row line repeats above-mentioned analysis (AE is substituted for AC or CE).It is applied by changing Douglas-Peucker in head On the figure that tail is connected, it is farthest that 2 points of the distalmost end of set function (an often line) is first changed to distance on X-Y scheme , simplification is then done to the figure of administrative division at 2 points, actual effect is tended in the case where artwork deformation is moved less than 0.01%, One administrative division is just only described with 300-2000 point.
2. the optimization pair storage data structure:
The data structure of Rtree has been borrowed behind the administrative division boundary after storage simplifies.
A. the rectangle of the northeast of each region on each administrative grade and southwest corner construction establishes rope with RTree Draw, accelerate the inquiry of a single point.
B. since the linear increase of number can bring the geometric growth of query time, according to this data structure of Rtree Query point whether data structure feature inside, each administrative division is cut again with recursive thought, so as to make to retouch The point number for stating figure after each cutting is no more than 200, so as to accelerate the inquiry velocity of Tree.
The specific logic of pattern cut:Tablet pattern (g) -- it is initially an administrative division figure, such as Anhui Province, if The points of g are more than 200, then intermediate point are taken to cut off on x and y (horizontal axis, the longitudinal axis) direction, for two figures after cut-out again The secondary points for carrying out above-mentioned cutting until the single figure of description are all less than 200. to the cutting effect in Anhui Province in such as Fig. 2 It can be seen that the place of script Anhui Province border more tortuous (point is more), feelings of the single figure point number less than 200 are switched to meeting Under condition, the smaller cut is needed.
3. for the optimization of high-volume point inquiry:
High-volume point inquiry belongs to scene demand, when extensive GPS point inquires administrative division information, if looked into one by one Ask it is less efficient, especially when the number of point be more than 1000 when, one by one inquiry may need 20 seconds or so.So big When scale point is inquired, need to redesign query strategy, devise that a precision is high but the higher O (n) of efficiency Clustering method, by multiple close Bao Zhengyi figures of point, inquire whether the figure belongs to some administrative division, if Belong to, then all the points in the figure belong to this administrative division.
Explanation about clustering algorithm mentioned above:It is random to select a point as a central point, if next point Then it is one kind within a distance parameter (k) of arbitrary central point before, otherwise the point is one group of central point certainly.Root Figure after being clustered according to the above method carries out the Integrated query in each administrative grade.If the polygon that the group is formed across Multiple administrative regions are then cut again using above-mentioned clustering method, and smaller distance parameter k can be used, general every It is secondary to be reduced into original 0.5 times, the administrative division until finding each group.
The present embodiment terminal is applied according to the method for GPS seat board quick search administrative region in XBehavior geographical locations Concentrate in fraud service, to each county city province carry out financial (loan) activity detection in real time, collected in XBehavior After the GPS coordinate of each period, loan under each administrative division of day part is calculated using the RGCoder after optimization Total amount, and compared with history with the period, the applying activity total amount as certain region calculates is more than conventional criteria, to being System makes place fraud alarm.

Claims (6)

  1. A kind of 1. method according to GPS coordinate quick search administrative region, which is characterized in that this method includes having the following steps:
    The first step, acquires the map datum on administrative division boundary from map platform of increasing income, and the source data of the map datum is WGS84 forms;
    Second step pre-processes the source data of acquisition, and pretreatment is to maintain original to represent administrative division figure substantially not Under the premise of change, simplify the number of description shape zoning point, the parameter k of a tolerance is set first, from an administrative division Two points of distalmost end of figure are started with, it is assumed that two points be A and E, calculate two points among point and AE straight lines between away from From if the distance is less than parameter k, then this intermediate point is just deleted, if the distance between arbitrary point C and AE straight lines are big In parameter k, then C points reservation, then AC and CE carries out line and repeats above-mentioned analysis operation respectively, until 300-2000 point can be used An administrative division figure boundary is described, preserves the administrative division data boundary after above-mentioned simplification;
    Third walks, to storage data structure optimization;
    The data boundary of multiple administrative divisions after storage simplifies, the data structure for borrowing Rtree carry out data knot to data boundary Structure optimizes, and first the rectangle of the northeast of the graphics field of each administrative division on each administrative grade and southwest corner construction is used Rtree establishes index, to accelerate the inquiry of a single point;Each administrative division is cut again with recurrence thought again, so as to make The point number of figure is no more than 200 after each cutting of description, to accelerate inquiry velocity;
    4th step puts query optimization to high-volume;
    During extensive GPS point inquiry administrative division information, carried out by the way of cluster, multiple close points are packaged as one A figure, inquires whether the figure belongs to some administrative division, if figure belongs to the administrative region, the institute in the figure This administrative region is belonged to a little;If fruit dot is packaged the figure formed after grouping across multiple administrative regions, then using upper It states clustering method and carries out cutting grouping again, when cutting needs to select smaller distance parameter, until inquiring each group of row It draws administrative division.
  2. 2. a kind of method according to GPS coordinate quick search administrative region according to claim 1, which is characterized in that the It needs to select smaller distance parameter when cutting in three steps, is preferably reduced into original half.
  3. A kind of 3. method according to GPS coordinate quick search administrative region according to claim 1, which is characterized in that institute The rectangle calculated in third step by Rtree is stated, the tree of a balance is abstractively calculated, in the section of every number On point, store the information including center and 4 angular coordinates, each geometric figure inquiry when, only need to be from most upper The rectangle of layer start comparison then layer by layer down the point of comparison inquiry geometric figure whether be possible to rectangle in this layer Interior, the rectangle until finding the bottom, the rectangle of the bottom is exactly original figure input.
  4. A kind of 4. method according to GPS coordinate quick search administrative region according to claim 3, which is characterized in that institute The core concept for stating RTree is to find N number of geometric figure of input more rational K big rectangle, each big rectangular Shape can generally frame the small figure within 3 or 3.
  5. A kind of 5. method according to GPS coordinate quick search administrative region according to claim 1, which is characterized in that institute It states and the concrete mode of pattern cut is carried out with recurrence thought in third step is:The figure g as administrative division figure is inputted, if The figure description points of g then take intermediate point to cut off, form two figures respectively more than 200 in x-axis and y-axis direction, can also be to cutting Latter two disconnected figure is cut again respectively, and the sum of points until describing single figure are less than 200.
  6. A kind of 6. method according to GPS coordinate quick search administrative region according to claim 1, which is characterized in that institute It states the mode clustered in the 4th step to refer to, selects point centered on a point at random, if next point is in arbitrary central point before A distance parameter(k)Within, then it is one kind, otherwise the point is one group of central point certainly.
CN201711460223.6A 2017-12-28 2017-12-28 A kind of method according to GPS coordinate quick search administrative region Pending CN108153887A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711460223.6A CN108153887A (en) 2017-12-28 2017-12-28 A kind of method according to GPS coordinate quick search administrative region

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711460223.6A CN108153887A (en) 2017-12-28 2017-12-28 A kind of method according to GPS coordinate quick search administrative region

Publications (1)

Publication Number Publication Date
CN108153887A true CN108153887A (en) 2018-06-12

Family

ID=62462708

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711460223.6A Pending CN108153887A (en) 2017-12-28 2017-12-28 A kind of method according to GPS coordinate quick search administrative region

Country Status (1)

Country Link
CN (1) CN108153887A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110442669A (en) * 2019-08-12 2019-11-12 广州小鹏汽车科技有限公司 A kind of whole scene determines the method and system of administrative zone position where positioning device
CN115934759A (en) * 2022-11-30 2023-04-07 二十一世纪空间技术应用股份有限公司 Accelerated computing method for massive multi-source heterogeneous satellite data query

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103034737A (en) * 2012-12-27 2013-04-10 天津市通卡公用网络系统有限公司 Deviation rectifying method of electronic map
CN103049464A (en) * 2012-03-30 2013-04-17 北京峰盛博远科技有限公司 Heterogeneous geospatial data management technique based on spatial object generalized model and grid body indexing
CN103823854A (en) * 2014-02-19 2014-05-28 厦门雅迅网络股份有限公司 Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes
CN105808756A (en) * 2016-03-15 2016-07-27 佛山市网冠金属制品有限公司 Map retrieval method and map retrieval system
CN107066593A (en) * 2017-04-19 2017-08-18 广东省科技基础条件平台中心 A kind of town level boundary coordinate data are combined the method and system of displaying with chart

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103049464A (en) * 2012-03-30 2013-04-17 北京峰盛博远科技有限公司 Heterogeneous geospatial data management technique based on spatial object generalized model and grid body indexing
CN103034737A (en) * 2012-12-27 2013-04-10 天津市通卡公用网络系统有限公司 Deviation rectifying method of electronic map
CN103823854A (en) * 2014-02-19 2014-05-28 厦门雅迅网络股份有限公司 Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes
CN105808756A (en) * 2016-03-15 2016-07-27 佛山市网冠金属制品有限公司 Map retrieval method and map retrieval system
CN107066593A (en) * 2017-04-19 2017-08-18 广东省科技基础条件平台中心 A kind of town level boundary coordinate data are combined the method and system of displaying with chart

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110442669A (en) * 2019-08-12 2019-11-12 广州小鹏汽车科技有限公司 A kind of whole scene determines the method and system of administrative zone position where positioning device
CN115934759A (en) * 2022-11-30 2023-04-07 二十一世纪空间技术应用股份有限公司 Accelerated computing method for massive multi-source heterogeneous satellite data query
CN115934759B (en) * 2022-11-30 2023-12-22 二十一世纪空间技术应用股份有限公司 Acceleration calculation method for massive multi-source heterogeneous satellite data query

Similar Documents

Publication Publication Date Title
CN107657637B (en) Method for acquiring operation area of agricultural machine
CN110634291B (en) High-precision map topology automatic construction method and system based on crowdsourcing data
CN104063466B (en) The 3 D displaying method and system of virtual reality integration
CN108763287A (en) On a large scale can traffic areas driving map construction method and its unmanned application process
CN110347499A (en) A kind of remote sensing image tile generates and the method for deployed in real time
CN106845710A (en) Mission area automatic division method and system, flight course planning method and system
CN113155141A (en) Map generation method and device, electronic equipment and storage medium
US20230042968A1 (en) High-definition map creation method and device, and electronic device
CN108038138A (en) A kind of method for the WGS84 coordinate systems that Google Maps is transformed into from CAD plane coordinate systems
CN113010793A (en) Method, device, equipment, storage medium and program product for map data processing
CN108153887A (en) A kind of method according to GPS coordinate quick search administrative region
CN108182218A (en) A kind of video character recognition method, system and electronic equipment based on GIS-Geographic Information System
CN103914877A (en) Three-dimensional model multi-detail-level structure based on extension combination
CN111295569A (en) System and method for generating road map
CN114626169A (en) Traffic network optimization method, device, equipment, readable storage medium and product
CN116518960A (en) Road network updating method, device, electronic equipment and storage medium
CN111859187A (en) POI query method, device, equipment and medium based on distributed graph database
CN114357097A (en) Map annotation construction method and device, computer equipment and storage medium
Ding UTR-tree: An index structure for the full uncertain trajectories of network-constrained moving objects
CN113449052A (en) Method for establishing spatial index, method and device for querying spatial region
CN116050159A (en) Simulation scene set generation method, device, equipment and medium
Wibowo et al. Mapping and grouping of farm land with Graham scan algorithm on convex hull method
CN116222539A (en) High-precision map data differentiated updating method and system
CN113971247A (en) Data processing method and computer program product
JP2022182286A (en) Path derivation system and path derivation method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180612