CN115618078A - Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) - Google Patents
Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) Download PDFInfo
- Publication number
- CN115618078A CN115618078A CN202211461782.XA CN202211461782A CN115618078A CN 115618078 A CN115618078 A CN 115618078A CN 202211461782 A CN202211461782 A CN 202211461782A CN 115618078 A CN115618078 A CN 115618078A
- Authority
- CN
- China
- Prior art keywords
- retrieval
- hole site
- hole
- interval
- search
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000005192 partition Methods 0.000 claims description 3
- 238000000638 solvent extraction Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 12
- 238000004590 computer program Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000005553 drilling Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90348—Query processing by searching ordered data, e.g. alpha-numerically ordered data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method and a device for quickly indexing and retrieving hole position coordinate data of a PCB (printed circuit board), which are used for firstly obtaining the interval serial number of a retrieval interval where a pre-retrieval hole position is located according to the hole position serial number of the pre-retrieval hole position, then retrieving the pre-retrieval hole position in the retrieval interval corresponding to the interval serial number, and finally outputting the hole position coordinate data of the pre-retrieval hole position. When the pre-retrieval hole site is retrieved, the retrieval is firstly carried out from the retrieval area where the pre-retrieval hole site is located, so that the data volume of retrieval is greatly reduced, and the retrieval speed and the accuracy of the hole site coordinate data of the PCB are improved.
Description
Technical Field
The invention relates to the technical field of PCB detection, in particular to a quick indexing and searching method for hole position coordinate data of a PCB.
Background
With the development of the electronic information industry, the IC integration level is continuously increased, and the requirement for the refinement of the PCB is higher and higher. At present, the precision of the PCB board is developed to the level of 0.08mm of the minimum aperture, 0.1mm of the minimum hole spacing and even higher. The PCB is provided with a via hole, a part hole, a slotted hole, a special-shaped hole, a plate shape and the like. How to efficiently and accurately detect the drilling quality of the PCB becomes an important link for ensuring the product quality. In the prior art, the most common method for detecting massive hole site coordinate data on a PCB is a standard K-D tree-based detection method, but the K-D tree is adopted to require a tree-type data structure, and a linked list and a pointer are adopted, so that the method is relatively troublesome to realize in an embedded system and is easy to cause memory fragmentation.
Disclosure of Invention
The invention mainly solves the technical problem of how to quickly search and index mass hole site coordinate data on a PCB.
According to a first aspect, an embodiment provides a method for fast indexing and retrieving of hole site coordinate data of a PCB board, comprising:
acquiring the sequence number of a search interval in which a pre-search hole site is located according to the hole site number of the pre-search hole site;
searching the pre-retrieval hole position in the retrieval interval corresponding to the interval serial number;
outputting the hole site coordinate data of the pre-retrieval hole site; the hole site coordinate data comprises the interval serial number of a retrieval interval where the hole site is located, hole site abscissa, hole site ordinate and hole site number.
The method for acquiring the search interval comprises the following steps:
acquiring the number T of the retrieval intervals according to the total number L of all the pre-retrieval hole sites on the PCB;
setting a unique interval serial number for each retrieval interval;
dividing each hole site coordinate data of the pre-retrieval hole sites into one retrieval interval according to the hole site coordinate data of each pre-retrieval hole site; and the number of the pre-retrieval hole sites contained in each retrieval interval is not more than the number T of the retrieval intervals.
In an embodiment, the obtaining the number T of the search intervals according to the total number L of all the pre-search hole sites on the PCB includes:
acquiring the number T of the retrieval intervals according to an interval division formula; the interval division formula is a first division formula or a second division formula;
the first partition formula is:
T=L 1/2 ；
wherein, T is the number of the retrieval intervals, and L is the total number of the pre-retrieval hole sites;
the second division formula is:
T=floor[sqrt(L)];
wherein the floor function is rounded down, the sqrt function is a square root function, T is the number of the search intervals, and L is the total number of the pre-search hole sites.
In one embodiment, the dividing the hole site coordinate data of each pre-search hole site into one search interval includes:
establishing a histogram H (j) of coordinates j = 1., M according to a preset coordinate direction; m is the number of the retrieval intervals, and j is the interval serial number of the retrieval intervals;
setting a set S (j) of hole position coordinates corresponding to the preset coordinate direction; the set S (j) represents all pre-retrieval hole sites contained in the retrieval interval with the interval serial number j;
initializing H (j) to zero;
counting the coordinates of the preset coordinate directions of a plurality of pre-retrieval hole positions to be equal to j, and indexing the coordinates to S (j) so as to establish an index relationship between the histogram H (j) and the set S (j); wherein, N is the number of the pre-searching hole sites in the searching interval with the interval serial number j.
In one embodiment, the method for obtaining the histogram H (j) includes:
setting H (j) =0, S (j) = hot; wherein the hot represents an empty collection;
for the hole site number i = 1., L of the pre-search hole site, a number index formula S (j) is satisfied, the number index formula S (j) including:
H(X(i))=H(X(i))+1；
S(X(i)) =S(X(i))Ʋ{i}；
wherein, \ 434represents the combination of the sets, and the histogram H (j) is used for representing the number of the pre-search hole sites contained in the coordinate j, and the hole site numbers i containing the pre-search hole sites are all in the set S (j).
In one embodiment, the dividing the hole site coordinate data of each pre-search hole site into one search interval further includes:
divide M into k shares and initialize k to 1, i.e.:
z (1) =0, y (1) = brawn and means space;
for a coordinate j = 1.. Times, M established in a preset coordinate direction, a coordinate index formula Y (k) is satisfied, the coordinate index formula Y (k) being:
Z(k)<T；
Z(k)=Z(k)+H(j)；
Y(k)=Y(k)Ʋ{S(j)}；
wherein, v 434represents the merging of sets, Z (k) is used to represent an index of coordinates established in a preset coordinate direction, and the number of the pre-search holes included in each Z (k) is the number T of the search interval, so that the hole number of each pre-search hole exists in Y (k).
In an embodiment, the preset coordinate direction is a horizontal coordinate direction.
In an embodiment, the retrieving the pre-search hole location in the search interval corresponding to the interval serial number includes:
searching Z (k) hole position numbers in the search interval Y (k) corresponding to the interval serial numbers according to the hole position numbers of the pre-search hole positions;
and then, searching again according to the hole site vertical coordinate of the pre-searching hole site, thereby finding the coordinate closest to the pre-searching hole site to complete the whole search.
According to a second aspect, an embodiment provides a fast indexing and retrieving apparatus for PCB board hole position coordinate data, which is used for indexing and retrieving PCB board hole position coordinate data by applying the fast indexing and retrieving method as described above, and the fast indexing and retrieving apparatus includes:
the interval serial number acquisition module is used for acquiring the interval serial number of the retrieval interval in which the pre-retrieval hole site is located according to the hole site number of the pre-retrieval hole site;
the retrieval module is used for retrieving the pre-retrieval hole position in the retrieval interval corresponding to the interval sequence number;
the output module is used for outputting the hole site coordinate data of the pre-retrieval hole site; the hole site coordinate data comprises the interval serial number of a retrieval interval where the hole site is located, hole site abscissa, hole site ordinate and hole site number.
In one embodiment, the fast indexing and retrieval apparatus further comprises a display module; and the display module is used for displaying the hole site coordinate data of the pre-retrieval hole site.
According to a third aspect, an embodiment provides a computer-readable storage medium comprising a program executable by a processor to implement the fast indexing and retrieval method according to the first aspect.
According to the quick indexing and retrieval method of the embodiment, since the pre-retrieval hole site is retrieved from the retrieval area where the pre-retrieval hole site is located when the pre-retrieval hole site is retrieved, the data volume of retrieval is greatly reduced, and the retrieval speed and the accuracy of the hole site coordinate data of the PCB are improved.
Drawings
FIG. 1 is a schematic flow chart diagram of a fast indexing and retrieval method in one embodiment;
FIG. 2 is a flowchart illustrating a retrieval interval obtaining method according to an embodiment;
FIG. 3 is a schematic diagram illustrating structural connections of the fast index and retrieval apparatus in one embodiment.
Detailed Description
The present invention will be described in further detail with reference to the following detailed description and accompanying drawings. Wherein like elements in different embodiments are numbered with like associated elements. In the following description, numerous details are set forth in order to provide a better understanding of the present application. However, those skilled in the art will readily recognize that some of the features may be omitted or replaced with other elements, materials, methods in different instances. In some instances, certain operations related to the present application have not been shown or described in this specification in order not to obscure the core of the present application with unnecessary detail, and it is not necessary for those skilled in the art to describe these operations in detail, so that they may be fully understood from the description in the specification and the general knowledge in the art.
Furthermore, the features, operations, or characteristics described in the specification may be combined in any suitable manner to form various embodiments. Also, the various steps or actions in the description of the methods may be transposed or transposed in order, as will be apparent to a person skilled in the art. Thus, the various sequences in the specification and drawings are for the purpose of describing certain embodiments only and are not intended to imply a required sequence unless otherwise indicated where such sequence must be followed.
The ordinal numbers used herein for the components, such as "first," "second," etc., are used merely to distinguish between the objects described, and do not have any sequential or technical meaning. The term "connected" and "coupled" when used in this application, unless otherwise indicated, includes both direct and indirect connections (couplings).
In the embodiment of the application, a method for quickly indexing and retrieving hole site coordinate data of a PCB is disclosed, which is used for quickly indexing and retrieving massive hole site coordinate data with only two dimensions.
Example one
Referring to fig. 1, a schematic flow chart of an embodiment of a fast indexing and retrieving method for fast indexing and retrieving hole site coordinate data on a PCB is shown, where the fast indexing and retrieving method includes:
And acquiring the interval serial number of the search interval of the pre-search hole site according to the hole site number of the pre-search hole site. Wherein, the hole position number of the pre-retrieval hole position is calibrated in advance.
Referring to fig. 2, a flowchart illustrating an embodiment of a method for acquiring a search interval is shown, the method for acquiring a search interval includes:
in step 1011, the number of search intervals is obtained.
And acquiring the number T of the retrieval intervals according to the total number L of all the pre-retrieval hole sites on the PCB. In one embodiment, the number T of the retrieval intervals is obtained according to an interval division formula, wherein the interval division formula is a first division formula or a second division formula.
The first partition formula is:
T=L 1/2 ；
wherein T is the number of the retrieval intervals, and L is the total number of the pre-retrieval hole sites.
The second division formula is:
T=floor[sqrt(L)];
wherein the floor function is rounded down, the sqrt function is a square root function, T is the number of the search intervals, and L is the total number of the pre-search hole sites.
A unique section number is set for each search section.
And 1013, dividing all the pre-retrieval hole sites.
And dividing the hole site coordinate data of each pre-retrieval hole site into a retrieval interval according to the hole site coordinate data, wherein the number of the pre-retrieval hole sites contained in each retrieval interval is not more than the number T of the retrieval intervals, and the hole site coordinate data comprises the interval serial number, the hole site abscissa, the hole site ordinate and the hole site number of the retrieval interval in which the hole site is located.
In one embodiment, the method for dividing the search interval of the pre-search hole site includes:
firstly, establishing a histogram H (j) of coordinates j =1, a.and M according to a preset coordinate direction, wherein M is the number of retrieval intervals, and j is the interval serial number of the retrieval intervals; then, a set S (j) of hole site coordinates is arranged corresponding to the preset coordinate direction, and the set S (j) represents all pre-retrieval hole sites contained in a retrieval interval with the interval serial number j; and initializing H (j) to zero, counting the hole site number i =1, and.
In one embodiment, the method for obtaining the histogram H (j) includes:
setting H (j) =0, S (j) = Browning; wherein, browning represents an empty set;
for the hole site numbers i =1,.. And L of the pre-search hole sites, a number index formula S (j) is satisfied, and the number index formula S (j) includes:
H(X(i))=H(X(i))+1；
S(X(i)) =S(X(i))Ʋ{i}；
wherein, \ 434represents the combination of the sets, and the histogram H (j) is used for representing the number of the pre-search hole sites contained in the coordinate j, and the hole site numbers i containing the pre-search hole sites are all in the set S (j).
The hole site numbers of each pre-search hole site can be divided into the set S (j) only by circularly calculating the number index formula S (j).
M is then divided into k shares and k is initialized to 1, i.e.:
z (1) =0, y (1) = hot, representing an empty collection;
for a coordinate j = 1.. Times, M established in a preset coordinate direction, a coordinate index formula Y (k) is satisfied, the coordinate index formula Y (k) being:
Z(k)<T；
Z(k)=Z(k)+H(j)；
Y(k)=Y(k)Ʋ{S(j)}；
wherein, \ 434represents the combination of sets, Z (k) is used for representing the index of the coordinates established in the preset coordinate direction, and the number of the pre-retrieval hole sites contained in each Z (k) is the number T of the retrieval intervals. The hole site number of each pre-search hole site can be stored in Y (k) only by circularly calculating the coordinate index formula Y (k).
And 102, searching in the search interval.
And searching the pre-search hole positions in the search intervals corresponding to the interval numbers. The retrieval mode is described by taking the preset coordinate direction as the abscissa direction as an example:
the hole site number of Z (k) is searched in the search interval Y (k) corresponding to the interval serial number according to the hole site number of the pre-search hole site, and then the hole site is searched again according to the hole site vertical coordinate of the pre-search hole site, so that the coordinate closest to the pre-search hole site is found, and the whole search is completed.
And step 103, outputting hole position coordinate data.
And outputting hole site coordinate data of the pre-retrieval hole site, wherein the hole site coordinate data comprises a sequence number of a retrieval interval of the hole site, a hole site abscissa, a hole site ordinate and a hole site number.
The theoretical basis of the rapid indexing and retrieval method disclosed by the application is as follows:
first, for a two-dimensional vector (array) { X (i), Y (i): i = 1. Since various parameters of the PCB are pixelized during measurement, that is, X (i), Y (i) can be considered as integers, let M be the largest abscissa and N be the largest ordinate of the PCB in the measurement system. The present application achieves the goal of dividing all null coordinates roughly on the horizontal axis into T = Sqrt (M) periods, each containing approximately T null data, so that the total equals approximately T × T = M. Dividing the total number of L (typically tens of thousands to millions) of coordinate data into T = L in abscissa (or ordinate) 1/2 Or T = sqrt (L) search sections, the coordinate data of each search section is substantially equal to T, and T is an integer, i.e., T = floor (sqrt (L)), so that the abscissa of a pre-search hole to be searched for can be searched for to see which search section it is located in, and then the ordinate of the pre-search hole is searched for in this search section, thereby completing the search. For example, taking the coordinate data of 100 ten thousand holes on the PCB as an example, the above-mentioned fast indexing and retrieving method is used, which only needs 1000 times to searchThe abscissa searches the ordinate 1000 times at most, the total search times are reduced from 100 ten thousand times to 2000 times, the retrieval times are greatly reduced, and the retrieval process is greatly accelerated. If there are 30 ten thousand holes on the PCB, the number of times of retrieval is only about 1200.
Please refer to fig. 3, which is a schematic structural connection diagram of a fast indexing and retrieving apparatus in an embodiment, and in an embodiment of the present application, a fast indexing and retrieving apparatus is further disclosed, which is used for indexing and retrieving the hole position coordinate data of the PCB by applying the fast indexing and retrieving method described above, and the fast indexing and retrieving apparatus includes an interval serial number obtaining module 10, a retrieving module 20, and an output module 30. The interval serial number obtaining module 10 is configured to obtain an interval serial number of a search interval where the pre-search hole is located according to the hole site number of the pre-search hole site. The retrieving module 20 is configured to retrieve a pre-retrieval hole location in a retrieval interval corresponding to the interval serial number. The output module 30 is configured to output hole site coordinate data of the pre-search hole site, where the hole site coordinate data includes a sequence number of a search interval where the hole site is located, a hole site abscissa, a hole site ordinate, and a hole site number.
In one embodiment, the fast indexing and retrieval apparatus further comprises a display module 40. The display module 40 is used for displaying the hole site coordinate data of the pre-search hole site.
The quick indexing and retrieval method disclosed in the embodiment of the application includes the steps of firstly obtaining the section serial number of a retrieval section where a pre-retrieval hole site is located according to the hole site serial number of the pre-retrieval hole site, then retrieving the pre-retrieval hole site in the retrieval section corresponding to the section serial number, and finally outputting hole site coordinate data of the pre-retrieval hole site. When the pre-retrieval hole site is retrieved, the retrieval is firstly carried out from the retrieval area where the pre-retrieval hole site is located, so that the data volume of retrieval is greatly reduced, and the retrieval speed and the accuracy of the hole site coordinate data of the PCB are improved.
Those skilled in the art will appreciate that all or part of the functions of the methods in the above embodiments may be implemented by hardware, or may be implemented by a computer program. When all or part of the functions of the above embodiments are implemented by a computer program, the program may be stored in a computer-readable storage medium, and the storage medium may include: a read only memory, a random access memory, a magnetic disk, an optical disk, a hard disk, etc., and the program is executed by a computer to realize the above functions. For example, the program may be stored in a memory of the device, and when the program in the memory is executed by the controller, all or part of the functions described above may be implemented. In addition, when all or part of the functions in the above embodiments are implemented by a computer program, the program may be stored in a storage medium such as a server, another computer, a magnetic disk, an optical disk, a flash disk, or a portable hard disk, and may be downloaded or copied to a memory of a local device, or may be version-updated in a system of the local device, and when the program in the memory is executed by a controller, all or part of the functions in the above embodiments may be implemented.
The present invention has been described in terms of specific examples, which are provided to aid in understanding the invention and are not intended to be limiting. Numerous simple deductions, modifications or substitutions may also be made by those skilled in the art in light of the present teachings.
Claims (10)
1. A method for rapidly indexing and retrieving hole position coordinate data of a PCB is characterized by comprising the following steps:
acquiring the sequence number of a search interval in which a pre-search hole site is located according to the hole site number of the pre-search hole site;
searching the pre-retrieval hole position in the retrieval interval corresponding to the interval serial number;
outputting the hole site coordinate data of the pre-retrieval hole site; the hole site coordinate data comprise an interval serial number, a hole site abscissa, a hole site ordinate and a hole site number of a retrieval interval in which the hole site is located;
the method for acquiring the search interval comprises the following steps:
acquiring the number T of the retrieval intervals according to the total number L of all the pre-retrieval hole sites on the PCB;
setting a unique interval serial number for each retrieval interval;
dividing each hole site coordinate data of the pre-retrieval hole sites into one retrieval interval according to the hole site coordinate data of each pre-retrieval hole site; and the number of the pre-retrieval hole sites contained in each retrieval interval is not more than the number T of the retrieval intervals.
2. The rapid indexing and retrieval method of claim 1, wherein the obtaining the number T of the retrieval regions according to the total number L of all pre-retrieval hole sites on the PCB comprises:
acquiring the number T of the retrieval intervals according to an interval division formula; the interval division formula is a first division formula or a second division formula;
the first partition formula is:
T=L 1/2 ；
wherein, T is the number of the retrieval intervals, and L is the total number of the pre-retrieval hole sites;
the second division formula is:
T=floor[sqrt(L)]；
wherein the floor function is rounded down, the sqrt function is a square root function, T is the number of the search intervals, and L is the total number of the pre-search hole sites.
3. The rapid indexing and retrieval method of claim 2, wherein the dividing of the hole site coordinate data of each of the pre-search holes into one of the search intervals comprises:
establishing a histogram H (j) of coordinates j = 1., M according to a preset coordinate direction; m is the number of the retrieval intervals, and j is the interval serial number of the retrieval intervals;
setting a set S (j) of hole position coordinates corresponding to the preset coordinate direction; the set S (j) represents all pre-retrieval hole sites contained in the retrieval interval with the interval serial number j;
initializing H (j) to zero;
counting the hole site number i = 1.. Times.N of a plurality of pre-retrieval hole sites, wherein the coordinate in the preset coordinate direction is equal to j, and indexing the coordinate to S (j) so as to establish an index relation between the histogram H (j) and the set S (j); wherein N is the number of pre-search hole sites in the search interval with interval sequence number j.
4. The fast indexing and retrieval method of claim 3, wherein the histogram H (j) is obtained by a method comprising:
setting H (j) =0, S (j) = Browning; wherein the hot represents an empty collection;
for the hole site number i = 1.. And L of the pre-search hole site, a number index formula S (j) is satisfied, and the number index formula S (j) includes:
H(X(i))=H(X(i))+1；
S(X(i)) =S(X(i))Ʋ{i}；
wherein, \ 434represents the combination of the sets, and the histogram H (j) is used for representing the number of the pre-search hole sites contained in the coordinate j, and the hole site numbers i containing the pre-search hole sites are all in the set S (j).
5. The rapid indexing and retrieval method of claim 4, wherein the partitioning of the hole site coordinate data for each of the pre-search holes into one of the search intervals further comprises:
divide M into k parts and initialize k to 1, i.e.:
z (1) =0, y (1) = hot, representing an empty collection;
for a coordinate j = 1.. Times, M established in a preset coordinate direction, a coordinate index formula Y (k) is satisfied, the coordinate index formula Y (k) being:
Z(k)<T；
Z(k)=Z(k)+H(j)；
Y(k)=Y(k)Ʋ{S(j)}；
wherein, v 434represents the merging of sets, Z (k) is used to represent an index of coordinates established in a preset coordinate direction, and the number of the pre-search holes included in each Z (k) is the number T of the search interval, so that the hole number of each pre-search hole exists in Y (k).
6. The rapid indexing and retrieval method of claim 5, wherein the predetermined coordinate direction is an abscissa direction.
7. The fast indexing and retrieval method of claim 6, wherein the retrieving the pre-search hole site in the search interval corresponding to the interval sequence number comprises:
searching a hole position number Z (k) in the search interval Y (k) corresponding to the interval serial number according to the hole position number of the pre-search hole position;
and then, searching again according to the hole site vertical coordinate of the pre-searching hole site, thereby finding the coordinate closest to the pre-searching hole site to complete the whole search.
8. A computer-readable storage medium characterized by comprising a program executable by a processor to implement the fast indexing and retrieval method as claimed in claim 1 or 7.
9. A fast indexing and retrieving device for PCB hole site coordinate data, for indexing and retrieving PCB hole site coordinate data by applying the fast indexing and retrieving method as claimed in any one of claims 1 to 7, the fast indexing and retrieving device comprising:
the interval serial number acquisition module is used for acquiring the interval serial number of the retrieval interval in which the pre-retrieval hole site is located according to the hole site number of the pre-retrieval hole site;
the retrieval module is used for retrieving the pre-retrieval hole position in the retrieval interval corresponding to the interval serial number;
the output module is used for outputting the hole site coordinate data of the pre-retrieval hole site; the hole site coordinate data comprise interval serial numbers, hole site horizontal coordinates, hole site vertical coordinates and hole site numbers of retrieval intervals of hole sites.
10. The fast indexing and retrieval device of claim 9, further comprising a display module; the display module is used for displaying the hole site coordinate data of the pre-retrieval hole site.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211461782.XA CN115618078A (en) | 2022-11-17 | 2022-11-17 | Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211461782.XA CN115618078A (en) | 2022-11-17 | 2022-11-17 | Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115618078A true CN115618078A (en) | 2023-01-17 |
Family
ID=84879327
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211461782.XA Pending CN115618078A (en) | 2022-11-17 | 2022-11-17 | Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115618078A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000301403A (en) * | 1999-04-19 | 2000-10-31 | Sekisui House Ltd | Method for retrieving hole drilling program and method for presenting hole drilling program |
| CN106407213A (en) * | 2015-07-31 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Geographic position-based information retrieval method, device and system |
| CN109063194A (en) * | 2018-08-30 | 2018-12-21 | 广东南方数码科技股份有限公司 | Data retrieval method and device based on space encoding |
| CN110293567A (en) * | 2019-05-21 | 2019-10-01 | 南京理学工程数据技术有限公司 | A kind of method and system positioning and access test tube based on coordinate-system |
| CN111813875A (en) * | 2019-04-11 | 2020-10-23 | 浙江宇视科技有限公司 | Map point location information processing method and device and server |
-
2022
- 2022-11-17 CN CN202211461782.XA patent/CN115618078A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000301403A (en) * | 1999-04-19 | 2000-10-31 | Sekisui House Ltd | Method for retrieving hole drilling program and method for presenting hole drilling program |
| CN106407213A (en) * | 2015-07-31 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Geographic position-based information retrieval method, device and system |
| CN109063194A (en) * | 2018-08-30 | 2018-12-21 | 广东南方数码科技股份有限公司 | Data retrieval method and device based on space encoding |
| CN111813875A (en) * | 2019-04-11 | 2020-10-23 | 浙江宇视科技有限公司 | Map point location information processing method and device and server |
| CN110293567A (en) * | 2019-05-21 | 2019-10-01 | 南京理学工程数据技术有限公司 | A kind of method and system positioning and access test tube based on coordinate-system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2012261715B2 (en) | Method, apparatus and system for generating a feature vector | |
| CN101685541A (en) | Image processing apparatus and image processing method | |
| CN106776763B (en) | Destination searching method and device | |
| US20120269432A1 (en) | Image retrieval using spatial bag-of-features | |
| CN111832264B (en) | Signature position determining method, device and equipment based on PDF (portable document format) file | |
| EP2765520A1 (en) | Similarity detection device and directional nearest neighbor method | |
| Theoharatos et al. | A generic scheme for color image retrieval based on the multivariate Wald-Wolfowitz test | |
| CN105989001A (en) | Image searching method and device, and image searching system | |
| CN115618078A (en) | Method and device for rapidly indexing and retrieving hole position coordinate data of PCB (printed circuit board) | |
| CN108427110A (en) | Distance measuring method, device and electronic equipment | |
| CN116226515B (en) | Search result ordering method and device, electronic equipment and storage medium | |
| CN115129915A (en) | Repeated image retrieval method, device, equipment and storage medium | |
| AU2021329818B2 (en) | Techniques for data-enabled drug discovery | |
| CN116016692A (en) | Protocol description text construction method, device, equipment and storage medium | |
| CN104933705B (en) | A kind of space-time loop data structure carries out the method and device of slot detection | |
| CN110824559B (en) | Method and device for generating co-coordinate point gather and computer-readable storage medium | |
| CN101996202A (en) | System and method for quickly searching data according to key words | |
| Georgiadis et al. | Skyline-based dissimilarity of images | |
| CN114896363B (en) | Data management method, device, equipment and medium | |
| CN112699253B (en) | Source code positioning method, system, medium and device | |
| CN117591630B (en) | Keyword recognition method, device and equipment | |
| CN116383449B (en) | CRUD data sequence implementation method, system and equipment based on linked list | |
| CN114545500B (en) | Method and device for determining wave velocity distribution information | |
| US20160246920A1 (en) | Systems and methods of improved molecule screening | |
| Vyverman et al. | Fast and Accurate cDNA Mapping and Splice Site Identification. |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230117 |
|
| RJ01 | Rejection of invention patent application after publication |