CN110456308B - Three-dimensional space positioning rapid searching method - Google Patents
Three-dimensional space positioning rapid searching method Download PDFInfo
- Publication number
- CN110456308B CN110456308B CN201910608453.5A CN201910608453A CN110456308B CN 110456308 B CN110456308 B CN 110456308B CN 201910608453 A CN201910608453 A CN 201910608453A CN 110456308 B CN110456308 B CN 110456308B
- Authority
- CN
- China
- Prior art keywords
- grid
- points
- adjacent
- dimensional space
- lattice
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/12—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves by co-ordinating position lines of different shape, e.g. hyperbolic, circular, elliptical or radial
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Length Measuring Devices With Unspecified Measuring Means (AREA)
- Length Measuring Devices By Optical Means (AREA)
Abstract
The invention discloses a three-dimensional space positioning rapid searching method. The method specifically comprises the following steps: in a space grid lattice which is formed by lines and rows in a three-dimensional space, the space position of each grid point is calibrated in advance, the coordinate is known, and the shape of a triangle formed by any three adjacent grid points is unique in the grid lattice; calculating the distances between each grid point and eight adjacent points around the grid point, and storing for later use; measuring coordinate values of any three adjacent points in the grid lattice in sequence and calculating three side lengths formed by the three points; and searching the distances from the grid points to the adjacent points in sequence, comparing the measured side lengths of the triangles, and after finding that the side lengths are consistent, sequentially comparing the next side length with the distances between the adjacent points of the grid points meeting the requirements and the peripheral points of the grid points until the three sides of the triangle are completely consistent with the triangle formed by the known three grid points, thereby completing the search. The invention is used for realizing the fast search of the space positioning by measuring the adjacent three points in the grid lattice of the known three-dimensional space.
Description
Technical Field
The invention relates to the field of space position quick search, in particular to a three-dimensional space positioning quick search method.
Background
Three-dimensional positioning can be completed through the space reference point coordinates, and measurement accuracy and data splicing are improved. In the measuring space, the control reference points are arranged, the coordinate positions of the control reference points are calibrated (measured in advance), and the measuring machine is used for measuring more than three reference points, so that the self positioning of the measuring machine can be realized. The method can greatly enlarge the measurement range and the measurement efficiency of the measuring machine and can ensure the measurement precision.
The Chinese patent ZL201410468636.9 discloses a large-size precise geometric dimension measuring system based on a measurement reference lattice, which comprises a measurement reference lattice, a space coordinate measuring device and a measuring system computer; the movable space coordinate measuring device determines the relative position of the measuring device in a measuring space by measuring three or more reference points on the periphery of the movable space coordinate measuring device, which are not on the same straight line, so that all measuring data obtained when the space coordinate measuring device measures a measured object can be converted into a uniform measuring space working coordinate system, the measuring range of the movable space coordinate measuring device is greatly expanded, meanwhile, the error accumulation caused by the traditional measuring methods such as leapfrogging is avoided, and the high-efficiency and high-precision large-size measurement is realized.
However, how to quickly find the corresponding measured reference point from the reference lattice directly affects the implementation and experience of the measurement method.
Disclosure of Invention
The invention aims to provide a three-dimensional space positioning quick searching method for solving the technical problem of quick searching.
The invention discloses a three-dimensional space positioning quick searching method, which comprises the following steps:
s1, in a space grid lattice formed by lines and rows in a three-dimensional space, the space position of each grid point is calibrated in advance, the coordinate is known, and the shape of a triangle formed by any three adjacent grid points is ensured to be unique in the grid lattice;
s2, calculating the distance between each grid point and eight adjacent points around the grid point, and storing for later use;
s3, sequentially measuring coordinate values of any three adjacent points in the grid lattice and calculating three side lengths formed by the three points;
s4, searching the distances between the grid points and the adjacent points in sequence, comparing the measured side lengths of the triangle, and after finding the side lengths are consistent, sequentially comparing the next side length and the distances between the adjacent points of the grid points meeting the requirements and the peripheral points thereof until the three sides of the triangle are completely consistent with the triangle formed by the known three grid points, thereby completing the search.
Further, in step S1, in the grid lattice formed by rows and columns in the three-dimensional space, the distance between adjacent rows or adjacent columns is a prime number with different size, the spatial coordinate of each grid point is known, and the shape of a triangle formed by any adjacent three grid points is unique in the grid lattice.
Further, in step S2, the eight neighboring points of each grid point and its periphery refer to the eight orientations of the grid point, such as up, down, left, right, up-right, down-right, up-left, down-left, and so on, and the distances between each grid point and its neighboring eight grid points are saved as the attributes of the grid point for backup.
Further, in step S3, when any three points in the grid lattice are measured, the measurement is performed in a predetermined order (clockwise or counterclockwise).
Further, in step S4, a search is performed in the order of measuring three sides of a triangle formed by measuring three points, and the search is performed in the same order as the measurement.
Further, in step S4, when the side lengths of the triangles are compared, and the difference is smaller than a preset allowable error, the triangles are determined to be consistent, so as to overcome the problem that theoretical consistency cannot be achieved due to measurement errors or grid lattice installation errors in actual application.
The invention has the following beneficial effects: the side length of the triangle formed by the grid dot matrix is pre-calculated when the grid dot matrix is installed and is pre-stored in a computer file, so that repeated calculation is avoided, the position of the triangle in the grid dot matrix can be measured only by comparing the side lengths, and the operation amount is greatly reduced. In addition, the grid row and column intervals adopt prime number units with different sizes, so that a triangle formed by any three adjacent points in the grid is ensured to be unique, the positioning of the three points in a grid lattice space is measured by the uniqueness, and the repeated calculation is reduced (when a completely matched triangle is obtained by searching, a result is obtained, and the searching is quitted). The algorithm can be used in an oversized measurement space based on a reference dot matrix, and self-positioning of a measuring machine is quickly realized by measuring three adjacent reference points, so that precise and quick measurement of the oversized can be realized.
The invention realizes fast search by referring to the distance between each grid point and adjacent points in the grid lattice and the comparison of the side length of a triangle formed by three adjacent points to be detected so as to confirm the serial numbers of the three points to be detected and the positions of the three points in the grid lattice.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
FIG. 1 is a schematic diagram of a triangle formed by three grid points to be measured;
FIG. 2 is a schematic diagram of a grid lattice and the side lengths of adjacent points in different size prime number unit intervals.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
As shown in fig. 1-2, a three-dimensional space positioning fast search method includes the following steps:
s1, in a space grid lattice formed by lines and rows in a three-dimensional space, the space position of each grid point is calibrated in advance, the coordinate is known, and the shape of a triangle formed by any three adjacent grid points is ensured to be unique in the grid lattice; the space coordinate of each grid point of a grid lattice formed by rows and columns in the three-dimensional space is known, and the distance between adjacent rows or adjacent columns is a prime number with different sizes, so that the shape of a triangle formed by any three adjacent grid points is unique in the grid lattice;
s2, calculating the distance between each grid point and eight adjacent points around the grid point, and storing for later use; the distances between each grid point and eight adjacent grid points are used as the attributes of the grid point to be saved for later use, wherein the eight adjacent points of each grid point and the periphery of the grid point refer to the eight orientations (shown in table 1) of the grid point, such as upper, lower, left, right, upper right, lower right, upper left, lower left and the like;
table 1: current grid point and eight neighbor points
| NW | N | NE |
| W | O | E |
| SW | S | SE |
Wherein: o (current point), E (east), SE (southeast), S (south), SW (southwest), W (west), NW (northwest), N (north), NE (northeast).
S3, sequentially measuring coordinate values of any three adjacent points in the grid lattice and calculating three side lengths formed by the three points; when measuring any three points in the grid lattice, the measurement is carried out according to the appointed sequence;
s4, searching the distances from the grid points to the adjacent points in sequence, comparing the measured side lengths of the triangle, and after finding that the side lengths are consistent, sequentially comparing the next side length with the distances between the adjacent points of the grid points meeting the requirements and the peripheral points thereof until the three sides of the triangle are completely consistent with the triangle formed by the known three grid points, thereby completing the search; and searching according to three measured sides of a triangle formed by three points, wherein the searching sequence is performed according to the same measuring sequence.
Claims (6)
1. A three-dimensional space positioning fast search method is characterized by comprising the following steps:
s1, in a space grid lattice formed by lines and rows in a three-dimensional space, the spatial point position of each grid is calibrated in advance, the coordinate is known, and the shape of a triangle formed by any three adjacent grid points is ensured to be unique in the grid lattice;
s2, calculating the distance between each grid point and eight adjacent points around the grid point, and storing for later use;
s3, sequentially measuring coordinate values of any three adjacent points in the grid lattice and calculating three side lengths formed by the three points;
s4, searching the distances between the grid points and the adjacent points in sequence, comparing the measured side lengths of the triangle, and after finding the side lengths are consistent, sequentially comparing the next side length and the distances between the adjacent points of the grid points meeting the requirements and the peripheral points thereof until the three sides of the triangle are completely consistent with the triangle formed by the known three grid points, thereby completing the search.
2. The three-dimensional space positioning fast search method as claimed in claim 1, wherein in step S1, the grid lattice formed by rows and columns in the three-dimensional space, the distance between adjacent rows or adjacent columns is a prime number with different size, the space coordinate of each grid point is known, and the shape of the triangle formed by any adjacent three grid points is unique in the grid lattice.
3. The three-dimensional space positioning fast search method as claimed in claim 1, wherein in step S2, the eight neighboring points of each grid point and its periphery refer to the eight orientations of the grid point, i.e. up, down, left, right, up-right, down-right, up-left, and down-left, and the distance between each grid point and its neighboring eight grid points is saved as the attribute of the grid point for standby.
4. The three-dimensional space positioning fast search method as claimed in claim 1, wherein in step S3, the measurement of any three points in the grid lattice is performed in a predetermined order.
5. The three-dimensional space positioning fast search method according to claim 1, wherein in step S4, the search is performed in the order of three sides of a triangle formed by three points measured, and the search is performed in the same order of the measurement.
6. The method as claimed in claim 5, wherein in step S4, when the side lengths of the triangles are compared, a certain error is allowed, that is, when the difference between the measured side length and the side length of the triangle formed by the pre-stored grid points is smaller than a preset running error value, the two are determined to be the same.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910608453.5A CN110456308B (en) | 2019-07-08 | 2019-07-08 | Three-dimensional space positioning rapid searching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910608453.5A CN110456308B (en) | 2019-07-08 | 2019-07-08 | Three-dimensional space positioning rapid searching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110456308A CN110456308A (en) | 2019-11-15 |
| CN110456308B true CN110456308B (en) | 2021-05-04 |
Family
ID=68482463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910608453.5A Active CN110456308B (en) | 2019-07-08 | 2019-07-08 | Three-dimensional space positioning rapid searching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110456308B (en) |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4692869A (en) * | 1985-03-28 | 1987-09-08 | The Boeing Company | Aircraft navigational systems and methods for creating navigational guidepoints |
| GB2395808A (en) * | 2002-11-27 | 2004-06-02 | Sony Uk Ltd | Information retrieval |
| CN101285878B (en) * | 2008-06-04 | 2011-09-07 | 中国海洋大学 | Wireless sensor network perpendicular intersection positioning algorithm |
| JP2015096809A (en) * | 2013-11-15 | 2015-05-21 | 日本電信電話株式会社 | Position calculation device, position calculation method and position calculation program |
| CN107003378B (en) * | 2014-11-07 | 2020-04-21 | 索尼公司 | Portable electronic device and method for determining geographical position of portable electronic device |
| CN105137393B (en) * | 2015-07-31 | 2017-08-01 | 石川 | A kind of space multisensor method for rapidly positioning for network |
| CN105894441A (en) * | 2015-12-29 | 2016-08-24 | 乐视云计算有限公司 | Image matching method and device |
| CN106778869A (en) * | 2016-12-16 | 2017-05-31 | 重庆邮电大学 | A kind of quick accurate nearest neighbour classification algorithm based on reference point |
| CN108243451B (en) * | 2016-12-27 | 2021-07-16 | ***通信集团辽宁有限公司 | Method and system for positioning in TD-LTE grid based on MR data |
| CN108536704B (en) * | 2017-03-02 | 2022-02-08 | 华为技术有限公司 | Track query method, system and device |
| CN107577720B (en) * | 2017-08-17 | 2020-10-02 | 中国矿业大学(北京) | Method for quickly querying point cloud data of underground roadway based on region tree |
| CN107833282B (en) * | 2017-11-16 | 2020-06-02 | 广东电网有限责任公司电力科学研究院 | Terrain modeling and grid generating method and device |
| CN109839921B (en) * | 2017-11-24 | 2022-03-18 | 中国电信股份有限公司 | Visual positioning navigation method and device and terminal |
| CN108829865B (en) * | 2018-06-22 | 2021-04-09 | 海信集团有限公司 | Information retrieval method and device |
| CN109035305B (en) * | 2018-08-10 | 2021-06-25 | 中北大学 | Indoor human body detection and tracking method based on RGB-D low-visual-angle condition |
| CN109738863A (en) * | 2019-04-08 | 2019-05-10 | 江西师范大学 | A kind of WiFi fingerprint indoor positioning algorithms and system merging confidence level |
-
2019
- 2019-07-08 CN CN201910608453.5A patent/CN110456308B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110456308A (en) | 2019-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103256916B (en) | Evaluation method of part flatness error based on minimum area | |
| CN102208108B (en) | Large-field high-precision quick field overall calibration method for camera | |
| CN103712557A (en) | Laser tracking multi-station positioning method for super-large gears | |
| CN110456308B (en) | Three-dimensional space positioning rapid searching method | |
| CN106584509B (en) | The origin calibration method of parallel robot | |
| CN111103768B (en) | Method for reducing poor focusing of wafer edge | |
| CN103308021A (en) | Method for measuring roundness error of workpiece | |
| CN112464322B (en) | Building component arrangement method and device, computer equipment and storage medium | |
| JP5916052B2 (en) | Alignment method | |
| CN110940271A (en) | Method for detecting, monitoring and intelligently carrying and installing large-scale industrial manufacturing of ships and the like based on space three-dimensional measurement and control network | |
| CN107885939B (en) | Method for improving monitoring precision of monitoring graph | |
| CN102841951B (en) | Three-dimensional safety surface sets up system and method | |
| CN104680016A (en) | Geometric optimization approximation based minimum region fitting method for profiles of parabolas | |
| CN112287496A (en) | Method, device and equipment for determining pipeline strain and stress | |
| CN103646885B (en) | A kind of method reducing electron microscope observation wafer defect error | |
| EP2866205A2 (en) | Three-dimensional model generation apparatus, three-dimensional model generation method, and program | |
| CN111402342B (en) | Multi-feature-point-based 3D point cloud processing method for industrial robot calibration | |
| CN110245202B (en) | Polar coordinate system target grid set solving method based on iterative proximity search | |
| CN113747342A (en) | Network monitoring method and device and computing equipment | |
| CN106643614B (en) | Range extender and measuring method and measuring system thereof | |
| CN116153800A (en) | Wafer defect positioning method | |
| CN103791791B (en) | A kind of step gauge and assemble method thereof | |
| CN111750831A (en) | Method for measuring inclination rate of cylinder | |
| CN110968656A (en) | Topographic map processing method and processing device | |
| CN103292674A (en) | Method for calculating function size of sphere part |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230511 Address after: 310000 b101-1, building 1, No.3, Taiji Road, Yuhang Economic and Technological Development Zone, Yuhang District, Hangzhou City, Zhejiang Province Patentee after: Hangzhou nengchuang Hi Tech Co.,Ltd. Patentee after: Guangxi Vocational&Technical Institute of Industry Address before: No. 37 Xiuling Road, Nanning City, Guangxi Zhuang Autonomous Region, 530000 Patentee before: Guangxi Vocational&Technical Institute of Industry Patentee before: GUILIN NENGCHUANG INFORMATION TECHNOLOGY Co.,Ltd. |