CN102693296A - Method for rapidly matching coordinates of mass two-dimension point data - Google Patents
Method for rapidly matching coordinates of mass two-dimension point data Download PDFInfo
- Publication number
- CN102693296A CN102693296A CN2012101514821A CN201210151482A CN102693296A CN 102693296 A CN102693296 A CN 102693296A CN 2012101514821 A CN2012101514821 A CN 2012101514821A CN 201210151482 A CN201210151482 A CN 201210151482A CN 102693296 A CN102693296 A CN 102693296A
- Authority
- CN
- China
- Prior art keywords
- coordinate
- graticule mesh
- dimensional points
- rectangle
- little
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 244000188472 Ilex paraguariensis Species 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000000354 decomposition reaction Methods 0.000 claims description 2
- 230000013011 mating Effects 0.000 claims description 2
- 230000008520 organization Effects 0.000 abstract description 4
- 239000002131 composite material Substances 0.000 abstract description 2
- 230000008878 coupling Effects 0.000 description 8
- 238000010168 coupling process Methods 0.000 description 8
- 238000005859 coupling reaction Methods 0.000 description 8
- 238000012935 Averaging Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005314 correlation function Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
Images
Landscapes
- Processing Or Creating Images (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention solves the problem of rapid query and matching of corresponding point objects in mass two-dimension point data according to two-dimension coordinate values, and provides a method for rapidly matching coordinates of mass two-dimension point data. In the method, firstly, all the two-dimension point data are subject to composite structure organization: first, calculating an envelop rectangle where the mass two-dimension points are, then, disassembling the envelop rectangle into regularly-arranged small rectangle grids according to a fixed length and width, then according to the space coordinate positions, respectively distributing all the two-dimension point data into the small rectangle grids. On that basis, a rule of point data object sorting according to the two-dimension coordinate values is set. Based on the rule, the two-dimension point-set data objects distributed in each grid are organized using a binary tree structure. On the basis of the above structure's successful establishment, the rapid query and matching of the two-dimension coordinate points can be realized, and the whole matching retrieval process can be made independent of the data bulk.
Description
Technical field:
The present invention relates to a kind of method that can in two-dimensional points data in enormous quantities, match its corresponding two-dimensional points object fast according to two-dimensional coordinate.
Background technology:
Along with the spatial information the reach of science, point coordinate data receives increasing concern as the significant data form and the Data Source of vector data in association area at present.When obtaining the some object of this coordinate correspondence,, become the bottleneck problem that spatial data is operated because huge data volume makes this operation very consuming time by its foundation topology contact and through the two-dimensional coordinate point.
Goal of the invention:
The invention solves the problems referred to above that prior art exists; The inquiry and the coupling of its corresponding point object have been realized in two-dimensional points data in enormous quantities, accomplishing fast according to the two-dimensional coordinate value; Method of the present invention can shorten matching process greatly, makes its consuming time basic has nothing to do with data volume.
For realizing above purpose, the present invention adopts following description scheme:
The method that coordinate matees fast in the two-dimensional points data in enormous quantities comprises the quick matching process that existing a large amount of two-dimensional points data is carried out complex tissue and coordinate, and concrete steps are following:
Step 1:For an existing batch two-dimensional coordinate point data; At first obtain the envelope rectangle at all two-dimensional points data places: two limits of this envelope rectangle are parallel to the X axle and the Y axle of coordinate axis respectively; Wherein the minimum value of X-direction (Xmin) is the minimum value of all point data X coordinates, and the maximal value of X-direction (Xmax) is the maximal value of all point data X coordinates; Same method obtains this and covers the coordinate range ((Ymin), (Ymax)) of the Y direction of rectangle, so obtains surrounding the envelope rectangle of all two-dimensional points data;
Step 2:Above-mentioned envelope rectangle is carried out graticule mesh along X-direction and Y direction according to fixing length and width decomposes, the little graticule mesh length and width after the decomposition be made as above-mentioned envelope rectangle long and wide 1/5 to 1/100;
Step 3:All point coordinate are assigned in each graticule mesh: promptly obtain each two-dimensional points (x, y) the little graticule mesh of " affiliated ", the pointer of the two-dimensional points that its institute of storage " comprises " in each little graticule mesh through coordinate Calculation; Adopt following computing formula can calculate the sequence number of its little rectangle graticule mesh that should submit oneself to: to establish graticule mesh sequence number on the directions X since 0, along the X positive dirction; Graticule mesh sequence number on the Y direction is since 0, along the Y positive dirction, then point coordinate (x, y) pairing graticule mesh sequence number is:
X
n=[(x-Xmin)/Lx]; Lx: be the length on the directions X of the little graticule mesh of rectangle; Surplus rounding operation is removed in symbol [] expression;
Y
n=[(y-Ymin)/Ly]; Ly: be the length on the Y direction of the little graticule mesh of rectangle; Surplus rounding operation is removed in symbol [] expression;
Pointer with current two-dimensional points object is saved in this little rectangular node (X then
n, Y
n) variable in (be about to this point " submit oneself to " in this little rectangle graticule mesh), according to the method all two-dimensional points objects are submitted oneself in its pairing little graticule mesh;
Step 4:Then, set the ranking criteria of two-dimensional points,, adopt binary tree structure to organize again the two-dimentional point set data object that is assigned in each little graticule mesh based on this criterion; Setting is based on the sort method of point coordinate: for two two-dimensional points, at first confirm " ordering " of coordinate points according to x coordinate size; If the x coordinate is identical, then further confirm " ordering " of coordinate points according to the size of y coordinate; If the y coordinate is also identical, then think these 2 identical (equating); So far accomplish the complex tissue to a large amount of two-dimensional points data, this process need carries out once;
Step 5:After existing two-dimensional points data in enormous quantities are carried out above-mentioned complex tissue, according to the coordinate (x of random two-dimensional point
0, y
0) inquire about rightly, find the corresponding two-dimensional points object of this coordinate fast:
1) at first, matching process for the first time is according to its coordinate values (x
0, y
0) calculate its corresponding graticule mesh sequence number (X
n, Y
n), confirm its place graticule mesh:
X
n
?= [(x
0
-Xmin)/Lx];
Xmin: be the coordinate minimum value of envelope rectangle directions X
Lx: be the length on the directions X of little rectangle graticule mesh;
Surplus rounding operation is removed in symbol [] expression;
Y
n
= [(y
0
-Ymin)/Ly];
Ymin: be the coordinate minimum value of envelope rectangle Y direction
Ly: be the length on the Y direction of the little graticule mesh of rectangle;
Surplus rounding operation is removed in symbol [] expression;
2) confirm graticule mesh after, in this little graticule mesh, carry out matching process for the second time: through current coordinate values (x
0, y
0), be stored in two-dimensional points set pair in this little graticule mesh match search of comparing in resembling with the y-bend table structure, obtain the pairing entity two-dimensional points of this coordinate object fast.
Wherein, in the step 4 two-dimensional points in each little graticule mesh is carried out binary tree by the setting ranking criteria and organize, adopt the set container in the C++ STL to carry out, this set algorithm container has been realized the algorithm of organizing of binary tree data structure;
Wherein, the second time of step 5, the searching algorithm that directly calls the set container promptly obtained corresponding result when mating.
This method invention is at first carried out the composite structure tissue to all two-dimensional points data: the envelope rectangle that at first calculates a large amount of two-dimensional points place; Then according to fixing length and width it is decomposed into the little rectangle graticule mesh of regular arrangement, then all two-dimensional points data is assigned to respectively in these little graticule mesh; On this basis, the rule that can sort according to coordinate values to the two-dimentional point set data setting that is assigned in each graticule mesh based on this ordering rule, resembles and adopts binary tree structure to organize again being assigned to two-dimensional points set pair in each graticule mesh.Set up on the successful basis at said structure; Can realize the fast query coupling of two-dimensional coordinate again through twice coupling: when known certain two-dimensional coordinate numerical value; Calculate the graticule mesh that its corresponding point data should exist at first fast, in this graticule mesh, adopt the concentrated fast query coupling of carrying out of two-dimensional points of binary tree structure tissue then.Whole coupling retrieving can be accomplished basic and data volume has nothing to do.
Beneficial effect of the present invention is following:
This method invention can make whole matching process and data volume have nothing to do, and thoroughly solves the match query problem based on point coordinate.The normal linear structure that adopts is carried out Data Matching, and then complexity is O (n) (a whole point set data scale), that is to say that the comparison work of traditional approach will the linear increase along with the increase of data volume; And adopt this method to invent; The time complexity of two-dimensional coordinate to be looked into being submitted oneself in the rectangle graticule mesh of correspondence is c (constant), and is irrelevant with overall data amount (data scale), and further in little graticule mesh, inquires about to binary tree; It has logarithmic complexity; Have higher search efficiency, in the search that has 1000 elements, be merely 1/50 of linear session the averaging time of its binary tree seek actions; The data volume that in addition is distributed in each graticule mesh is merely the sub-fraction in the overall data amount, so the comparison number of times of coordinate and institute's elapsed time reduce greatly in this whole coordinate matching process.Whole process can thoroughly solve the some matching inquiry problem of two-dimensional coordinate, handles thoroughly solving this bottleneck problem for a large amount of two-dimensional space point data.
Description of drawings
The logical schematic of data organization flow process among Fig. 1 the present invention.
The synoptic diagram of two-dimensional coordinate match query among Fig. 2 the present invention.
Embodiment
Large quantities of amount two-dimensional coordinate point data shown in a among Fig. 1; According to the inventive method it is carried out the quick matching inquiry based on coordinate; At first need carry out complex tissue, carry out the quick coupling of coordinate on the basis of this complex tissue structure again existing magnanimity two-dimensional points data.Can follow following steps carries out:
Step 1:For existing a collection of a large amount of two-dimensional points data; At first obtain the envelope rectangle at all two-dimensional points data places: two limits of this envelope rectangle are parallel to the X axle and the Y axle of coordinate axis respectively; Wherein the minimum value of X-direction (Xmin) is the minimum value of all point data x coordinates, and the maximal value of X-direction (Xmax) is the maximal value of all point data x coordinates; Same method obtains the coordinate range ((Ymin), (Ymax)) of the Y direction of this envelope rectangle, so obtains surrounding the envelope rectangle of all two-dimensional points data;
Step 2:Shown in the figure of the C among Fig. 1; Can the envelope rectangle be carried out graticule mesh along X-direction and Y direction according to fixing length and width and decompose, its little graticule mesh long wide numerical value, can confirm according to the densely distributed degree of two-dimensional points and the numerical value that covers the whole length and width of rectangle; Two-dimensional points densely distributed; Then little graticule mesh long wide numerical value can get little of some, otherwise, then get bigger; Also can directly be taken as 1/10 (1/5 to/100 all can) of the whole length and width that cover rectangle generally speaking, its final purpose is to allow and exceed under the situation that increases the whole algorithm complexity to make the two-dimensional points quantity in each graticule mesh reduce to fewer state in design conditions.
Step 3:All point coordinate are assigned in each graticule mesh: promptly obtain each two-dimensional points (x, y) the little grid of " affiliated ", the pointer of the two-dimensional points that its institute of storage " comprises " in each little graticule mesh through spatial coordinates calculation; Adopt following computing formula can calculate the sequence number of its little rectangle graticule mesh that should submit oneself to: to establish graticule mesh sequence number on the directions X since 0, along the X positive dirction; Graticule mesh sequence number on the Y direction is since 0, along the Y positive dirction; (direction setting wherein and beginning sequence number can freely be set according to user's needs), then point coordinate (x, y) pairing graticule mesh sequence number (X
n, Y
n) be:
X
n=[(x-Xmin)/Lx]; Lx: be the length on the directions X of little rectangle graticule mesh; Surplus rounding operation is removed in symbol [] expression;
Y
n=[(y-Ymin)/Ly]; Ly: be the length on the Y direction of little rectangle graticule mesh; Surplus rounding operation is removed in symbol [] expression;
Pointer with current two-dimensional points object is saved in this little rectangular node (X then
n, Y
n) variable in (be about to this point " submit oneself to " in this little rectangle graticule mesh), according to the method all two-dimensional points objects are submitted oneself in its pairing little graticule mesh;
Step 4:Shown in d figure among Fig. 1, set ranking criteria and carry out binary tree and organize being assigned to two-dimentional point set in each little rectangle graticule mesh.In view of the present invention is mainly used in the right of coordinate, so need to set sort method based on point coordinate.In this sort method, owing to computer-internal adopts type real to store for point coordinate, so when judging that two numbers equate, employing is subtracted each other the method for asking poor and carried out.Its ordering rule can be made as: at first confirm " ordering " of coordinate points according to x coordinate size; If x coordinate identical (both are poor less than certain threshold value, a desirable very little real number (as 0.0000001)) is then further confirmed " ordering " of coordinate points according to the size of y coordinate; If y coordinate also identical (both are poor less than certain threshold value, a desirable very little real number (as 0.0000001)); Then obtain these 2 identical (etc.).According to this ordering rule, each two-dimensional coordinate point can " compare size ", can adopt binary tree structure to organize then.When concrete the realization, can adopt the set container in the C++ standard form to carry out, this set algorithm container has been realized the algorithm of organizing of binary tree data structure, the binary tree that can directly carry out data make up and the insertion of data correlation function such as inquiry operate.
So far accomplish the complex tissue to magnanimity two-dimensional points data, this process need carries out once.
Step 5:After existing magnanimity two-dimensional points data are carried out above-mentioned complex tissue, can be according to random two-dimensional point coordinate (x
0, y
0) inquire about rightly, find the corresponding two-dimensional points object of this coordinate fast:
1) at first,, calculates its corresponding graticule mesh sequence number (X according to its coordinate values like " coupling for the first time " process among Fig. 2
n, Y
n):
X
n
?= [(x
0
-Xmin)/Lx];
Xmin: be the coordinate minimum value of envelope rectangle directions X
Lx: be the length on the directions X of little rectangle graticule mesh;
Surplus rounding operation is removed in symbol [] expression;
Y
n
= [(y
0
-Ymin)/Ly];
Ymin: be the coordinate minimum value of envelope rectangle Y direction
Ly: be the length on the Y direction of little rectangle graticule mesh;
Surplus rounding operation is removed in symbol [] expression;
2) in this graticule mesh, carry out again like " coupling for the second time " process among Fig. 2: the two-dimensional points set pair with y-bend table structure storage organization in this graticule mesh is resembled the match search of comparing.If the data organization that in step 4, adopts the set container to carry out binary tree realizes that the searching algorithm that then can directly call the set container here can obtain corresponding result.
Step 6Algorithm finishes.
Claims (3)
1. the method that coordinate matees fast in the batch two-dimensional points data comprises the quick matching process that existing a large amount of two-dimensional points data is carried out complex tissue and coordinate, and concrete steps are following:
Step 1:For an existing batch two-dimensional coordinate point data; At first obtain the envelope rectangle at all two-dimensional points data places: two limits of this envelope rectangle are parallel to the X axle and the Y axle of coordinate axis respectively; Wherein the minimum value of X-direction (Xmin) is the minimum value of all point data X coordinates, and the maximal value of X-direction (Xmax) is the maximal value of all point data X coordinates; Same method obtains this and covers the coordinate range ((Ymin), (Ymax)) of the Y direction of rectangle, so obtains surrounding the envelope rectangle of all two-dimensional points data;
Step 2:Above-mentioned envelope rectangle is carried out graticule mesh along X-direction and Y direction according to fixing length and width decomposes, the little graticule mesh length and width after the decomposition be made as above-mentioned envelope rectangle long and wide 1/5 to 1/100;
Step 3:All point coordinate are assigned in each graticule mesh: promptly obtain each two-dimensional points (x, y) the little graticule mesh of " affiliated ", the pointer of the two-dimensional points that its institute of storage " comprises " in each little graticule mesh through coordinate Calculation; Adopt following computing formula can calculate the sequence number of its little rectangle graticule mesh that should submit oneself to: to establish graticule mesh sequence number on the directions X since 0, along the X positive dirction; Graticule mesh sequence number on the Y direction is since 0, along the Y positive dirction, then point coordinate (x, y) pairing graticule mesh sequence number is:
X
n=[(x-Xmin)/Lx]; Lx: be the length on the directions X of the little graticule mesh of rectangle; Surplus rounding operation is removed in symbol [] expression;
Y
n=[(y-Ymin)/Ly]; Ly: be the length on the Y direction of the little graticule mesh of rectangle; Surplus rounding operation is removed in symbol [] expression;
Pointer with current two-dimensional points object is saved in this little rectangular node (X then
n, Y
n) variable in (be about to this point " submit oneself to " in this little rectangle graticule mesh), according to the method all two-dimensional points objects are submitted oneself in its pairing little graticule mesh;
Step 4:Then, set the ranking criteria of two-dimensional points,, adopt binary tree structure to organize again the two-dimentional point set data object that is assigned in each little graticule mesh based on this criterion; Setting is based on the sort method of point coordinate: for two two-dimensional points, at first confirm " ordering " of coordinate points according to x coordinate size; If the x coordinate is identical, then further confirm " ordering " of coordinate points according to the size of y coordinate; If the y coordinate is also identical, then think these 2 identical (equating); So far accomplish the complex tissue to a large amount of two-dimensional points data, this process need carries out once;
Step 5:After existing two-dimensional points data in enormous quantities are carried out above-mentioned complex tissue, according to the coordinate (x of random two-dimensional point
0, y
0) inquire about rightly, find the corresponding two-dimensional points object of this coordinate fast:
At first, matching process for the first time is according to its coordinate values (x
0, y
0) calculate its corresponding graticule mesh sequence number (X
n, Y
n), confirm its place graticule mesh:
X
n
?= [(x
0
-Xmin)/Lx];
Xmin: be the coordinate minimum value of envelope rectangle directions X
Lx: be the length on the directions X of little rectangle graticule mesh;
Surplus rounding operation is removed in symbol [] expression;
Y
n
= [(y
0
-Ymin)/Ly];
Ymin: be the coordinate minimum value of envelope rectangle Y direction
Ly: be the length on the Y direction of the little graticule mesh of rectangle;
Surplus rounding operation is removed in symbol [] expression;
After confirming graticule mesh, in this little graticule mesh, carry out matching process for the second time: through current coordinate values (x
0, y
0), be stored in two-dimensional points set pair in this little graticule mesh match search of comparing in resembling with the y-bend table structure, obtain the pairing entity two-dimensional points of this coordinate object fast.
2. the method that coordinate matees fast in the batch two-dimensional points data according to claim 1; Wherein, In the step 4 the two-dimentional point set in each little graticule mesh being carried out binary tree by the setting ranking criteria organizes; Adopt the set container in the C++ STL to carry out, this set algorithm container has been realized the algorithm of organizing of binary tree data structure.
3. the method that coordinate matees fast in the batch two-dimensional points data according to claim 2, wherein, the second time of step 5, the searching algorithm that directly calls the set container promptly obtained corresponding result when mating.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210151482.1A CN102693296B (en) | 2012-05-16 | 2012-05-16 | Method for rapidly matching coordinates of mass two-dimension point data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210151482.1A CN102693296B (en) | 2012-05-16 | 2012-05-16 | Method for rapidly matching coordinates of mass two-dimension point data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102693296A true CN102693296A (en) | 2012-09-26 |
| CN102693296B CN102693296B (en) | 2014-07-30 |
Family
ID=46858730
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210151482.1A Expired - Fee Related CN102693296B (en) | 2012-05-16 | 2012-05-16 | Method for rapidly matching coordinates of mass two-dimension point data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102693296B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049296A (en) * | 2012-12-28 | 2013-04-17 | 北界创想（北京）软件有限公司 | Method and device for automatically matching target application for downloading equipment |
| CN103542857A (en) * | 2013-10-31 | 2014-01-29 | 银江股份有限公司 | Novel GPS (global positioning system) navigation map matching method |
| CN105824532A (en) * | 2016-03-16 | 2016-08-03 | 无锡科技职业学院 | Recognizing and hash locating method of rectangular graphs |
| CN105957142A (en) * | 2016-04-19 | 2016-09-21 | 南京师范大学 | Hilbert ordering method constructed for orienting to TIN |
| CN105957143A (en) * | 2016-04-19 | 2016-09-21 | 南京师范大学 | Morton ordering method constructed for orienting to TIN |
| CN106227781A (en) * | 2016-07-18 | 2016-12-14 | 中国农业大学 | The method for quickly retrieving of space one point data under big data |
| CN107273380A (en) * | 2016-04-08 | 2017-10-20 | 中国移动通信集团河南有限公司 | A kind of determination of aiming spot and data checking, device |
| CN108280203A (en) * | 2018-01-30 | 2018-07-13 | 中交天津港航勘察设计研究院有限公司 | A kind of storage method and storage system of water-depth measurement data |
| CN111159187A (en) * | 2019-12-27 | 2020-05-15 | 北京奇艺世纪科技有限公司 | Two-dimensional query method and device, terminal device and computer readable storage medium |
| CN116543040A (en) * | 2023-04-21 | 2023-08-04 | 成都飞机工业（集团）有限责任公司 | Aviation electric connector hole number identification method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6278949B1 (en) * | 1998-11-25 | 2001-08-21 | M. Aftab Alam | Method for multi-attribute identification of structure and stratigraphy in a volume of seismic data |
| CN101923542A (en) * | 2009-06-12 | 2010-12-22 | 如临其境创意(上海)有限公司 | MDDRQ-Tree index structure for network multidimensional space data expression |
| CN102147261A (en) * | 2010-12-22 | 2011-08-10 | 南昌睿行科技有限公司 | Method and system for map matching of transportation vehicle GPS (Global Position System) data |
| CN102230783A (en) * | 2011-05-04 | 2011-11-02 | 南京航空航天大学 | Three-dimensional grid precision compensation method for industrial robot |
-
2012
- 2012-05-16 CN CN201210151482.1A patent/CN102693296B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6278949B1 (en) * | 1998-11-25 | 2001-08-21 | M. Aftab Alam | Method for multi-attribute identification of structure and stratigraphy in a volume of seismic data |
| CN101923542A (en) * | 2009-06-12 | 2010-12-22 | 如临其境创意(上海)有限公司 | MDDRQ-Tree index structure for network multidimensional space data expression |
| CN102147261A (en) * | 2010-12-22 | 2011-08-10 | 南昌睿行科技有限公司 | Method and system for map matching of transportation vehicle GPS (Global Position System) data |
| CN102230783A (en) * | 2011-05-04 | 2011-11-02 | 南京航空航天大学 | Three-dimensional grid precision compensation method for industrial robot |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049296A (en) * | 2012-12-28 | 2013-04-17 | 北界创想（北京）软件有限公司 | Method and device for automatically matching target application for downloading equipment |
| CN103542857A (en) * | 2013-10-31 | 2014-01-29 | 银江股份有限公司 | Novel GPS (global positioning system) navigation map matching method |
| CN103542857B (en) * | 2013-10-31 | 2016-09-07 | 银江股份有限公司 | A kind of GPS navigation map-matching method |
| CN105824532A (en) * | 2016-03-16 | 2016-08-03 | 无锡科技职业学院 | Recognizing and hash locating method of rectangular graphs |
| CN107273380B (en) * | 2016-04-08 | 2020-04-21 | 中国移动通信集团河南有限公司 | Method and device for determining position of target point and checking data |
| CN107273380A (en) * | 2016-04-08 | 2017-10-20 | 中国移动通信集团河南有限公司 | A kind of determination of aiming spot and data checking, device |
| CN105957142A (en) * | 2016-04-19 | 2016-09-21 | 南京师范大学 | Hilbert ordering method constructed for orienting to TIN |
| CN105957143A (en) * | 2016-04-19 | 2016-09-21 | 南京师范大学 | Morton ordering method constructed for orienting to TIN |
| CN106227781A (en) * | 2016-07-18 | 2016-12-14 | 中国农业大学 | The method for quickly retrieving of space one point data under big data |
| CN106227781B (en) * | 2016-07-18 | 2019-08-23 | 中国农业大学 | The method for quickly retrieving of big data down space one point data |
| CN108280203A (en) * | 2018-01-30 | 2018-07-13 | 中交天津港航勘察设计研究院有限公司 | A kind of storage method and storage system of water-depth measurement data |
| CN111159187A (en) * | 2019-12-27 | 2020-05-15 | 北京奇艺世纪科技有限公司 | Two-dimensional query method and device, terminal device and computer readable storage medium |
| CN116543040A (en) * | 2023-04-21 | 2023-08-04 | 成都飞机工业（集团）有限责任公司 | Aviation electric connector hole number identification method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102693296B (en) | 2014-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102693296B (en) | Method for rapidly matching coordinates of mass two-dimension point data | |
| CN110197270A (en) | Integrated circuit chip device and Related product | |
| CN109165215A (en) | Construction method, device and the electronic equipment of temporal index under a kind of cloud environment | |
| CN107220285A (en) | Towards the temporal index construction method of magnanimity track point data | |
| CN104462222A (en) | Distributed storage method and system for checkpoint vehicle pass data | |
| CN102254024A (en) | Mass data processing system and method | |
| CN109190052B (en) | Spatial indexing method based on social perception in distributed environment | |
| CN105550368A (en) | Approximate nearest neighbor searching method and system of high dimensional data | |
| CN105760484B (en) | A kind of crowd tramples method for early warning, system and the server with the system | |
| Luo et al. | Multi-scale receptive field fusion network for lightweight image super-resolution | |
| CN102012908B (en) | Method for inquiring visible moving neighbours objects in environment with barriers | |
| Benjamini et al. | Recurrence of the Z^d-valued infinite snake via unimodularity | |
| Tang et al. | A hybrid index for multi-dimensional query in HBase | |
| Kong et al. | A comparative study of different granular structures induced from the information systems | |
| Danovaro et al. | Level-of-detail for data analysis and exploration: A historical overview and some new perspectives | |
| Eldawy et al. | The era of big spatial data: Challenges and opportunities | |
| CN102682123A (en) | Method for quickly matching coordinates in multitudinous three-dimensional point data | |
| CN110297952B (en) | Grid index-based parallelization high-speed railway survey data retrieval method | |
| CN108614889A (en) | Mobile object Continuous k-nearest Neighbor based on mixed Gauss model and system | |
| Saleem et al. | Scalable processing of location-based social networking queries | |
| Deng et al. | Hybrid invasive weed optimization algorithm for parameter inversion problems | |
| Farruque et al. | Efficient distributed spatial semijoins and their application in multiple-site queries | |
| CN109947563A (en) | A kind of parallel multilevel fast multipole tree construction compound storage method | |
| Bae et al. | Supporting range queries on web data using k-nearest neighbor search | |
| Wang | Betti Number for Point Sets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170330 Address after: 210032 Jiangsu City, Nanjing province high tech Development Zone, Spark Road, software building, No. 9, block A, layer 6 Patentee after: Nanjing Taiya Polytron Technologies Inc. Address before: 210044 Nanjing City, Pukou Province, Nanjing Road, No. 219, No. six, No. Patentee before: Nanjing University of Information Science and Technology |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140730 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |