A kind of three dimension location method for fast searching
Technical field
The present invention relates to spatial position fast search field more particularly to a kind of three dimension location method for fast searching.
Background technique
Three-dimensional localization can be completed by spatial reference point coordinate, help improves measurement accuracy and data split.It is measuring
In space, (measurement in advance) is demarcated by arrangement control reference point and to its coordinate position, then measure three with measuring machine
The positioning to measuring machine itself can be achieved above with reference to point.This method not only can substantially expand the measurement range and survey of measuring machine
Amount efficiency, it can also be ensured that the precision of measurement.
It is several to disclose a kind of large scale precision based on witness mark battle array by Chinese invention patent ZL201410468636.9
What Size Measuring System comprising witness mark battle array, space coordinates measuring apparatus and measurement system computer;Movably
Space coordinates measuring apparatus has determined that measurement is set by three or more reference points not on the same line for measuring its periphery
The standby relative position in measurement space, and then all measurement numbers that space coordinates measuring apparatus can be measured testee when obtains
According to being transformed under unified measurement Space-Work coordinate system, substantially expand the measurement model of moveable space coordinates measuring apparatus
Enclose, while avoiding tradition and the measurement methods bring error accumulation such as leapfroging, realize efficiently, high-accuracy large-scale measurement.
But how corresponding tested reference point is quickly found from reference dot matrix, it will have a direct impact on this measurement side
The realization and experience of formula.
Summary of the invention
The present invention is to solve a kind of three dimension location method for fast searching is provided, for solving above-mentioned fast search
The technical issues of.
The invention discloses a kind of three dimension location method for fast searching comprising following steps:
In S1, the space lattice dot matrix in a three-dimensional space by ranks composition, the spatial position of each mesh point
Calibration in advance, coordinate are it is known that and ensure that the shape of the triangle of three mesh points of arbitrary neighborhood composition is only in the Mesh Point Battle
One;
S2, each mesh point is calculated at a distance from the consecutive points of eight, its periphery and is saved backup;
S3, the coordinate value of any three consecutive points and three sides that three points are constituted are calculated in examination network dot matrix in order
It is long;
The triangle side length that S4, the in order distance versus of dragnet lattice point to consecutive points measure, after discovery is consistent, by suitable
Ordered pair than the consecutive points of next side length and the mesh point met the requirements at a distance from its peripheral point, until three sides of a triangle
The completely the same i.e. completion search of triangle constituted with known three mesh points.
Further, in step S1, the Mesh Point Battle constituted in three-dimensional space by ranks, the spacing of adjacent rows or adjacent column
From for different size of prime number, the space coordinate of each mesh point is it is known that the triangle of three mesh points of arbitrary neighborhood composition
Shape is unique in the Mesh Point Battle.
Further, in step S2, each mesh point and eight, its periphery consecutive points refer to above-mentioned mesh point it is upper and lower,
Eight orientation such as left and right and upper right, bottom right, upper left, lower-left, the distance of each mesh point eight mesh points adjacent thereto, as
The attribute of the mesh point saves backup.
Further, (clockwise or inverse by agreement sequence when any three in examination network dot matrix in step S3
Hour hands) it carries out.
Further, it in step S4, is scanned for by the three sides of a triangle for measuring three points composition, search order is pressed
Same sequence is measured to carry out.
Further, in step S4, when doing triangle side length and comparing, when difference is less than preset allowable error, that is, sentence
Being set to unanimously, being overcome with this theoretic because cannot achieve caused by measurement error or the Mesh Point Battle installation error when practical application
Consistent problem.
The beneficial effects obtained by the present invention are as follows being: the triangle side length that the Mesh Point Battle is constituted is pre- when installing the Mesh Point Battle
It first calculates and is pre-stored in computer literal files, avoid and calculate repeatedly, only being compared by side length can complete to measure three
The angular position in the Mesh Point Battle, is greatly reduced operand.In addition, grid ranks interval uses different size of prime number list
Position, it is ensured that the triangle of three points of arbitrary neighborhood composition is unique in grid, realizes three points of measurement in grid with this uniqueness
Positioning in dot matrix space, reduce compute repeatedly simultaneously (when the triangle that search is exactly matched to get to result, exit
Search).The algorithm can be used in the measurement of the oversize based on reference dot matrix space, by measuring adjacent three reference points,
Positioning oneself for measuring machine is fast implemented, to realize the precision of oversize, rapid survey.
The present invention is by reference to the distance of mesh point and consecutive points each in the Mesh Point Battle, and tested three consecutive points constitute
Triangle side length comparison, realize number of the fast search to confirm tested three points and the position in the Mesh Point Battle.
Detailed description of the invention
Attached drawing is used to provide further understanding of the present invention, and constitutes part of specification, with reality of the invention
It applies example to be used to explain the present invention together, not be construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the triangle schematic diagram that tested three mesh points are constituted;
Fig. 2 is the side length schematic diagram of the Mesh Point Battle of prime number unit gap and consecutive points in different sizes.
Specific embodiment
Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings, it should be understood that preferred reality described herein
Apply example only for the purpose of illustrating and explaining the present invention and is not intended to limit the present invention.
As shown in Fig. 1~2, a kind of three dimension location method for fast searching comprising following steps:
In S1, the space lattice dot matrix in a three-dimensional space by ranks composition, the spatial position of each mesh point
Calibration in advance, coordinate are it is known that and ensure that the shape of the triangle of three mesh points of arbitrary neighborhood composition is only in the Mesh Point Battle
One;The space coordinate of each mesh point of the Mesh Point Battle constituted in three-dimensional space by ranks is known, adjacent rows or phase
Distance is different size of prime number between adjacent column, so that the shape of the triangle of three mesh points of arbitrary neighborhood composition is in mesh point
It is unique in battle array;
S2, each mesh point is calculated at a distance from the consecutive points of eight, its periphery and is saved backup;Each mesh point and its week
Eight, side consecutive points refer to eight orientation such as upper and lower, left and right and upper right, bottom right, upper left, lower-left of above-mentioned mesh point (1 institute of table
Show), the distance of each mesh point eight mesh points adjacent thereto, the attribute as the mesh point saves backup;
Table 1: current grid point and eight consecutive points
Wherein: O (current point), E (east), SE (southeast), S (south), SW (southwest), W (west), NW (northwest), N (north), NE
(northeast).
S3, the coordinate value of any three consecutive points and three sides that three points are constituted are calculated in examination network dot matrix in order
It is long;When any three in examination network dot matrix, carried out by agreement sequence;
The triangle side length that S4, the in order distance versus of dragnet lattice point to consecutive points measure, after discovery is consistent, by suitable
Ordered pair than the consecutive points of next side length and the mesh point met the requirements at a distance from its peripheral point, until three sides of a triangle
The completely the same i.e. completion search of triangle constituted with known three mesh points;By three of the triangle for measuring three points composition
While scanning for, search order is carried out by measurement same sequence.