JPS60239876A - Method for retrieving specific divided area out of wide range pattern area - Google Patents

Abstract

PURPOSE:To retrieve a required specific divided area by drawing 4<n> square mesh divided areas in a wide range pattern area on the basis of hexadecimal numbers and repeating the limitation of areas in accordance with proposed hexadecimal access codes. CONSTITUTION:A specific area is equally divided into four parts respectively in the vertical and horizontal directions to form sixteen large-scale divided areas and hexadecimal numbers consisting of divided area specifying codes ''0''-''F'' are assigned to respective areas. Each large-scale divided area is equally divided into four parts respectively in the vertical and horizontal directions to form sixteen medium-scale divided are as and hexadecimal numbers consisting of the divided area specifying codes ''0''-''F'' are assigned to respective areas. Each medium-scale divided area is equally divided into four parts respectively in the vertical and horizontal directions to form sixteen small- scale divided areas and hexadecimal numbers consistinf of the divided area specifying codes ''0''-''F'' are assigned to respective areas. Since 16 hexadecimal mesh code tables are prepared, 65, 536 small-scale divided areas are formed in the whole divided areas. Since main points on a map are stored in a memory of a CPU as hexadecimal codes, an answer for the question of a point is obtained as a hexadecimal code.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a method of searching for a specific divided area from a wide range of pattern areas. A desired sub-division area is searched for by repeating area limitation from a large-division area to a small-division area using a specific small-area pattern from a wide-range pattern area consisting of a set of area patterns. The present invention relates to a method of searching for a specific divided area.

[Prior Art] When searching for specific information from a large amount of information sources, it is generally not done to index using symbols, etc. attached in advance to each piece of information within a minimum range based on a specific idea. It is.

For example, like a map, the desired location is indexed from the surface of the map using a single square obtained by dividing the latitude and longitude directions into n equal parts as the minimum range. Since the area was simply divided into n equal parts, it was not possible to create an index that subdivided the region, and due to the relationship with the scale, it was not possible to create a fine-grained and detailed index.

[Object of the Invention] The purpose of the present invention is to eliminate the above-mentioned drawbacks, and its feature is that 4n patterns are formed within a wide pattern area consisting of a set of many small area patterns such as figures, characters, symbols, etc. (n is a positive integer of 2 or more) rectangular mesh division areas are drawn corresponding to a predetermined mesh division level based on a hexadecimal value, and the mesh division level is drawn in accordance with a scheduled hexadecimal call code. The wide pattern area is characterized in that a desired specific divided area is searched from the wide range of pattern areas by repeating area limitation from a mesh divided area at an upper level to a divided area at a lower level. This provides a method for searching for a specific divided area.

[Summary of the Invention] The basic concepts of a hexadecimal mesh, a hexadecimal mesh code, a quaternary mesh, and a quaternary mesh code for carrying out the search method of the present invention will be described.

The basic concept of this invention is to divide a specific area into four equal parts vertically and horizontally, forming a total of 16 large-scale divided areas, as shown in FIG. 9
” and assign hexadecimal numbers rAJ to rFJ. Next, each large-scale divided area is divided into four equal parts vertically and horizontally to form 16 medium-sized divided areas, which are assigned divided area designation codes "0" to "9" rAJ to rFJ in the same manner as described above. Assign a hexadecimal number.

Furthermore, each medium-sized divided area is divided into four equal parts vertically and horizontally to form 16 small-scale divided areas, which are assigned divided area designation codes "0" to "9" and rAJ to rF in the same manner as described above.
Assign the hexadecimal number of J. By preparing 16 hexadecimal mesh code tables 016 in this way, 1
16X16X16X16-65 for all 6 divided areas
．． 536 small-scale (unit) division areas are formed. Therefore, the division area designation codes “0” to “9” and rAJ to
The very large-scale divided areas GO to QF written in each full-width space to which the hexadecimal number rFJ is assigned have small-scale divided areas to which divided area designation codes rOJ to rFFFFJ are respectively assigned.

In this way, the divided areas in units of 16 are defined as hexadecimal mesh 16M1 and the divided area designation code as hexadecimal mesh code 16MC.

Next, as an example of dividing into 4 instead of 16 as described above, the super large hexadecimal mesh divided into 42 as described above is divided into 22, in other words, the large scale hexadecimal mesh is divided into 16 as described above. The specific divided area (very large-scale divided area) is divided into extremely large-scale divided areas as shown in Fig. 2 by grouping four large-scale hexadecimal meshes in each of the above-mentioned Fig. 1, and the divided area designation code "0 ”~4 of “3”
Assign a base number. Next, the area is divided into large-scale divided areas each having 16 large-scale hexadecimal meshes, and a quaternary number of divided area designation codes "O" to "3" is assigned to each large-scale divided area. Similarly, next medium size 1 with 16 small hex meshes.
Divide the hexadecimal meshes into four large medium-sized division areas and assign them the quaternary number of the division area designation code "Ocol" 3.Next, 16 medium-sized hexadecimal meshes are divided into large and medium-sized division areas. The area is divided into medium-sized divided areas, and a quaternary number of divided area designation codes rOJ to "3" is assigned to these areas. Next, divide the 16 small-scale hexadecimal meshes into four medium-sized division areas, and add the division area designation code rOJ to "
Assign a quaternary number of 3.

Furthermore, it is divided into small-scale division areas with 16 small-scale hexadecimal meshes as a unit, and the division area designation]-does "O" to "
Assign a quaternary number of 3. By preparing 16 such quaternary mesh code tables 04, 4x4x4x4x4x4x16=65,536 small-scale (unit) divided areas are formed in the specific divided area. Therefore, the divided area designation code rOJ~[3333-3333J will have small-scale subdivisions allocated to them. In this way, a divided area in units of four is defined as a quaternary mesh 4M1 and a divided area designation code as a quaternary mesh code 4MC.

In this way, there are divided areas in units of 16 and divided areas in units of 4, in other words, hexadecimal meshes in units of 16, hexadecimal mesh codes (addresses) that specify the divided areas in 1ρ base, and 4. It is used as a quaternary mesh code (address) that specifies a divided area using a quaternary mesh and a quaternary number.

The following table is a conversion table between the hexadecimal code and the quaternary code that mediates the binary values of the hexadecimal mesh code that specifies the divided areas in hexadecimal numbers and the quaternary mesh code that specifies the divided areas in quaternary numbers. .

Table 168C (2) 48C168C (2) 48C000
00008100020 10001019100121 2001002A 1010 22 3 0011 03 B 1011 234 0100
10 C110030 5010111D 1101 31 6 0110 12 E 1110 327 0111
13 F 1111 3316M0 = Hexadecimal mesh code 4MC = Quaternary mesh code (2) = Binary number or higher This invention has the following functions: (1) 16 meshes can be equally divided into 4 bits: 2 bits on the X axis and 2 bits on the Y axis. The basic unit is 1 of the 4-bit multiple.
Construct a hexadecimal mesh.

A mesh code (address) is assigned in hexadecimal to each divided area divided into f2116.

[A quaternary mesh code is assigned in quaternary number to each divided area divided into 3116 sections.

(4) Quaternary mesh code ○ to 3 are binary numbers, ie, O is "OO", 1 is "01", 2 is "1o", 3 is "11"
It is displayed as follows.

(5) Of the two bits of the code specifying the divided area, the upper bit represents the line segment on the X axis, and the lower bit represents the line segment on the Y axis.

(6) Set the origin of mesh coordinates to Ooo.

(7) When the mesh level is set to 0 level as a whole, the mesh that can be divided by 2 bits of X and Y is set to level 0.
．． 5 4" 1.0 6" 1.5 8" 2.0 10 〃 2.5 12 〃3.0 14 l! 3.5 16 〃 4.0 4n , n , 0 is the basic concept, Specific embodiments of this invention will be described below.

[Embodiment of the Invention] Fig. 3 shows a quadratic mesh code assignment table 1, which is made of a transparent sheet of paper, and a frame of the same length is used to designate a specific area 2, leaving a slight margin at the upper end of the sheet. Draw a square with line 3 and connect the points that divide this vertical and horizontal frame line 3 with super-large dividing line 4 to create 4 extremely large-scale divided areas (mesh level 1.5)
5, and a divided area designation code "0" is assigned to each divided area.
” to “3”, enter the quaternary mesh code 6. Next, the points that divide each of the bisected frame lines 3 into four are connected by the major dividing line 7 to form 16 large-scale divided areas (mesh level 2.
0) 8 is formed, and a quaternary mesh code 9 of divided area designation codes "0" to "3" is written in each of the four maximum-scale divided areas of each divided area.

In addition, the points that divide the frame line 3 divided into four equal parts into eight parts are connected by a large medium dividing line 10 to form 64 large medium-sized divided areas (mesh level 2.5>11), and the 16 points of each divided area are
Divided area designation code "0" to "
Enter the quaternary mesh code 12 of "3".

In addition, the points that divide the frame line 3 divided into 8 equal parts into 16 parts are connected by the middle dividing line 13A to form 256 medium-sized divided areas (mesh level 3.0) 13, and the 64 large-sized divided areas of each divided area are Divided area designation code “O” for each medium-sized divided area ~
Enter the quaternary mesh code 13B of "3". Also,
The 32 dividing points of the frame line 3 divided into 16 equal parts are connected by the middle subdivision line 14A to form 14 small-scale division areas (mesh level 3.5) out of 1,024, and each division area is For each of the 256 medium-sized divided areas, a divided area designation code rOJ to a quaternary mesh code 14B of "3" is written. Furthermore, the 64 dividing points of the 32 equally divided frame line 3 are connected with the subdivision line 15A to form 4.096 small-scale division areas (mesh level 4.0) 15, and each division area also has 1,024 A quaternary mesh code 15B of divided area designation code rOJ to "3" is written for each small-scale divided area in the area.

Eight binary barcodes 17 to 24 indicating the number of divisions of the frame line 3 are written in parallel on the upper frame and left side frame of the divided area allocation section 16 configured in this way, and the binary barcode 17 indicates the number of divisions. "1", the binary barcode 18 indicates the division number "2",
The binary barcode 19 is provided with a division count display section 25 that displays the division number "3" and the binary barcode 24 similarly displays the division number "64."

In the upper margin of the allocation table 1, a divided area display area 26 representing the range of the divided area and table in the same quaternary mesh as the configuration of the ultra-large-scale divided area described above, and the divided area designation code within the range are displayed. A quaternary mesh code display section 27, a conversion table 28 for mutually converting the aforementioned hexadecimal mesh code and quaternary mesh code via binary values, and a quaternary mesh code display section 27;
A display section 29 and a quaternary pattern code display section 30 for displaying a quaternary pattern code are described.

FIG. 4 shows a hexadecimal mesh code assignment table 31, which is made of transparent paper sheets similar to the quaternary mesh code assignment table described above.
Specified area 3 leaving a small margin at the top of this paper.
2, draw a square with frame lines 33 of the same length,
The point that divides this vertical and horizontal frame line 33 into four is the major dividing line 3.
4 to form 16 large-scale divided areas 35, and divided area designation codes rOJ ~ "9" and "A" ~ are assigned to these divided areas.
Enter the hexadecimal mesh code 36 of "F".

Next, 256 medium-sized divided areas 38 are formed by connecting the 16 points of the frame line 33 divided into four equal parts by the middle dividing line 37, and each divided area is also divided into 16 medium-sized divided areas. Divided area designation codes “○” to “9” and rAJ to rFJ
Enter the hexadecimal mesh code 39.

Furthermore, the frame line 33 divided into 16 equal parts is divided into 64 i! Connect the points to be lr with the subdivision line 40 to create 4.096 small-scale division areas 4
1, and each divided area also has a divided area designation code rOJ ~ "9" and rA for each of the 4,096 small-scale divided areas.
Enter the hexadecimal mesh code 42 of J to rFJ.

Eight binary barcodes 44 to 51 indicating the number of divisions of the frame line 33 are written in parallel on the upper frame and left side frame of the divided area allocation section 43 configured as described above, and the binary barcode 44 indicates the number of divisions. The binary barcode 45 indicates the number of divisions "2", the binary barcode 46 indicates the number of divisions "3", and the binary barcode 51 indicates the number of divisions "64". 52 are provided.

In the upper margin of the allocation table 31, there is a hexadecimal mesh division area display section 53 showing the hexadecimal mesh division area and the range of the table, which is the same as the configuration of the ultra-large-scale division area described above, and a hexadecimal mesh code within the range. a hexadecimal mesh code display section 54, a conversion table 55 for mutually converting the aforementioned hexadecimal mesh code and quaternary mesh code via binary values, a hexadecimal key display section 56, and a hexadecimal pattern code. Hexadecimal pattern code display section 57
is stated.

FIG. 5 is a quaternary mesh code and hexadecimal mesh code allocation percentage table 61, whose structure is a combination of the above-mentioned quaternary mesh code allocation table 1 and hexadecimal mesh code allocation table 31. The parts marked with are the same as those described above, and numbers 61^ and 61B corresponding to the XY-standard decimal values are added to the two sides of Table 61.

Figure 6 is one of the three code assignment tables mentioned above.
As an example, the Shinmesh code assignment table is shown superimposed on a 1:50,000 scale map (northeast Tokyo) 62.The following is data specifying the location of a specific area on the map, in this case Tokyo Station. Before describing the procedure for creating it, I would like to organize the explanation a little. 4 shown in Figure 3 mentioned above.
The relationship between the hexadecimal mesh designation code and the hexadecimal mesh designation code shown in FIG. 4 is as shown in FIG. (As shown in b+, one of the four ultra-large-scale division areas obtained by dividing into two equal parts is called mesh level 0.5, and the division area designation code rOJ ~ 4 decimal mesh code of "3" is attached, and this When each quaternary mesh code is expressed as a binary number, the quaternary mesh code rOJ becomes roOJ, the quaternary mesh code "1" becomes "01", the quaternary mesh code "2" becomes rl 0J, and the quaternary mesh code "3" becomes "11" bo, Let the upper left corner of this area A to which 2 bits of bl are assigned be the origin r00j of mesh coordinates.

Next is the division area roj with mesh level 0°5.

As shown in Fig. 7(C), Ml, r2J, and r3j are divided into more than 16 large-scale division areas obtained by dividing the length ratio into two, respectively.
Attach the division area designation code in hexadecimal numbers and further display these 16 hexadecimal mesh codes in binary numbers, 2 of b.
This state is called mesh level 1.0, and the divided areas, arrangement order, and hexadecimal mesh code are fixed in hexadecimal numbers.

The 16 ultra-large-scale divided areas shown in Figure 7 (C) are divided into 1.0-order areas.
Divide into four divided areas for each ultra-large hexadecimal mesh obtained by dividing into equal parts, and use the dividing area designation code "O".
A quaternary mesh code of ~3 is assigned, and 2 bits of b are assigned to represent this quaternary mesh code in binary, and this state is referred to as mesh level 1.5.

As shown in Figure 7+e), the side length of each of the 1.5-dimensionally divided maximum-scale 4-part areas is divided into 1/2 equal parts, and the divided areas are designated as large-scale 16-part areas obtained by the same division. 16 of codes “70” to “79” and “7A” to “7F”
b6. to display these 16 hexadecimal mesh codes. 2 bits of b7 are assigned, and this state is called mesh level 2.0.

Below, as shown in Figure 7 <f+~(1>), 4
Area A is subdivided based on the concept of division and 16 division.

FIG. 8 (ω is a diagram showing the relationship between mesh level, bit level, quaternary mesh and hexadecimal mesh, and quaternary mesh code and hexadecimal mesh code (address).Here, the hexadecimal mesh code for the 1st to nth divisions is A hexadecimal mesh code (0 to FFFFn) that can be carried in units of 4 bits and divided by the most significant 4 bits is fixed as an absolute address, and by selecting a certain number of division mesh levels, it becomes a relative address.

The number of meshes when treated as an absolute address is 65,536 from O to FFFF (8 bits vertically, 1-1 bits horizontally), but the number of meshes when treated as a relative address and a mesh number for each level are as described above and 7th bit. As shown in Figures (, a) to <i+, the mesh level is 4 at mesh level 05, and the mesh level is 1.0.
Then 16, and the same goes for 65 at mesh level 4.0.
536, and the total is 87.382, which is Naya 9. The digits of the mesh code represent the level of each number division mesh, and the relationship between the quaternary mesh and hexadecimal mesh is shown in Figure 8 (b).
As shown in , the division area of the hexadecimal mesh is obtained by dividing each primary division mesh (1st, 2nd, 3° 4th, Nth division) into 16 parts, and the division area of the 4-bit mesh is divided into 4 meshes at the primary level. It is a combination of decimal number (10), hexadecimal mesh code (168C), and quaternary mesh code (4HC).
) and the binary code are shown in FIG. 8(C).

Now, we go back again and apply the hexadecimal mesh code assignment table 61 on the map 62 of the northern part of East Tokyo on a scale of 1/50,000, and find the location of "Tokyo Station" in the data entry form 6 shown in Figure 9.
Fill in 3. In this table shown in Figure 9, 64 is the mesh data entry field for 1/200,000, and 65 is 1.2, 5/50,000.
5 Used when searching by drawing number attached to 1/10,000
1/20,000: 1/25,000 figure number code entry field, 66 is a field to enter the weight of the mesh (○ to 15 levels), 67 is a field to enter the mesh color (0 to 15 colors) Column 68 corresponds to the CPU address and is 1/50,000.
．． 1/25,000, 0.6, 1/25,000 and 0.31
Column to enter the 1/250,000th mesh designation code, 69
is a column to enter the administrative district name, and 70 to 73 are data names such as "Tokyo", "Northern" or "Higashi", "Kyo", "
A column 74 is used to enter the type of mesh, such as ``station,'' which is a data name entry column that can be expressed with a maximum of six characters, including three kanji characters such as ``neck part'' and three special characters.

Here, the mesh code of 1/200,000 is [OC○1],
This 1:50,000 map is the 1:200,000 map mentioned above.
According to the hexadecimal mesh code allocation table, Tokyo Station falls in the hexadecimal mesh code "7" division area, as shown in Figure 6 on a 1/50,000 scale map, and Tokyo Station is located in the hexadecimal mesh code "A" division area. 0, which divided this divided area into 1/4
, 1/31.25 million is in the rBJ division area, so
The location data for Tokyo Station can be written as r7A9BJ. That is, it is possible to zoom in and extract a map from a scale of 1/200,000 to a scale of 1/031,250,000.

The above is an example displayed in hexadecimal mesh code,
If we use the quaternary mesh code as shown in FIG.
, 0111'1O10-'10011011J. Furthermore, if a hexadecimal pattern code or a quaternary pattern code is used, it can be displayed as shown in FIG.

The hexadecimal mesh code is a code to correspond to the address of the cPU, and the quaternary mesh code is a code to correspond to an external input key and an index pattern code. The quaternary mesh code specifies the division area of the quaternary mesh by pressing the four input keys from rOJ to "3", and the mesh level by the number of times, and the hexadecimal mesh code specifies the mesh level by pressing the four input keys rOJ to "9" and rAJ to rFJ. It corresponds to external input keys by making it possible to specify the division area of a hexadecimal mesh by pressing the 16 input keys, and specifying the mesh level by the number of times, or by filling in the area where information is located for each level. You can also do it.

Information on these main points on the map is stored in the CPU's memory in hexadecimal mesh codes, that is, hexadecimal codes, as shown in Figure 9. From the mesh code or the map itself, it becomes "Tokyo 0C01", "Tokyo Station 7A9BJ", and as mentioned above, "7" is the 7th page of the atlas, rAJ is the 7th A division area, and "9" is the 9th division of the A division area. The location of Tokyo Station can be accurately known by indicating that it is the B-divided area of the 9-divided area.

Although not shown, by assigning one character to each mesh based on the mesh code table in a kanji character table, it is possible to assign a four-digit code to each kanji or character as described above, and it can also be used as a character search code. Can be used.

[Effects of the Invention] As described above, the present invention provides four (n is a positive integer of 2 or more) square meshes within a wide pattern area consisting of a set of many small area patterns such as figures, characters, symbols, etc. A division area is drawn corresponding to a predetermined mesh division level based on a hexadecimal value, and from a mesh division area at a higher level of the mesh division level to a division area at a lower level in accordance with a predetermined hexadecimal call code. By repeating the area limitation, the desired specific divided area is searched from the wide pattern area.Since the specific divided area is searched from the wide pattern area, the level All meshes of n correspond to CPU addresses, and by specifying the mesh level and division area at the same time, the position and range of the whole can be specified accurately, and selecting level 1 means reducing the whole to 1/16. , specifying one of these meshes means extracting a specific range from the whole.Here, controlling the mesh level means shifting the bit level, and setting level 2 to the entire CRT screen. (assuming that the mesh accuracy is up to level 4 when corresponding to),
As mentioned above, shifting 2 bits to the upper bits will enlarge it (doubling the mesh level precision), and shifting 2 bits to the lower bits will reduce it (the mesh precision - becomes 1/2). Since mesh levels, division areas, and codes (addresses) can be specified in , the search speed can be significantly increased.

[Brief explanation of drawings]

Figures 1 to 10 all show one embodiment of the present invention, Figures 1 and 2 are explanatory diagrams of the basic concept of the invention, and Figure 3 is a four-base mesh code allocation table. Diagram,
Figure 4 is a configuration diagram of a hexadecimal mesh code assignment table, and Figure 5 is a diagram showing the quaternary mesh code/hexadecimal mesh code and
A configuration diagram of the Y coordinate decimal code assignment table, Figure 6 is a diagram showing the usage status of the hexadecimal mesh code assignment table, and Figure 7 (ω
~ (i) is an explanatory diagram of the quaternary mesh code, hexadecimal mesh code, and mesh level, and Figure 8 (a) is the relationship between the mesh level, bit level, quaternary mesh, hexadecimal mesh, and quaternary mesh code and hexadecimal mesh code (address). Figure 8 (b) is a diagram of the relationship between the division area of the quaternary mesh and the division area of the hexadecimal mesh. Figure 9 is a diagram showing an example of filling in the data entry form, and Figure 10 is a diagram showing the relationship between each pattern code and mesh code. Explanation of codes 1... Quaternary mesh code allocation table 2.・・・・・・
・Specific area 3.33... Frame line 4... Super large division line 5... Extremely large division area 6.9.12.13B, 14B, 15B... Quaternary mesh code 7. 34...Large dividing line 8.35...Large dividing area 13.38...Medium dividing area 10...Large dividing line 13A, 37...Medium dividing line 11... ...Large medium-sized division area 14...Medium small-scale division area 15.41...Small-scale division area 14A...Medium subdivision lines 15A, 40...Small division lines 16, 43 ...Divided area allocation section 17-24.44-51...Binary barcode 25.5
2... Division count display section 26... Division area display section 27... Quaternary mesh code display section 28, 55
... Conversion table 29 ... Quaternary key display section 30 ... Quaternary pattern code display section 31 ...
... Hexadecimal mesh code assignment table 32 ... Specific area 36, 39.42 ... Hexadecimal mesh code 53 ...
... Hexadecimal mesh division area display section 54 ...
- Hexadecimal mesh code display section 56... 16 entry key display section 57... Hexadecimal pattern code display section 61... Hexadecimal and quaternary mesh code allocation table 61A , 61B...Numeric value 62...Map 63...Data entry form 64...Mesh data entry field 65...
- Drawing number code entry column 66... Column to enter mesh weight is also 7...
Column 68 to enter the color of mesh...
Column 69 for entering mesh designation code...Columns 70-73 for entering administrative district name...Data name entry column A...Area GO~Gaa, Go-G F...Very large Scale division area G4... Quaternary mesh code table Gi6... Hexadecimal mesh code table Patent applicant Tomo Chika Setsu Ko procedure report (method) August 27, 1980 Patent application No. 97238 No. 2, Name of the invention Method for searching a specific divided area from a wide pattern area 3, Relationship with the case of the person making the amendment Patent applicant Funabashishima Ebara Higashi Address 4-19-18 Maehara Izumi, Funabashi City, Chiba Prefecture Tomo
Chika Toki Taka Name Tomo Kinsetsu Ko 4, Agent postal code 110 5, Date of amendment order July 31, 1980 Amended Special Application No. 1987-97238 No. 1, Specification, page 23, line 20 From "Fig. 1 to" to "Fig." on page 24, line 8 [The figures show one embodiment of the present invention; 〈ω to (e) are respectively explanatory diagrams of the basic concept of this invention, Fig. 3 (ω is a diagram of the configuration of a quaternary mesh code allocation table, and Fig. 3 (b) to 〈h) are the main parts of the above, respectively. Figure 4 (ω) is an enlarged partial configuration diagram of the hexadecimal mesh code assignment table, Figure 4 (b) to mountain are enlarged configuration diagrams of the same main parts, and Figure 5 (a) is an enlarged partial configuration diagram of the same. A configuration diagram of a quaternary mesh code/hexadecimal mesh code and a decimal code assignment table for XY coordinates, Figure 5 (b) to 5th issue) is an enlarged configuration diagram of the main parts of the above, and Figure 6 (a) Figure 6 shows the usage status of the hexadecimal mesh code assignment table.
Figure (b) is an enlarged diagram of the main parts of the same. 2. Box 1 in the drawing is revised as shown in the attached drawings Figures 1 (a) to 1 (e). 3. Drawing Figure 2 of the inner box is attached to the attached drawing Figure 2 (J to 2).
Correct as shown in figure (e). 4. Correct box 3 in the drawing as shown in the attached drawing (Figure 3(a) to 3rd appearance). 5. Please replace Figure 4 of the box in the drawing with Figure 4 of the attached attached drawing (ω to 4th figure).
Correct as shown in 6. Correct box 5 in the drawing as shown in the attached drawings 5(a) to 5th appearance). 7. Box 6 in the drawing is amended as shown in the attached attached drawing, Figure 6 (ω and Figure 6 (b). Applicant Tomo Chika Setsu Filial Procedures Amendment 1) August 27, 1980 Patent Office Director Manabu Shiga 1, Indication of the case, Patent Application No. 97238 of 1982, 2, Name of the invention: Method of searching for a specific divided area from a wide pattern area 3, Relationship with the amendment person case Patent application Person Funabashi Shima Ebara Higashi Address Tomo 4-19-18 Maehara Higashi, Funabashi City, Chiba Prefecture
Chika Toki Taka Name Tomo Kin Setsu Takashi 4, Agent postal code 110 5, Date of amendment order July 31, 1980 6, Subject of amendment Column 7 for detailed explanation of the invention in the specification, Contents of amendment
As per the attached document, amended Japanese Patent Application No. 1987-97238, specification @ page M3, line 20, “Figure 1” was changed to “Figure 1”.
Corrected to ω. 2. In the same book, page 4, line 9, add [as shown in Figure 1+b+ to Figure 1(e)] before "vertical and horizontal direction". 3. Change “Figure 1” from page 5, line 11 of the same book to “Figure 1〈a
...(e)" and changed "Figure 2 1," in line 12 of the same page to "
Figure 2 (corrected to a + J. 4. In the same book, page 6, line 4, before "16", add "as shown in Figure 2 (e)" from the second entry). 5 , ``Figure 3'' on page 9, line 20 of the same book was changed to 1 Figure 3 (a
)”. 6. Added [as shown in Figure 3 + b + to Figure 3 (e)] before "64" on page 11, line 12 of the same book, and added " As shown in FIG. 3(a) to td+," is added. B. On page 12, line 6 of the same book, in front of “the above” there is “Fig. 3〈ω
and Figure 3 (add 1 as shown in f+ to +h+, and correct "Figure 4" in line 16 of the same page to "Figure 4 (ω"). 8. In line 13 of page 13 of the same book. ``As shown in Figures 4(b) to 4(e)'' before ``formation J'' and ``as shown in Figures 4(a) to 4(e)'' in line 19 of the same page. d)]. 9. In the same book, page 14, line 5, before ``above'', add ``Figure 4 (
a) and ``as shown in Figure 4 (r+ to <11)'', and changed ``Figure 5'' in line 15 of the same page to ``Figure 5 (a)''.
In the 20th line of the same page, before rXYJ
101. Change [Figure 6] in the second line of page 15 of the same book to ``Figure 6 (
a)” and “Figure 3” in line 8 of the same page was changed to “Figure 3 (
a) to (e+ J, and roughly correct “Figure 4” on line 9 of the same page to “Figure 4 (a) to +e+ j.” 11 Ibid., page 18, line 20, [5) Before 1/10,000th [
"as shown in FIG. 6(a)" is added. 12. In the same book, page 19, line 15, "neck" is corrected to "neck." 13. Change “Figure 6” from line 4 on page 20 of the same book to [Figure 6 (b)
)”. Applicant: Takashi Chika

Claims (1)

[Claims] 4n (n is a positive integer of 2 or more) rectangular mesh division areas are divided into a predetermined mesh division level based on a hexadecimal value in a wide pattern area consisting of a set of many small area patterns such as figures, characters, symbols, etc. , and by repeating the area limitation from the mesh division area of the upper level to the division area of the lower level of the mesh division level corresponding to the scheduled hexadecimal calling code i-half. A method for searching for a specific divided area from among a wide pattern area, characterized in that a desired specific divided area is searched from within the pattern area.