| 摘要 |
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. |
