Unlock instant, AI-driven research and patent intelligence for your innovation.
Algorithm for quickly calculating shortest path of regular hexagonal grid
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A regular hexagonal and shortest path technology, applied in the field of regular hexagonal grid computing, can solve problems that are not suitable for computing
Pending Publication Date: 2022-01-18
南京国科软件有限公司
View PDF0 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
And for the two examples we mentioned above, the number of regular hexagonal grids in their calculation area has reached 10 7 , obviously, it is not suitable to use the above two conventional algorithms for calculation
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0039] refer to figure 1 , an algorithm to quickly calculate the shortest path of a regular hexagonal grid, including the following steps:
[0040] S1: Establish a data model in the establishment module, and the established data model is a honeycomb regular hexagonal grid model based on mathematical statistical characteristics;
[0041] S2: Input a number of numerical values into the establishment module through the input module;
[0042] S3: Comparing values, judging odd and even numbers, and adding and subtracting operations through the judging unit;
[0043] S4: Determine the positions of the two regular hexagons, and index the positions of the two regular hexagons respectively (x 0 ,y 0 ) and (x, y), record k=0,1,2, ... represents any non-negative integer, so that the distance L of these two regular hexagons satisfies three algorithms;
[0044] S5: Substituting the two groups of position numbers into the formula to solve the calculation, the calculation step is divid...
Embodiment 2
[0050] The solution steps in step S5 are: the first step is to solve the left and right boundaries:
[0051] At this time, it is required to satisfy x=x 0 ±r.
[0052] When r is an even number, y=[(y 0 -0.5r):1:(y 0 +0.5r)];
[0053] When r is odd and x 0 When it is an odd number, y=[(y 0 -0.5(r+1)):1:(y 0 +0.5(r-1))];
[0054] When r is odd and x 0 When it is an even number, y=[(y 0 -0.5(r-1)):1:(y 0 +0.5(r+1))];
[0055] The second step is to solve the upper and lower boundary conditions:
[0056] cycle k=0:1:(r-1)
[0057] x=x 0 ±k
[0058] If k is even, then y 1 =y 0 -r+0.5k,y 2 =y 0 +r-0.5k;
[0059] If k is odd:
[0060] if x 0 is odd, then y 1 =y 0 -r+0.5(k-1),y 2 =y 0 +r-0.5(k+1);
[0061] if x 0 is even, then y 1 =y 0 -r+0.5(k+1),y 2 =y 0 +r-0.5(k-1).
Embodiment 3
[0063] When calculating the distance between two regular hexagons whose position numbers are (9, 9) and (13, 13) respectively.
[0064] Solution: If let x 0 =9, y0=9, then x=13, y=13. because|x-x 0 |=4 is an even number, so k=2 at this time. because y > y 0 +k=11, so the distance between two regular hexagons is L=y-y 0 +k=6.
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses an algorithm for quickly calculating the shortest path of a regular hexagon grid. The algorithm comprises the following steps: establishing a data model in an establishing module, wherein the established data model is a honeycomb regular hexagon grid-shaped model based on mathematical statistical characteristics; inputting a plurality of numerical values into the establishing module through the input module; comparing the numerical values through a judgment unit, and judging odd and even numbers and addition and subtraction operations; determining the positions of the two regular hexagons; recording position indexes (x0, y0) and (x, y) of the two regular hexagons as k = 0, 1, 2,..., and any non-negative integer is represented; enabling the distance L between the two regular hexagons to meet three algorithms, and substituting the two groups of position numbers into a formula for solving; dividing the calculation step into two steps, where the first step is to solve the left and right boundaries, the second step is to solve the upper and lower boundaries, and the distance between the two boundaries is solved.
Description
technical field [0001] The invention relates to the field of regular hexagonal grid calculations, in particular to an algorithm for quickly calculating the shortest path of regular hexagonal grids. Background technique [0002] In the fields of path planning, game design, wireless communication and biomedicine, calculating the shortest path between any two regular hexagons is an important research topic. For example, for a second-generation gene sequencer chip, there are 3600 rows and 3648 columns of regular hexagonal holes on the chip, and the shortest distance between any two regular hexagonal holes needs to be calculated. For another example, when designing a map of a wargame, the entire map area is divided into regular hexagonal unit areas with 2600 rows and 4700 columns, and the shortest distance between any two regular hexagonal unit areas needs to be calculated. [0003] At present, there are two commonly used algorithms for calculating the shortest path between any ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More