JP2006195172A - Binary tree map data creating device, method and program thereof, recording medium and map output device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a map data creating device for creating a map data permitting to easily thin out an inner point data from a line, to provide a method therefor, a program therefor, and a recording medium therefor, and also to provide a map output device. <P>SOLUTION: The binary tree map data creating and outputting device 1 of this invention creates a binary tree map data comprising: each coordinate value of a starting point and an end-point in a divided line; the greatest alienation degree among alienation degrees of inner points in the divided line between the starting point and the end-point of this divided line; and parent-child relationship information representing a parent-child relationship which is a correspondent relation between this divided line and the 1st and 2nd dividing lines produced from this divided line, while being made correspondent to each other. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a technology of a geographic information system.

  When traveling in a geography space, traveling, visiting, etc., displaying disaster damage predictions and damage status, displaying demographic density, land use statistics, etc., evacuation routes, garbage collection routes, etc. The map is used for various purposes such as displaying the action route. The map is a visual representation of the components of the geospatial space on a two-dimensional medium such as paper or a display according to a predetermined rule (schematic), and it is necessary to process the map according to the purpose of use. In addition, since the components of the geospatial change with the passage of time due to natural events or artificial events, it is also necessary to update the map.

  For this reason, a geographic information system (hereinafter abbreviated as “GIS”), which is a computer system that manages, analyzes, and displays geographic information described in a digital format, has been developed and put into practical use ( For example, Non-Patent Document 1). In GIS, geographic information is a general term for information describing the characteristics of geospatial components (referred to as entities or spatial entities), and is generally an attribute that is a location, shape, physical or social characteristic. Configured with functions, dates and interrelationships.

  In GIS, for example, a map is expressed by superimposing a plurality of layers (layers) obtained by classifying geographic information according to a certain rule. The layers that make up this map are vector methods that represent the position and shape of entities by points (points), lines (lines), and faces (polygons). One of a raster method that is a method of expressing the position and shape of an entity by a set, and a TIN (Triangulated Irregular Network) method that is a method of expressing a surface by dividing the surface by a set of regular cells Described by. Layers where discrete entities gather, such as layers that display administrative boundaries, layers that display roads, layers that display water systems, and layers that display buildings, are usually described in vector format, and are continuously described as terrain. The changing surface is usually described by a raster method or a TIN method.

  In this vector method, the contours of entities on the map or on the ground are converted into data, the position and shape are converted into graphic data, the attributes, functions, and dates are converted into attribute data. Data is generated as topology data. In this graphic data, the point is converted into data with the coordinate value of the point, the line is converted into data with the coordinate values of the start point, one or more internal points (intermediate points) on the line, and the end point, and the polygon For example, data is converted into data of lines constituting a polygon. As described above, since the line is converted into data by each coordinate value of the start point, the inner point, and the end point, the curve is expressed by a broken line.

Basic geographical information that is basic data (metadata) of GIS is maintained by the Geographical Survey Institute for land areas in Japan, and by the Coast Guard Department of Japan Coast Guard for sea areas. For example, the Geographical Survey Institute issues a numerical map 2500, a numerical map 10000 general, a numerical map 25000, and the like.
Namibayashi, “The Principles and Applications of GIS”, Nikka Giren, May 26, 2003

  Incidentally, the map is used for various purposes as described above, and it is necessary to select geographic information according to the purpose of use. In other words, depending on the purpose of use, it is necessary to create a map that includes all information that has been converted into data, and also includes only a portion of the information that has been converted into data. You also need to create a map.

  In addition, there are various scales such as a large scale and a small scale as is well known, and it is necessary to create a map by incorporating all the information that has been converted into data according to this scale, In addition, it is necessary to create a map that includes only a part of the information that has been converted into data.

  Furthermore, there are various sizes and resolutions of displays that display maps, and it is necessary to display maps with all the information that has been converted into data according to these sizes and resolutions. In addition, it is necessary to create a map that includes only a part of the information that has been converted into data.

  In such a case, conventionally, a map according to the purpose of use, according to the scale, or according to the size or resolution has been created by manually selecting geographic information. Therefore, a great deal of time and effort is required for creating and maintaining the map (maintenance).

  The present invention has been made in view of the above-described circumstances, and is a map data creation device, map data creation method, and map data creation for creating map data that can easily thin out the internal point data from vector-type line data. An object of the present invention is to provide a computer-readable recording medium in which a program and a map data creation program are recorded. And it aims at providing the map output apparatus which can output the map which thinned data from the map data which concerns on this invention. It is another object of the present invention to provide a computer-readable recording medium in which map data capable of easily thinning out internal point data from vector line data is recorded.

  In order to achieve the above object, a binary tree map data creation device according to an aspect of the present invention provides each coordinate value of a start point and an end point of a divided line, and the covered point between the start point and the end point of the divided line. The maximum separation degree among the separation degrees of the inner points on the dividing line and the parent-child relationship which is a correspondence relation between the divided line and the first and second dividing lines generated from the divided line. It is associated with parent-child relationship information, and the degree of separation is determined from the line segment connecting the start point and end point of the split line between the start point and end point of the split line and the inner point on the split line. The first and second divided lines are generated by dividing the divided line into two at the inner point having the maximum degree of separation, and the divided line is a starting point. And each coordinate value of the end point and the start point And a line that can be represented by a line on the map with the coordinate value of the internal point on the line between the end points and the division line excluding the division line that does not have the internal point of the first and second division lines And generating binary tree map data.

  Then, the binary tree map data creation device according to another aspect of the present invention includes the coordinate values of the start point and the end point of the divided line and the separation degree used when generating the divided line as the parent separation degree. And the maximum separation degree of the separation points of the inner points on the divided line between the start point and the end point of the divided line as the child separation degree. A scale representing how far an inner point on the split line between the start point and end point of the split line is from a line segment connecting the start point and end point of the split line, and the split line is Divided by a line that can be represented by a line on a map with each coordinate value of the start point and end point and the coordinate value of the inner point on the line between the start point and end point, and the inner point with the maximum degree of separation Generated by dividing a line into two All of the first and second divided lines, wherein the parent separation degree and the child separation degree indicate a correspondence relationship between the divided line and the first and second divided lines generated from the divided line. When the separation degree used in dividing the divided line into the first and second divided lines from the parent to the descendant from the line to the divided line having no interior point is sequentially traced, Binary tree map data which is a value replaced with the maximum value of the degree of separation on the descendant side including the degree of separation when dividing is created.

  Further, according to another aspect of the present invention, each coordinate value of the start point and the end point and the coordinate value of the inner point on the line between the start point and the end point are provided, and a line represented by a line on the map A binary tree map data creation device that converts map data into binary tree map data includes an internal point on the split line between the start point and end point of the split line from a line segment connecting the start point and end point of the split line. A separation degree computing unit that computes a separation degree that is a measure representing how far is separated, and an inner point that has the largest separation degree among the separation degrees calculated by the separation degree computing unit, A divided line division processing unit that divides the first and second divided lines, and a new divided line generated by dividing the line by the divided line division processing unit as the first divided line. Split line The line division processing unit that sequentially divides the line until there is no inner point on the division line, and the coordinate values of the start point and the end point of the line and the division line that are the divided lines by the line division processing unit The maximum degree of separation used when the divided line is divided by the divided line division processing unit, the first and second divided lines generated by the divided line division processing unit, and the divided And a creation processing unit for creating the binary tree map data provided with the parent-child relationship information representing the parent-child relationship that is a correspondence relationship with the line.

  Furthermore, in the above binary tree map data creation device, the split line is generated by using the maximum separation degree used when the divided line division processing unit divides the divided line as a child separation degree. The separation degree used at the time is defined as the parent separation degree, and the parent separation degree and the child separation degree are defined as the first and second divided lines from the parent to the descendants from the line to the division line having no internal point. And further comprising a replacement processing unit that, when the separation degree used for dividing the line into two divided lines is sequentially traced, is replaced with the maximum value of the separation degree on the descendant side including the separation degree for the division. The processing unit associates the coordinate values of the start point and the end point of the line and all the divided lines with the parent separation degree processed by the replacement processing unit and the child separation degree processed by the replacement processing unit. Prepare for Characterized in that it created a minute tree map data.

  And, according to another aspect of the present invention, each coordinate value of the starting point and the ending point and the coordinate value of the inner point on the line between the starting point and the ending point, and a line represented by a line on the map In a binary tree map data creation method for converting map data into binary tree map data, a binary tree map data creation program to be executed by a computer, and a recording medium recording the binary tree map data creation program to be executed by a computer The binary tree map data creation program is a scale representing how far an inner point on the divided line between the start point and the end point of the divided line is separated from a line segment connecting the start point and the end point of the divided line. A separation degree calculating step for calculating a separation degree, and an inner point having a maximum separation degree among the separation degrees calculated in the separation degree calculation step. Divided line division processing step for dividing IN into two first and second divided lines, and a division generated by dividing the line into the first divided line and dividing in the divided line division processing step By setting the line as a new divided line, a line division processing step that sequentially divides the line until there is no inner point in the divided line, and the line and the divided line that are set as the divided lines in the line division processing step Each coordinate value of the start point and the end point in the above, the maximum degree of separation used when the divided line is divided in the divided line division processing step, and the first and second generated in the divided line division processing step The binary tree ground provided in association with parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the second divided line and the divided line. Characterized in that it comprises a creation process step of creating the data.

  Further, the above binary tree map data creation method, binary tree map data creation program to be executed by a computer, and binary tree map data creation in a recording medium recording the binary tree map data creation program to be executed by a computer In the program, the maximum separation degree used when dividing the divided line in the divided line division processing step is set as a child separation degree, and the separation degree used when generating the divided line is set as a parent degree. As the degree of separation, the parent separation degree and the child separation degree are used when dividing the divided line into the first and second divided lines from the parent to the descendant from the line to the dividing line having no inner point. When the separation degree is sequentially traced, the replacement processing step is replaced with the maximum value of the separation degree on the descendant side, including the separation degree at the time of the division. The creation processing step is processed in the replacement processing step and the coordinate values of the start point and the end point in the line and all the divided lines, the parent separation degree processed in the replacement processing step, and the replacement processing step. The binary tree map data including the child separation degree associated with each other is created.

  Furthermore, according to another aspect of the present invention, each of the coordinate values of the start point and the end point of the divided line and the degree of separation of the inner point on the divided line between the start point and the end point of the divided line A maximum degree of separation, and parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the divided line and the first and second divided lines generated from the divided line, The degree is a scale representing how far the inner point on the split line between the start point and end point of the split line is away from the line segment connecting the start point and end point of the split line, The first and second divided lines are generated by dividing the divided line into two at the inner point having the maximum degree of separation, and the divided line has the coordinate values of the start point and the end point and the start point and the end point. Seat of the inner point on the line in between A predetermined internal point from binary tree map data that is a line that can be represented by a line on a map having a value and a divided line that does not have an internal point of the first and second divided lines The map output device for thinning out and outputting outputs an input unit for inputting a thinning degree that is a degree of thinning out the inner point of the line, and the divided line from a parent to a descendant from the line to a dividing line having no inner point. As a result of sequentially comparing the maximum degree of separation and the thinning degree input at the input unit, the coordinate values of the start point and the end point of the divided line having the maximum degree of separation equal to or less than the thinning degree are obtained. An output map creation processing unit to be acquired, and an output unit that outputs a line segment connecting the coordinate values of the start point and the end point acquired by the output map creation processing unit are provided.

  Then, according to another aspect of the present invention, the coordinate values of the start point and end point of the divided line, the separation degree used when generating the divided line as the parent separation degree, and the child separation degree as the child separation degree A maximum degree of separation of the inner points on the line to be divided between the start point and the end point of the line to be divided. Is a scale representing how far an inner point on the split line between them is from a line segment connecting the start point and the end point of the split line, and the split line has each coordinate value of the start point and the end point The line to be divided is divided into two by a line that can be represented by a line on the map comprising the coordinate value of the inner point on the line between the start point and the end point, and the inner point having the maximum degree of separation All the first and second divisions generated by And when the correspondence between the divided line and the first and second divided lines generated from the divided line is a parent-child relationship, When the separation degree used to divide the divided line into the first and second division lines from the parent to the descendant up to the division line having no point is sequentially traced, the descendants including the separation degree when the division is performed A map output device that thins out and outputs a predetermined inner point from binary tree map data that is a value replaced with the maximum value of the side separation degree inputs a thinning degree that is a degree of thinning out the inner point of the line The parent separation degree greater than the thinning degree as a result of sequentially comparing and comparing the parent separation degree and the child separation degree of the divided line with the thinning degree input at the input unit And the thinning-out degree An output map creation processing unit that obtains the coordinate values of the start point and the end point in the divided line having the child separation below, and a line segment that connects the coordinate values of the start point and the end point obtained by the output map creation processing unit And an output unit.

  In the map output device described above, the binary tree map data includes a rounding parent obtained by rounding the parent separation degree and the child separation degree according to a predetermined rule to a plurality of integers that increase with a predetermined interval. The output map creation processing unit further includes a separation degree and a rounding element separation degree in association with each other, and the output map creation processing unit calculates the rounding parent separation degree and the rounding element separation degree of the divided line and the thinning degree input by the input unit. The divided line from which the coordinate values of the start point and the end point are to be acquired is determined by an equation according to the predetermined rule using a rounding thinning degree rounded to a plurality of integers according to the predetermined rule. .

  Furthermore, in these map output devices described above, the input unit further receives a rectangular output range to be output to the output unit, and the output map creation processing unit receives the rectangular output range input by the input unit. In this case, the line to be divided in a line that partially or entirely includes is used as the comparison target.

  In the above-described map output device, the binary tree map data is a plurality of layers having lattices with a constant interval in the xy coordinate system provided for the binary tree map data, and the interval of the lattices between the layers. Is associated with rounded coordinate values obtained by rounding the coordinate values of the start point and end point of the divided line according to a predetermined rule to the coordinate values of the grid points in a plurality of layers that increase with a predetermined interval. The input unit further receives a rectangular output range to be output to the output unit, and the output map creation processing unit receives the rectangular input from the input unit of the grid area formed by the grid. A division line having a rounded coordinate value rounded to a coordinate value of a grid point in a grid area in which a part or all of the output range is applied is set as the comparison target.

  In addition, a computer-readable recording medium according to another aspect of the present invention includes a coordinate value of a start point and an end point of a divided line and the divided line between the start point and the end point of the divided line. Parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the split line and the first and second split lines generated from the split line; The degree of separation indicates how far the inner point on the split line between the start point and end point of the split line is away from the line segment connecting the start point and end point of the split line The first and second divided lines are generated by dividing the divided line into two at the inner point having the maximum degree of separation, and the divided line is represented by each of the start point and the end point. Coordinate values and the start and end points A line that can be represented by a line on the map with the coordinate value of the inner point on the line in between, and a dividing line excluding the dividing line that does not have an inner point among the first and second dividing lines Certain binary tree map data is recorded.

  Furthermore, the computer-readable recording medium according to another aspect of the present invention includes a start point and an end point coordinate value of a divided line and a separation used when the divided line is generated as a parent separation degree. And the maximum degree of separation among the degree of separation of the inner points on the divided line between the start point and the end point of the divided line as the child separation degree, A scale representing how far an inner point on the split line between the start point and end point of the split line is away from a line segment connecting the start point and end point of the split line, and the split line is A line that can be represented by a line on the map comprising the coordinate values of the start point and end point and the coordinate value of the inner point on the line between the start point and end point, and the inner point having the maximum degree of separation. By dividing the dividing line into two All of the first and second divided lines generated in the above-mentioned manner, the parent separation degree and the child separation degree correspond to the divided line and the first and second divided lines generated from the divided line. When the relationship is a parent-child relationship, the degree of separation used to divide the divided line into the first and second divided lines from the parent to the descendant from the line to the divided line having no inner point is sequentially traced. In this case, binary tree map data that is a value replaced with the maximum value of the degree of separation on the descendant side including the degree of separation at the time of the division is recorded.

  The binary tree map data creation device, the method, the program of the method, and the program of the method recorded on a recording medium according to the present invention include the coordinate values of the start point and the end point of the divided line, and the divided line The maximum degree of separation of the inner points on the divided line between the start point and the end point, and the first and second divided lines generated from the divided line and the divided line Binary tree map data provided in association with parent-child relationship information representing a parent-child relationship that is a correspondence relationship, each coordinate value of a start point and an end point of a divided line, and used when generating the divided line as a parent separation degree A binary tree map having a degree of separation and a maximum degree of separation of inner points on the divided line between the start point and the end point of the divided line as child separation degrees in association with each other Create data . For this reason, the map output device according to the present invention uses the created binary tree map data or the binary tree map data stored in the recording medium, according to the range, scale, or resolution of the map to be displayed. The data obtained by thinning out the data of the inner point from the line can be taken out at high speed, and the map can be created at high speed.

Embodiments according to the present invention will be described below with reference to the drawings. In addition, the structure which attached | subjected the same code | symbol in each figure shows that it is the same structure, The description is abbreviate | omitted.
(Configuration of the first embodiment)
When creating binary tree map data from original map data, the binary tree map data creation / display apparatus in the first embodiment divides a line into first and second divided lines at the inner point of the maximum separation degree Smax. By performing binary tree processing and recursively repeating the binary tree processing using the divided first and second divided lines as new binary tree processing targets, binary tree map data having a tree structure is created, When outputting a map according to the thinning degree based on the binary tree map data, the line separation degree and the thinning degree are compared with respect to each line data in the tree structure of the binary tree map data. When the degree of separation is equal to or less than the degree of thinning, the thinning processing for outputting the line is performed by depth-first search from the root (root) to the end of the tree structure. Flip was and outputs the map.

  FIG. 1 is a block diagram showing a configuration of a binary tree map data creation / output device according to the first embodiment. In FIG. 1, the binary tree map data creation / output device 1 includes, for example, an arithmetic processing unit 11, an input unit 12, an output unit 13, a storage unit 14, and a bus 15.

  The input unit 12 bisects various commands such as a creation start command for instructing the start of creation of binary tree map data and an output start command for instructing the start of map output, and various data such as the original map data and the value of the thinning degree. A device that inputs to the tree map data creation / output device 1, such as a keyboard or a mouse. Original map data is map data composed of line data (line data) in a vector system, which is the basis for creating binary tree map data according to the present invention. Numerical map data is used. Lines represent discrete entities such as roads, water pipes, sewers, rivers and other water systems, contour lines and depth lines. Even when a line constitutes a closed loop, it can be applied by expressing the line by a plurality of lines. The thinning-out degree T is the degree of thinning out the inner points of the line when generating a map based on the binary tree map data. As will be described later, the thinning-out degree T uses the data of the inner points in the original line data. It becomes a threshold value for determining whether or not. The output unit 13 corresponds to the command and data input from the input unit 12 and the thinning degree T based on the file name of the binary tree map data generated by the binary tree map data generation output device 1 and the binary tree map data. For example, a display device such as a CRT display, LCD, organic EL display or plasma display, a printing device such as a printer, or the like.

  The storage unit 14 includes a binary tree map data creation program storage unit 31 that stores a binary tree map data creation program according to the present invention that creates binary tree map data from original map data, and a thinning degree T based on the binary tree map data. An output map creation program storage unit 32 that stores an output map creation program that creates a corresponding map and outputs the created map to the output unit 13, an original map data storage unit 33 that stores original map data, and the present invention A binary tree map data storage unit 34 for storing the binary tree map data according to the above, and stores various programs and various data such as data generated during the execution of the various programs. The storage unit 14 includes, for example, a volatile storage element such as a RAM (Random Access Memory) serving as a so-called working memory of the arithmetic processing unit 11, and a ROM (Read Only Memory) or a rewritable EEPROM (Electrically Erasable Programmable Read Only). Non-volatile memory elements such as “Memory”.

  The arithmetic processing unit 11 includes, for example, a microprocessor and its peripheral circuits, and functionally includes a binary tree map data creation processing unit 21 and an output map creation processing unit 22, and inputs according to a control program. The unit 12, the output unit 13, and the storage unit 14 are controlled according to the functions.

  The binary tree map data creation processing unit 21 creates binary tree map data according to the first embodiment from the original map data by the operation described later. In this embodiment, each of the start point and the end point in the divided line The maximum separation degree Smax of the coordinate values and the separation degree S of the inner point on the divided line between the start point and the end point of the divided line, and the inner point having the maximum separation degree Smax. The first and second divided lines generated by dividing the divided line into two and the parent-child relationship information representing the parent-child relationship between the divided lines are provided in association with each other. 1st execution which is a division line except a division line which does not have an internal point among the 1st and 2nd division lines generated by dividing a line into two by an internal point with the maximum separation degree Smax It is intended to create a binary tree map data according to the state. More specifically, for example, in this embodiment, the binary tree map data creation processing unit 21 includes a separation degree calculation unit 211 that calculates a separation degree S and a separation degree S calculated by the separation degree calculation unit 211. A divided line division processing unit 212 that divides the divided line into two first and second divided lines at the inner point having the maximum separation degree Smax, and sets the line as the first divided line and the divided line division A line division processing unit 213 that sequentially divides a line until there is no inner point in the division line by using the division line generated by dividing by the processing unit as a new divided line, and a line division processing unit 213 The coordinate values of the start point and the end point of the divided line that is the divided line, the maximum separation degree Smax when the divided line is divided by the divided line division processing unit 212, and the divided line A creation processing unit 214 that creates binary tree map data that includes the parent-child relationship information that represents the parent-child relationship that is the correspondence relationship between the first and second divided lines and the line to be divided, generated by the second partition processing unit 212. With.

  Here, considering the starting point and ending point of the line and the inner point located between them, if all the inner points are on the line segment connecting the starting point and the ending point, all the inner points are thinned out, that is, Even if the line is drawn with the start point, the end point, and the line connecting these points without adopting all the internal points, it looks as if the line is drawn by connecting the internal points in order from the start point to the end point. Are identical. Therefore, whether or not to thin out the inner point can be determined by the line segment connecting the start point and the end point and the degree of separation from the inner point. Therefore, in the present invention, the degree of separation S is defined as a measure representing how far each internal point is away from the line segment connecting the start point and the end point. For example, in the present embodiment, the separation degree S is a distance D from the inner point to a straight line passing through the start point and the end point from the viewpoint that it can be easily calculated.

  The output map creation processing unit 22 creates a map corresponding to the thinning degree T based on the binary tree map data by the operation described later, and outputs the created map to the output unit 13. In the present embodiment, the output map creation processing unit 22 The maximum separation degree Smax of the line to be divided from the parent to the descendant having no interior point to the descendant line is sequentially compared with the thinning degree T input at the input unit 12, and as a result of comparison, the thinning degree T or less The coordinate values of the start point and end point in the divided line having the maximum separation degree Smax are acquired and output to the output unit 13.

  The arithmetic processing unit 11, the input unit 12, the output unit 13, and the storage unit 14 are connected by a bus 15 so that data can be exchanged with each other.

  Such a binary tree map data creation / output device 1 can be configured by, for example, a computer, more specifically, a personal computer such as a notebook type or a desktop type.

  Note that the binary tree map data creation / output device 1 may further include an external storage unit 16 and / or a communication interface unit 17 as indicated by a broken line as necessary. The external storage unit 16 stores data with a recording medium such as a flexible disk, a CD-ROM (Compact Disc Read Only Memory), a CD-R (Compact Disc Recordable), and a DVD-R (Digital Versatile Disc Recordable). An apparatus that performs reading and / or writing, such as a flexible disk drive, a CD-ROM drive, a CD-R drive, and a DVD-R drive. The communication interface unit 17 is connected to a network such as a local area network or an external network (for example, the Internet), and is an interface circuit for transmitting and receiving communication signals to and from other communication terminal devices via this network. Based on the data from the arithmetic processing unit 11, a communication signal in accordance with the communication protocol of the network is created and the communication signal from the network is converted into data in a format that can be processed by the arithmetic processing unit 11.

  Here, when each program such as binary tree map data creation program and map output program and each data such as original map data and binary tree map data are not stored, each program and each data record that records them It may be configured to be installed in the storage unit 14 from the medium via the external storage unit 16, or from a server (not shown) that manages these programs and data via the network and communication interface unit 17. You may comprise so that each program and each data may be downloaded. Alternatively, the created binary tree map data may be recorded in a recording medium via the external storage unit 16, and the created binary tree map data may be stored in the server via the network and communication interface unit 17. It may be configured to be uploaded.

Next, the operation of this embodiment will be described.
(Operation of the first embodiment)
First, an operation in which the binary tree map data creation / output device 1 creates binary tree map data from the original map data will be described.

  FIG. 2 is a flowchart showing an operation of creating binary tree map data in the binary tree map data creation / output device according to the first embodiment.

  For example, when the user inputs original map data from the input unit 12 to the binary tree map data creation / output device 1, the original map data is stored in the original map data storage unit 33 of the storage unit 14. Then, the binary tree map data creation program is called from the binary tree map data creation program storage unit 31 of the storage unit 14 and executed. For example, the user outputs binary tree map data from the original map data to the binary tree map data creation output device. When the binary tree map data creation start command is input from the input unit 12 so that the binary tree map data is created, the binary tree map data creation processing unit 21 of the arithmetic processing unit 11 is stored in the original map data storage unit 33 of the storage unit 14. Binary tree map data is created based on the original map data.

  That is, in FIG. 2, first, the binary tree map data creation processing unit 21 of the arithmetic processing unit 11 uses the line division processing unit 213 to convert the line data of the original map data into the binary tree map data according to the present invention. One line data is extracted from the original map data (S10). In order to avoid executing the binary tree processing of processing S11 to processing S14, which will be described later, by duplicating the line data of the original map data, in this processing S10, the line data is sequentially extracted from the original map data or has been extracted. A code (one or a plurality of symbol strings) indicating that it is present is added to the line data of the original map data.

  Next, the binary tree map data creation processing unit 21 uses the separation degree calculation unit 211 to calculate the separation degree S of each inner point using the extracted line as a divided line (S11).

  Next, the binary tree map data creation processing unit 21 uses the divided line division processing unit 212 to search for and extract an interior point having the maximum separation degree Smax among the separation degrees S of the interior points (S12).

  Next, the binary tree map data creation processing unit 21 bisects the divided line by the inner point extracted in step S12 by the divided line division processing unit 212 (S13). A line generated by dividing the line into two is extracted as a divided line, a line connecting the starting point of the divided lines and the inner point extracted in the process S12, and a extracted line is extracted in the process S12. The line connecting the inner point and the end point is referred to as a second divided line.

  Next, the binary tree map data creation processing unit 21 uses the creation processing unit 214 to draw data for drawing the line, and the parent and child corresponding to the line and the divided line (first and second divided lines). The binary tree data according to the first embodiment representing the correspondence between the relationship and the separation degree S (maximum separation degree Smax) of the inner points dividing the line is created and temporarily stored in the storage unit 14. (S14).

  By executing the processes S11 to S14, the divided line is divided into two by the inner point of the maximum separation degree Smax, whereby a tree structure (tree structure) having the divided line as a parent and the first and second divided lines as children. ) Is created, the processing from S11 to S14 is referred to as binary tree processing.

  Next, the binary tree map data creation processing unit 21 uses the line division processing unit 213 to determine whether or not an internal point exists in the first and second divided lines (S15).

  If the result of determination in step S15 is that there are internal points on both the first and second divided lines (both are present), the binary tree map data creation processing unit 21 uses the line division processing unit 213 to perform one division. The line is set as a new divided line and the other divided line is temporarily stored in the storage unit 14 (S21), and the process returns to process S11 to continue the binary tree process.

  If the result of determination in step S15 is that there is an inner point on one of the first and second divided lines (one is present), the binary tree map data creation processing unit 21 uses the line division processing unit 213 to The divided line where the point exists is set as a new divided line (S22), and the process returns to the process S11 to continue the binary tree process. Here, in the processing S21 and the processing S22, when the first division line is a new division line, the inner point of the first division line is the end point in the new division line, and the second division line Is a new split line, the inner point of the second split line is the starting point of the new split line. The same applies to processing S23 described later.

  Furthermore, if the result of determination in step S15 is that there are no interior points on both the first and second divided lines (no both), the binary tree map data creation processing unit 21 performs processing by the line division processing unit 213. Execute S16 and refer to the storage unit 14 to determine whether or not the divided lines that have not been subjected to the binary tree processing are stored in the storage unit 14, and the binary tree processing is completed for all the divided lines. Determine whether or not.

  As a result of the determination in step S16, when the binary tree processing has not been completed for all the divided lines (No), the binary tree map data creation processing unit 21 stores in the storage unit 14 by the line division processing unit 213. The stored divided tree unprocessed divided line is set as a new divided line (S23), the process is returned to step S11, and the binary tree processing is continued.

  On the other hand, if the result of determination in step S16 is that the binary tree processing has been completed for all the divided lines (Yes), the binary tree map data creation processing unit 21 executes the processing S17 by the creation processing unit 214. Then, the created binary tree data of each divided line is collected and stored as binary tree map data in the binary tree map data storage unit 34 of the storage unit 14 with a file name.

  Next, the binary tree map data creation processing unit 21 determines whether or not the binary tree map data has been created for all the lines constituting the original map data by the line division processing unit 213 (S18).

  If binary tree map data has not been created for all lines of the original map data as a result of the determination in step S18 (No), the binary tree map data creation processing unit 21 uses the line division processing unit 213 to In order to create binary tree map data for other lines of the original map data, the process is returned to the process S10, and the processes of the above-described processes S10 to S17 are continued.

  On the other hand, if the result of determination in step S18 is that binary tree data has been created for all original lines of the original map data (Yes), the binary tree map data creation processing unit 21 ends the process.

  By operating in this way, from the original map data, the binary tree map data creation / output device 1 outputs the data for drawing the divided line and the separation degree S (maximum separation degree) of the inner point dividing the divided line. Smax) and binary tree map data in a tree structure or table format representing the correspondence between the divided line and the parent-child relationship between the first and second divided lines can be created and stored. As such binary tree map data, as will be described later, data necessary for creating a map corresponding to the thinning-out degree T can be extracted at high speed.

  As can be seen from the above, binary tree map data generated from the original map data is subjected to binary tree processing for each line data constituting the original map data, and the resulting binary tree data is collected into a tree structure. It is a thing. Therefore, in order to describe the process shown in FIG. 2 more specifically, a specific example of creating binary tree data from one line data will be described below.

  FIG. 3 is a diagram showing lines. FIG. 3A shows a case where the contour of the entity on the ground is described by a similar and substantially contoured curve, and FIG. 3B shows a case where this curve is described by a broken line. 4 to 6 are diagrams for explaining the operation of creating binary tree map data in the binary tree map data creation / output device. 4A shows a case where a line (first divided line, original line) is divided at the first inner point, and FIG. 4B shows that the line is divided at the first inner point. In this case, the first and second dividing lines generated by the above are divided at the second inner point. FIG. 5A shows a case where the first and second divided lines generated by dividing the divided line at the second inner point are divided at the third inner point, and FIG. This is a case where the first and second divided lines generated by dividing the divided line at the third inner point are divided at the fourth inner point. FIG. 6A shows a case where the first and second divided lines generated by dividing the divided line at the fourth inner point are divided at the fifth inner point, and FIG. This is a case where the first and second divided lines generated by dividing the divided line at the fifth inner point are divided at the sixth inner point. FIG. 7 is a diagram showing binary tree map data expressed by a table according to the first embodiment. FIG. 8 is a diagram illustrating binary tree map data expressed in a tree structure according to the first embodiment.

For example, in the curve AB described in FIG. 3A in which the contour of the entity on the ground is similar to the outline, the inner point is set according to the degree of curve bending. For example, FIG. As shown in FIG. 16, 16 inner points P _{2 to} P ₁₇ are set. Here, P ₁ is assigned to the start point A and P ₁₈ is assigned to the end point B so that the start point A and the end point B of the curve AB are also expressed in the same manner as the inner point. By setting the inner points in this way, the curve AB is described by the broken line shown in FIG. 3B, and by obtaining the coordinate values of the points P _{1 to} P ₁₈ , the line data in the vector graphic data is obtained. Is created. The line data in the graphic data composed of the coordinate values of the points P _{1 to} P ₁₈ corresponds to the original map data.

When the binary tree map data creation / output device 1 operates to create binary tree map data from line data of graphic data consisting of the coordinate values of the respective points P _{1 to} P ₁₈ , the binary tree map of the arithmetic processing unit 11 is operated. data creation processing section 21 takes out the line data of the line P ₁ P ₁₈ in the processing S10 as the data of the division line, by executing the processing S11, as shown in FIG. 4 (a), the points P ₂ ~ to P _17, and calculates each distance D from the points P ₂ to P ₁₇ to the line passing through the start point P ₁ and the end point P ₁₈ as the degree of separation S. If the separation degree S of the inner point x is expressed by S (x), in this example, S (P ₂ ) = 6.4, S (P ₃ ) = 10.8, S (P ₄ ) = 8.4 , S (P ₅ ) = 1.2, S (P ₆ ) = 2.8, S (P ₇ ) = 5.0, S (P ₈ ) = 2.4, S (P ₉ ) = 5.6 , S (P ₁₀ ) = 9.4, S (P ₁₁ ) = 11.2, S (P ₁₂ ) = 9.8, S (P ₁₃ ) = 5.8, S (P ₁₄ ) = 1.2 , S (P ₁₅ ) = 4.8, S (P ₁₆ ) = 7.6, and S (P ₁₇ ) = 5.2.

Therefore, the binary tree map data creation processing unit 21 searches for and extracts the inner point P ₁₁ having the maximum degree of separation Smax = 11.2 by executing the processing S12. For this reason, the binary tree map data creation processing unit 21 executes the process S13 to bisect the divided line P ₁ P ₁₈ by the inner point P ₁₁ as shown in FIG. A line P ₁ P ₁₁ and a second divided line P ₁₁ P ₁₈ are generated. The binary tree map data creating unit 21 executes the process S14, and data for rendering the split line P ₁ P _18, the parting line P ₁ P ₁₈ and the first and second division line Binary tree data representing the correspondence between the parent-child relationship with P ₁ P ₁₁ and P ₁₁ P ₁₈ and the degree of separation S (P ₁₁ ) = 11.2 of the inner point P ₁₁ obtained by dividing the divided line P ₁ P _18. Is temporarily stored in the storage unit 14.

The binary tree data according to the first embodiment is stored in a table format as shown in FIG. 7, for example, as binary tree map data as it is. The binary tree map data table 101 shown in FIG. 7 includes a management number field 111 for registering a management number that is an identifier for identifying and specifying each record in the table, and a divided line field 112 for registering data related to the divided line. And a division line field 113 for registering data relating to division lines, and a record is created for each division line. The split line field 111 further includes a split line name subfield 121 for registering the name of the split line, which is an identifier for identifying and specifying the split line, and a start point for registering the coordinate value of the start point of the split line. Each of the subfields includes a coordinate subfield 122, an end point coordinate subfield 123 for registering the coordinate value of the end point in the divided line, and a separation degree subfield 124 for registering the separation degree S of the inner point dividing the divided line. Is done. The start point coordinate subfield 122 and the end point coordinate subfield 123 are configured by including subfields of an x coordinate subfield 131 and 133 and a y coordinate subfield 132 and 134, respectively. The division line field 113 is a first and second division line name subfield 125 for registering line names in the first and second division lines, which are identifiers for identifying and specifying the first and second division lines. , 126 subfields. The names of the line to be divided and the divided lines may be arbitrary codes (one or a plurality of symbol strings), but in the present embodiment, they are represented by a combination of codes representing the start point and end point of the line, for example, the start point of the line The name of the line of P ₁ and end point P ₁₈ is P ₁ P ₁₈ .

  Since the binary tree map data table 101 is configured in this way, the start point coordinate value and the end point coordinate value are registered in the start point coordinate subfield 122 and the end point coordinate subfield 123 as data for drawing the divided line, respectively. As the parent-child relationship between the split line and the split line, the split line name, the first split line name, and the second split line name are split line name subfield 121, first and second split line name subfields. 125, 126 are registered respectively, and the separation degree S of the inner point dividing the line to be divided is registered in the separation degree subfield 124, and these are registered in the same record to indicate the corresponding relationship.

Then, the binary tree map data creation processing unit 21 determines whether or not there is an interior point on the first and second divided lines P ₁ P ₁₁ and P ₁₁ P ₁₈ by executing the process S15. As a result of the determination, inner points P _{2 to} P ₁₀ exist in the first divided line P ₁ P ₁₁ and inner points P _{12 to} P ₁₇ exist in the second divided line P ₁₁ P _18. The map data creation processing unit 21 executes the process S21, for example, replaces the first divided line P ₁ P ₁₁ with a new divided line P ₁ P ₁₁ , returns the process to the process S11, and performs the second division. stores the name P ₁₁ P ₁₈ of the line P ₁₁ P ₁₈ in the storage unit 14.

Therefore, binary tree map data creating unit 21 executes the process S11, as shown in FIG. 4 (B), for each point P ₂ to P _10, starting from the points P ₂ to P ₁₀ The distance D to the line segment passing through P ₁ and the end point P ₁₁ is calculated as the separation degree S. In this example, S (P ₂ ) = 5.6, S (P ₃ ) = 8.8, S (P ₄ ) = 5.6, S (P ₅ ) = 2.8, S (P ₆ ) = 7.2, S (P ₇ ) = 10.4, S (P ₈ ) = 9.2, S (P ₉ ) = 3.2, S (P ₁₀ ) = 0.4.

Therefore, the binary tree map data creation processing unit 21 searches for and extracts the inner point P ₇ having the maximum degree of separation Smax = 10.4 by executing the processing S12. For this reason, the binary tree map data creation processing unit 21 executes the process S13 to bisect the divided line P ₁ P ₁₁ by the inner point P ₇ as shown in FIG. A line P ₁ P ₇ and a second divided line P ₇ P ₁₁ are generated. The binary tree map data creating unit 21 executes the process S14, and data for rendering the split line P ₁ P _11, the parting line P ₁ P ₁₁ and the first and second division line Binary tree data representing the correspondence between the parent-child relationship with P ₁ P ₇ and P ₇ P ₁₁ and the degree of separation S (P ₇ ) = 10.4 of the inner point P ₇ obtained by dividing the divided line P ₁ P ₁₁ Is temporarily stored in the storage unit 14.

Then, the binary tree map data creation processing unit 21 determines whether or not there is an interior point on the first and second divided lines P ₁ P ₇ and P ₇ P ₁₁ by executing the process S15. As a result of this determination, the inner points P _{2 to} P ₆ exist in the first divided line P ₁ P ₇ and the inner points P _{8 to} P ₁₁ exist in the second divided line P ₇ P _11. The map data creation processing unit 21 executes the process S21, for example, replaces the first divided line P ₁ P ₇ with a new divided line P ₁ P ₇ , returns the process to the process S11, and performs the second division. storing name P ₇ P ₁₁ of the line P ₇ P ₁₁ in the storage unit 14.

Therefore, binary tree map data creating unit 21 executes the process S11, as shown in FIG. 5 (A), for each point P ₂ to P _6, starting from the point P ₂ to P ₆ The distance D to the line segment passing through P ₁ and the end point P ₇ is calculated as the separation degree S. In this example, S (P ₂ ) = 6.6, S (P ₃ ) = 11.8, S (P ₄ ) = 10.6, S (P ₅ ) = 4.6, S (P ₆ ) = 1.2.

Therefore, the binary tree map data creation processing unit 21 searches for and extracts the inner point P ₃ having the maximum degree of separation Smax = 11.8 by executing the process S12. Therefore, the binary tree map data creation processing unit 21 executes the process S13 to bisect the divided line P ₁ P ₇ by the inner point P ₃ as shown in FIG. A line P ₁ P ₃ and a second divided line P ₃ P ₇ are generated. The binary tree map data creating unit 21 executes the process S14, and data for rendering the split line P ₁ P _7, the parting line P ₁ P ₇ and the first and second division line Binary tree data representing the correspondence between the parent-child relationship with P ₁ P ₃ and P ₃ P ₇ and the degree of separation S (P ₃ ) = 11.8 of the inner point P ₃ obtained by dividing the divided line P ₁ P ₇ Is temporarily stored in the storage unit 14.

Then, the binary tree map data creation processing unit 21 determines whether or not there is an interior point in the first and second divided lines P ₁ P ₃ and P ₃ P ₇ by executing step S15. As a result of this determination, the inner point P ₂ exists in the first divided line P ₁ P ₃ and the inner points P _{4 to} P ₆ exist in the second divided line P ₃ P _7. The processing unit 21 executes the process S21 to replace the first divided line P ₁ P ₃ with a new divided line P ₁ P ₃ , returns the process to the process S11, and also performs the second divided line P ₃ P _7. The name P ₃ P ₇ is stored in the storage unit 14.

Therefore, binary tree map data creating unit 21 executes the process S11, as shown in FIG. 5 (B), with respect to the point P _2, passing through the start point P ₁ and the end point P ₃ from the point P ₂ The distance D to the line segment is calculated as the separation degree S. In this example, S (P ₂ ) = 1.4.

Therefore, the binary tree map data creation processing unit 21 searches for and extracts the inner point P ₂ having the maximum degree of separation Smax = 1.4 by executing the processing S12. Therefore, the binary tree map data creation processing unit 21 executes the process S13 to bisect the divided line P ₁ P ₃ by the inner point P ₂ as shown in FIG. A line P ₁ P ₂ and a second divided line P ₂ P ₃ are generated. The binary tree map data creating unit 21 executes the process S14, and data for rendering the split line P ₁ P _3, the split line P ₁ P ₃ and the first and second division line Binary tree data representing the correspondence between the parent-child relationship with P ₁ P ₂ and P ₂ P ₃ and the degree of separation S (P ₂ ) = 1.4 of the inner point P ₂ obtained by dividing the divided line P ₁ P ₃ Is temporarily stored in the storage unit 14.

Then, the binary tree map data creation processing unit 21 determines whether or not there are internal points in the first and second divided lines P ₁ P ₂ and P ₂ P ₃ by executing step S15. As a result of this determination, since there are no interior points in both the first and second divided lines P ₁ P ₂ and P ₂ P ₃ , the binary tree map data creation processing unit 21 stores the memory by executing the process S16. By referring to the unit 14, it is determined whether or not the binary tree processing has been completed for all the divided lines. Since the storage unit 14 stores division line names P ₃ P ₇ , P ₇ P ₁₁ , and P ₁₁ P ₁₈ , the binary tree map data creation processing unit 21 performs binary tree processing for all division lines. By executing the process S23, the binary tree process stored in the storage unit 14 is changed to an unprocessed divided line, for example, the divided line P ₃ P ₇ as a new divided line. Replace and return the process to step S11. Here, when the names of the divided lines in the process S21 are stored in the storage unit 14, the names of the divided lines are stacked in order, and the divided lines to be replaced with the new divided lines in the process S23 are extracted in the last in first. -It is good also as Out (Last In First Out).

The divided lines P ₃ P ₇ , P ₇ P ₁₁ , and P ₁₁ P ₁₈ are processed in the same manner, and the binary tree map data creation processing unit 21 completes the binary tree processing for all the divided lines by executing the process S16. If it is determined that the binary tree map data table 101 shown in FIG. 7 is created and completed in the storage unit 14 for the line P ₁ P ₁₈ , it is stored in the binary tree map data storage unit 34 of the storage unit 14. The

When such a binary tree process on line P ₁ P ₁₈ is executed, the line data of the line P ₁ P ₁₈ is converted into binary tree map data binary tree map data table 101 shown in FIG.

Also, the name of the divided line and the separation degree S of the inner point that divides the divided line are assigned to the parent node that is the upper layer node, and the names of the first and second divided lines are branched from the parent node into two. Line segments connecting the parent node and the first and second child nodes with the parent-child relationship between the divided line and the first and second divided lines, respectively, assigned to the first and second child nodes that are the nodes of the lower layer Referring to a tree structure represented by “branch”, the binary tree map data obtained by converting the line data of the lines P ₁ P ₁₈ has the tree structure shown in FIG. The first parent node is called “root”, and the terminal node that does not branch into two is called “leaf”.

In the tree structure shown in FIG. 8, in the 0th hierarchy and the 1st hierarchy, the line P ₁ P ₁₈ is set as the root (root) of the tree structure. First, the line P ₁ P ₁₈ has a separation degree S (P ₁₁ ) = 11. 2 is divided into a child first division line P ₁ P ₁₁ and a second division line P ₁₁ P ₁₈ . In the first hierarchy and the second hierarchy, the first divided line P ₁ P ₁₁ is set as a new divided line P ₁ P ₁₁ and the parent, and the line P ₁ P ₁₁ is separated by S (P ₇ ) = 10.4. Is divided into a child first divided line P ₁ P ₇ and a second divided line P ₇ P ₁₁ , and the second divided line P ₁₁ P ₁₈ is used as a new divided line P ₁₁ P ₁₈ and a parent line. P ₁₁ P ₁₈ is divided into child first division line P ₁₁ P ₁₆ and second division line P ₁₆ P ₁₈ with a separation degree S (P ₁₆ ) = 9.8. In the second and third hierarchies, the first divided line P ₁ P ₇ is set as a new divided line P ₁ P ₇ and the parent, and the line P ₁ P ₇ has a separation degree S (P ₃ ) = 11.8. The first divided line P ₁ P ₃ and the second divided line P ₃ P ₇ are divided into the second divided line P ₇ P ₁₁ as a new divided line P ₇ P ₁₁ and the parent line P ₇ P ₁₁ is divided into a child first division line P ₇ P ₁₀ and a second division line P ₁₀ P ₁₁ with a separation degree S (P ₁₀ ) = 1.2. Then, the first divided line P ₁₁ P ₁₆ is set as a new divided line P ₁₁ P ₁₆ and the parent is used as a parent, and the line P ₁₁ P ₁₆ is a child first divided line with a separation degree S (P ₁₃ ) = 2.2. divided into P ₁₁ P _13, and the second parting line P ₁₃ P _16, the second parting line P ₁₆ P ₁₈ as a parent with a new object to be split line P ₁₆ P _18, line P ₁₆ P ₁₈ is the degree of separation S ( P ₁₇ ) = 1.6, which is divided into a child first division line P ₁₆ P ₁₇ and a second division line P ₁₇ P ₁₆ . In the third hierarchy and the fourth hierarchy, the first divided line P ₁ P ₃ is set as a new divided line P ₁ P ₃ and the parent, and the line P ₁ P ₃ has a separation degree S (P ₂ ) = 1.4. The first divided line P ₁ P ₂ and the second divided line P ₂ P ₃ are divided into the second divided line P ₃ P ₇ as a new divided line P ₃ P ₇ and the parent line P ₃ P ₇ is divided into child first division line P ₃ P ₆ and second division line P ₆ P ₇ with a separation degree S (P ₆ ) = 1.6. The first divided line P ₇ P ₁₀ is set as a new divided line P ₇ P ₁₀ and the parent, and the line P ₇ P ₁₀ has a degree of separation S (P ₈ ) = 1.4 and the child first divided line P _7. Divided into P ₈ and second dividing line P ₈ P ₁₀ . Then, the first divided line P ₁₁ P ₁₃ is set as a new divided line P ₁₁ P ₁₃ and the parent is used as a parent, and the line P ₁₁ P ₁₃ is a child first divided line with a separation degree S (P ₁₂ ) = 1.0. Divided into P ₁₁ P ₁₂ and second divided line P ₁₂ P ₁₃ , the second divided line P ₁₃ P ₁₆ is used as a new divided line P ₁₃ P ₁₆ and the line P ₁₃ P ₁₆ has a separation degree S ( P ₁₅ ) = 1.2, and the first divided line P ₁₃ P ₁₅ and the second divided line P ₁₅ P ₁₆ are divided. In the fourth layer and the fifth layer, the first divided line P ₃ P ₆ is set as a new divided line P ₃ P ₆ and the parent, and the line P ₃ P ₆ has a separation degree S (P ₄ ) = 1.2. The first divided line P ₃ P ₄ and the second divided line P ₄ P ₆ are divided. The second divided line P ₈ P ₁₀ is used as a new divided line P ₈ P ₁₀ and the parent, and the line P ₈ P ₁₀ is a child first divided line P ₈ with a separation degree S (P ₉ ) = 0.3. Divided into P ₉ and second dividing line P ₉ P ₁₀ . Then, the first divided line P ₁₃ P ₁₅ is set as a new divided line P ₁₃ P ₁₅ and the parent is used as a parent, and the line P ₁₃ P ₁₅ is a child first divided line with a separation degree S (P ₁₄ ) = 0.1. It is divided into P ₁₃ P ₁₄ and a second dividing line P ₁₄ P ₁₅ . In the fifth layer and the sixth layer, the second divided line P ₄ P ₆ is set as a new divided line P ₄ P ₆ and the parent, and the line P ₄ P ₆ has a separation degree S (P ₅ ) = 0.1. The first divided line P ₄ P ₅ and the second divided line P ₅ P ₆ are divided.

  The binary tree map data having such a tree structure is, for example, a memory address that stores the coordinate values of the start point and the end point for drawing the divided line, the degree of separation S, and the data of the first and second divided lines. Can also be expressed by storing them in one memory address, and the parent-child relationship is indicated by the mutual relationship of the memory addresses, and the memory address for storing the data of the divided line and the data of this divided line This is shown in relation to the memory address storing the data of the first and second divided lines. More specifically, the binary tree map data having a tree structure includes, for example, the coordinate values of the start point and the end point for drawing the split line in the structure by associating the nodes of the tree structure with the structure of the C language. The distance S is expressed by including a pointer variable for storing data of the first and second divided lines, and the parent-child relationship is indicated by the pointer.

FIG. 4B also shows the degree of separation S between the inner points P _{11 to} P _{18 in} the dividing line P ₁₁ P ₁₈ . FIG. 5A also shows the separation degree S of the inner points P _{8 to} P _{10 in} the dividing line P ₇ P ₁₁ , and the dividing line P ₁₁ P ₁₈ is divided at the inner point P ₁₆ of the maximum separation degree. The separation degree S of the inner points P _{12 to} P _{15 in} the division line P ₁₁ P ₁₆ and the separation degree S of the inner point P ₁₇ in the division line P ₁₆ P ₁₈ are also shown. FIG. 5B also shows the separation degree S of the inner points P _{4 to} P _{6 in} the dividing line P ₃ P ₇ , and the dividing line P ₇ P ₁₁ is divided at the inner point P ₁₀ of the maximum separation degree. And the separation degree S of the inner points P ₈ and P _{9 in} the division line P ₇ P ₁₀ are also shown, and the division line P ₁₁ P ₁₆ is divided at the inner point P ₁₃ of the maximum separation degree. state, the degree of separation S of the interior point P ₁₂ in the divided line P ₁₁ P _13, and, the degree of separation S of each interior point P ₁₂ to P ₁₅ in the divided line P ₁₃ P ₁₆ also shown, and, parting line P ₁₆ P A state is also shown in which ₁₈ is divided by an inner point P ₁₇ of the maximum separation degree. FIG. 6A shows that the dividing line P ₃ P ₇ is divided by the inner point P ₆ having the maximum separation degree, and the inner points P ₄ and P ₅ are separated in the dividing line P ₃ P ₆ . The degree S is also shown, and the dividing line P ₇ P ₁₀ is divided at the maximum separation degree inner point P ₈ , and the separation degree S of the inner point P ₉ in the division line P ₈ P ₁₀ is also shown, It is also shown that the dividing line P ₁₁ P ₁₃ is divided at the inner point P ₁₂ having the maximum separation degree, and the dividing line P ₁₃ P ₁₆ is divided at the inner point P ₁₅ having the maximum separation degree. and, the degree of separation S of the interior point P ₁₄ in the divided line P ₁₃ P ₁₅ are also shown. FIG. 6B shows a state in which the dividing line P ₃ P ₆ is divided at the inner point P ₄ having the maximum separation degree, and the separation degree S of the inner point P ₅ in the division line P ₄ P ₆ . Is shown, and the division line P ₈ P ₁₀ is divided at the maximum separation degree inner point P ₉ , and the division line P ₁₃ P ₁₅ is divided at the maximum separation degree inner point P _14. The situation is shown.

  Next, an operation in which the binary tree map data creation / output device 1 outputs a map corresponding to the thinning degree from the binary tree map data will be described.

  FIG. 9 is a flowchart showing an operation of outputting a map corresponding to the thinning-out degree from the binary tree map data in the binary tree map data creation / output device according to the first embodiment.

  For example, when the user causes the binary tree map data creation output device 1 to create binary tree map data by the above-described operation, or by installing from the recording medium on which the binary tree map data is recorded via the external storage unit 16 The binary tree map data according to the first embodiment is stored in the binary tree map data storage unit 34 of the storage unit 14. And the output map creation program which concerns on 1st Embodiment is called from the output map creation program memory | storage part 32 of the memory | storage part 14, and is executed, for example, a user maps according to the thinning degree T from binary tree original map data. When the map output start command is input from the input unit 12 to output the binary tree map data creation / output device 1, the output map creation processing unit 22 of the arithmetic processing unit 11 causes the binary tree map data storage unit of the storage unit 14. A map corresponding to the thinning degree T is output based on the binary tree map data stored in 34.

  That is, in FIG. 9, first, the output map creation processing unit 22 of the arithmetic processing unit 11 prompts the user to input the thinning degree T and accepts the thinning degree when the user inputs the thinning degree T from the input unit 12. (S30). Next, the output map creation processing unit 22 extracts the data of one line from the binary tree map data, and extracts the root data from the extracted line data as the first divided line data (S31). Here, in order to extract the root data from the binary tree map data, for example, a code (one or a plurality of symbol strings) indicating the root data is added to the root data, or the binary tree map data is specified. For example, root data may be registered in this area. For example, the binary tree map data table 101 shown in FIG. 7 is prepared for each line, and in each binary tree map data, the root data of the line is always registered in the record of management number 1.

  Next, the output map creation processing unit 22 compares the size relationship between the separation degree S and the thinning degree T in the data of the divided line, and whether or not the separation degree S in the data of the divided line is equal to or less than the thinning degree T. Is determined (S32).

  Here, when the separation degree S in the data of the divided line is larger than the thinning degree T, the inner point of the separation degree S is farther than the thinning degree from the line segment connecting the start point and the end point of the divided line. Therefore, it is necessary to draw the divided line by a broken line that breaks at the inner point of the degree of separation S. That is, it is necessary to determine whether or not the separation degree S in the data is equal to or less than the thinning-out degree T with respect to the division line of the division line. On the other hand, when the separation degree S in the data of the divided line is equal to or smaller than the thinning degree T, the inner point of the divided line is a separation degree equal to or smaller than the thinning degree T from the line segment connecting the start point and the end point of the divided line. Since they are separated only by S, the inner point of the divided line may be thinned out. That is, the inner point of the divided line may not be used as drawing data, and the divided line may be drawn by a line segment connecting the start point and the end point of the divided line.

  Accordingly, if the result of determination in process S32 is that the separation degree S in the data of the divided line is larger than the thinning degree T (No), the output map creation processing unit 22 sets the divided line of the divided line as unprocessed data. Is stored in the storage unit 14 (S33). Then, the output map creation processing unit 22 extracts one divided line from the unprocessed data stored in the storage unit 14, replaces the extracted divided line with a new divided line (S34), and processes the process S32. Return to. By operating in this way, it is determined whether or not the inner point of the divided line can be thinned out according to the thinning degree T of the user. The depth priority search is performed in order toward the hierarchy.

  Here, when the division line in process S33 is stored in the storage unit 14 as unprocessed data, the line names in the division line are sequentially stacked, and the division line to be replaced with the new division line in process S34 is extracted in the last.・ It may be in first out.

  On the other hand, as a result of the determination in the process S32, when the separation degree S in the binary tree data of the divided line is equal to or less than the thinning degree T, the output map creation processing unit 22 thins out the inner point of the divided line, The coordinate values of the start point and end point of the divided line are output to the output unit 13 (S41). The output unit 13 draws a line segment connecting the start point and the end point. By operating in this way, the divided line is output by thinning out the inner point of the divided line, and for each divided line included in the divided line, the inner point of the divided line is set to the user's thinning degree. There is no need to determine whether it is necessary to thin out correspondingly. In terms of the tree structure, it is not necessary to determine whether or not it is necessary to thin out the divided lines in the lower hierarchy at the end of the hierarchy of the divided line according to the thinning degree T of the user. That is, the data processing time is omitted, and a map corresponding to the thinning degree T of the user is output at high speed.

  Then, the output map creation processing unit 22 determines whether there is unprocessed data in the division line (S42). If there is unprocessed data as a result of the determination in step S42 (Yes), the output map creation processing unit 22 extracts one division line from the unprocessed data stored in the storage unit 14, and the extracted division The line is replaced with a new divided line (S43), and the process returns to the process S32. On the other hand, if there is no unprocessed data as a result of the determination in step S42 (No), the output map creation processing unit 22 has not performed the thinning-out processing of the above-described processing S32 to S34 and processing S41 to S43. It is determined whether there is a line in the binary tree map data (S35).

  If the result of determination in step S35 is that there is an unprocessed line in the binary tree map data (Yes), the output map creation processing unit 22 executes the thinning process on other lines of the binary tree map data. Accordingly, the process is returned to the process S32, and the processes of the above-described processes S32 to S34 and processes S41 to S43 are continued. On the other hand, as a result of the determination in step S35, if there is no unprocessed line in the binary tree map data (No), the output map creation processing unit 22 ends the process.

  By operating in this manner, the binary tree map data creation / output device 1 can output a map corresponding to the thinning degree T of the user from the binary tree map data. When the binary tree map data creation / output device 1 outputs the split line (original line and split line) of the map, the separation degree S of the inner points dividing the split line and the thinning degree T input by the user. If the separation degree S is equal to or less than the thinning-out degree T, the inner points of the divided lines are thinned out corresponding to the thinning-out degree T of the divided lines included in the divided line. There is no need to decide whether or not it is necessary. Therefore, the binary tree map data creation / output device 1 can omit the data processing time and can output a map corresponding to the thinning degree T of the user at high speed. For this reason, the user can easily obtain a map thinned out according to the purpose of use by the binary tree map data creation output device 1 at high speed. Then, by appropriately associating the thinning-out degree T and the scale, the binary tree map data creation / output device 1 can easily create a map of any scale at high speed. Further, by appropriately associating the thinning-out degree T with the size, the binary tree map data creation / output device 1 can easily create a map according to an arbitrary size at high speed. Furthermore, by appropriately associating the thinning-out degree T with the resolution, the binary tree map data creation / output device 1 can easily create a map corresponding to an arbitrary resolution at high speed.

  As can be seen from the above, the map created according to the degree of thinning from the binary tree map data is subjected to thinning processing on each line data constituting the binary tree map data, and each divided line ( The original line and the divided line) are output in order. Therefore, in order to describe the process shown in FIG. 9 more specifically, a case where one line is output using the binary tree map data table 101 shown in FIG. 7 as a specific example will be described below.

  FIG. 10 is a diagram illustrating a state of the divided lines stored as unprocessed data in the storage unit 14. FIG. 11 is a diagram illustrating a line after the thinning process.

When the binary tree map data creation / output device 1 operates to output a map corresponding to the thinning degree from the binary tree map data shown in FIG. 7, the output map creation processing unit 22 of the arithmetic processing unit 11 executes the process S30. . For example, when the decimation degree T = 5 is input in the process S30, the output map creation processing unit 22 executes the process S31 to extract the root data of the line P ₁ P ₁₈ as the divided line data. In the example shown in FIG. 7, data in the record with the management number 1 is extracted from the binary tree map data table 101.

Then, the output map creation processing unit 22 executes the process S32 so that the separation degree S (P ₁₁ ) = 11.2 in the data of the taken-out divided line P ₁ P ₁₈ is the thinning degree T = 5 or less. Judge whether there is. As a result of the determination, since the separation degree S is larger than the thinning degree T, the output map creation processing unit 22 executes the process S33 to thereby obtain the first and second divided lines from the data of the divided line P ₁ P _18. P ₁ P ₁₁ and P ₁₁ P ₁₈ are stored in the storage unit 14 (see FIG. 10A). Next, the output map creation processing unit 22 executes the process S34, thereby dividing the divided lines P ₁ P ₁₁ and P ₁₁ P ₁₈ stored in the storage unit 14 into, for example, last-in-first-out divided lines. removed P ₁ P ₁₁ (see FIG. 10 (B)), replacing the parting line P ₁ P ₁₁ that the take-out to the new the split line P ₁ P _11, returns the process to S32.

The process is returned, and the output map creation processing unit 22 executes the process S32 so that the separation degree S (P ₇ ) = 10.4 in the data of the divided line P ₁ P ₁₁ is less than the thinning degree T = 5. It is determined whether or not. As a result of the determination, since the separation degree S is larger than the thinning degree T, the output map creation processing unit 22 executes the process S33 to thereby obtain the first and second divided lines from the data of the divided line P ₁ P _11. P ₁ P ₇ and P ₇ P ₁₁ are stored in the storage unit 14 (see FIG. 10C). Next, the output map creation processing unit 22 executes, for example, the divided line P ₁ P from the divided lines P ₁ P ₇ , P ₇ P ₁₁ , and P ₁₁ P ₁₈ stored in the storage unit 14 by executing the process S34. ₇ was removed (see FIG. 10 (D)), replacing the parting line P ₁ P ₇ taken out to the new the split line P ₁ P _7, returns the processing to S32.

The process is returned, and the output map creation processing unit 22 executes the process S32 so that the separation degree S (P ₃ ) = 11.8 in the data of the line P ₁ P ₇ is equal to or less than the thinning degree T = 5. Determine whether or not. As a result of the determination, since the separation degree S is larger than the thinning degree T, the output map creation processing unit 22 executes the process S33 to thereby obtain the first and second divided lines from the data of the divided line P ₁ P _7. P ₁ P ₃ and P ₃ P ₇ are stored in the storage unit 14 (see FIG. 10E). Next, the output map creation processing unit 22 executes, for example, the processing line S34, from the division lines P ₁ P ₃ , P ₃ P ₇ , P ₇ P ₁₁ , P ₁₁ P ₁₈ stored in the storage unit 14. the parting line P ₁ P ₃ extraction (see FIG. 10 (F)), replacing the parting line P ₁ P ₃ taken out to the new the split line P ₁ P _3, the process returns to S32.

The process is returned, and the output map creation processing unit 22 executes the process S32 so that the separation degree S (P ₂ ) = 1.4 in the data of the line P ₁ P ₃ is equal to or less than the thinning degree T = 5. Determine whether or not. As a result of the determination, since the separation degree S is smaller than the thinning degree T, the output map creation processing unit 22 executes the process S41 to thereby obtain the coordinate value ( ₁₎ of the start point P ₁ from the data of the divided line P ₁ P _3. x _1, y ₁₎ and the coordinate values of the end point P ₃ and (x _3, y ₃₎ is taken out, and outputs a line segment connecting the start point P ₁ and the end point P ₃ to the output unit 13. Next, the output map creation processing unit 22 determines whether or not a divided line is stored as unprocessed data in the storage unit 14 by executing step S42. As a result of the determination, since the divided lines P ₃ P ₇ , P ₇ P ₁₁ , and P ₁₁ P ₁₈ are stored in the storage unit 14, it is determined that there is a divided line as unprocessed data, and the output map creation processing unit 22 executes processing S43 to take out, for example, the dividing line P ₃ P ₇ (see FIG. 10G), and replaces the taken out dividing line P ₃ P ₇ with a new divided line P ₃ P ₇ . The process returns to S32.

The processing is returned, and the divided lines P ₃ P ₇ , P ₇ P ₁₁ , and P ₁₁ P ₁₈ as unprocessed data are processed in the same manner, so that the storage contents of the storage unit 14 are shown in FIG. while changes in the sequence to 10 (L), the line segment connecting the start point P ₃ and the end point P ₇ of parting line P ₃ P _7, line segment connecting the starting point P ₇ and the end point P ₁₁ of the parting line P ₇ P _11, division lines line segment connecting the start point P ₁₁ and the end point P ₁₆ of P ₁₁ P _16, the line segment connecting the start point P ₁₆ and the end point P ₁₈ of the parting line P ₁₆ P ₁₈ is output to the output section 13 in this order. 10 (I) and 10 (L) show a state in which the division line as unprocessed data is not stored in the storage unit 14.

The line P ₁ P ₁₈ shown in FIG. 3B is processed in this manner based on the binary tree map data table 101 shown in FIG. 7, so that the thinning degree T = 5 is shown in FIG. As described above, the divided line P ₁ P ₃ , the divided line P ₃ P ₇ , the divided line P ₇ P ₁₁ , the divided line P ₁₁ P ₁₆ and the divided line P ₁₆ P ₁₈ are output to the output unit 13 as line segments and drawn. Is done.

  Here, when the tree-structured binary tree map data is expressed using a C language structure, for example, the separation degree S at the corresponding node from the root of the tree structure toward the terminal leaf in one branch The data of each node is traced while comparing with the thinning degree T. When the separation degree S becomes equal to or less than the thinning degree T as a result of the comparison, an output is made to draw the divided line in the data of the node, and an unprocessed branch Go up to a node in the upper hierarchy with. In order to process this unprocessed branch, similarly, the data of each node is traced toward the terminal leaf while comparing the separation degree S and the thinning degree T at the relevant node. When the temperature becomes T or less, the divided line in the data of the node is output to be drawn, and the node goes up to a node in an upper layer having an unprocessed branch. By repeating such processing until there is no unprocessed branch, an operation for outputting a map corresponding to the thinning degree T from the binary tree map data is performed. At this time, since only the node corresponding to the output line and the node positioned higher than that are searched, the number of steps required for the calculation can be suppressed to a number approximately proportional to the number of lines to be output. When tree-structured binary tree map data is expressed using a C language structure, the parent-child relationship can be traced using a pointer, so that a map corresponding to the thinning-out degree T can be obtained from the binary tree map data at a higher speed. It is possible to output with only the calculation amount approximately proportional to the size.

Next, another embodiment will be described.
(Configuration of Second Embodiment)
In the binary tree map data creation / output device 1 according to the first embodiment described above, the binary tree map data only needs to include data for the lines and the divided lines that are the divided lines. In the tree structure when outputting a map, it is necessary to thin out each data by depth-first search from the root data to the lower hierarchy in the tree structure, which improves the data processing efficiency There is room to do.

  Therefore, when creating binary tree map data from the original map data, the binary tree map data creation / output device 2 according to the second embodiment applies to the tree-structured binary tree map data created as described above. Further, each separation degree S in the tree structure is separated when dividing the divided line into first and second divided lines from a parent (from a line (root)) to a divided line (leaf) having no interior point to a descendant. When the degree S is traced sequentially, the binary tree map is replaced with the maximum value of the degree of separation S on the descendant side including the degree of separation S when the division is performed, and the data of the line and all the divided lines are provided. When the data is composed and a map corresponding to the thinning degree T is output based on the binary tree map data, the thinning degree T is compared with the parent separation degree Sp and the child separation degree Sc described later in the line and each divided line. And given By extracting the lines and dividing lines satisfy the matter, and outputs a map corresponding to the thinning of T.

  Therefore, the binary tree map data creation / output device 2 according to the second embodiment includes the binary tree map data creation program storage unit 31 and the output map creation program in the binary tree map data creation / output device 1 according to the first embodiment. Instead of the storage unit 32, a binary tree map data generation program storage unit 51 and an output map generation program storage for storing a binary tree map data generation program and an output map generation program according to the second embodiment that operate as described below, respectively. A binary tree according to the second embodiment is provided instead of the binary tree map data creation processing unit 21 and the output map creation processing unit 22 in the binary tree map data creation output device 1 according to the first embodiment. A map data creation processing unit 41 and an output map creation processing unit 42 are provided, and binary tree map data creation according to the first embodiment A binary tree map data storage unit 54 for storing binary tree map data (described later) created by the binary tree map data creation processing unit 41 is provided in place of the binary tree map data storage unit 34 in the force device 1, except that Since it is the same as that of the structure of the binary tree map data creation output device 1 which concerns on 1 embodiment, the description is abbreviate | omitted.

  The binary tree map data creation processing unit 41 according to the second embodiment creates the binary tree map data according to the second embodiment from the original map data by the operation described later. Each coordinate value of the start point and end point in the division line, the separation degree S when generating the divided line as the parent separation degree Sp, and the division line between the start point and the end point of the division line as the child separation degree Sc The maximum separation degree Smax among the separation degrees S of the existing internal points, and the first and second divided lines generated by dividing the divided line into two at the internal point having the maximum separation degree Smax, It is provided with a parent-child relationship information representing a parent-child relationship that is a correspondence relationship with the split line that generated the split line, and the split line is between each coordinate value of the start point and the end point and the start point and the end point. A line that can be represented by a line on the map with the coordinate value of the internal point on the line, and all that are generated by dividing the line to be divided into two at the internal point having the greatest degree of separation The parent separation degree Sp and the child separation degree Sc are the first and second divided lines, and the divided line from the parent to the descendant from the line to the divided line having no inner point is changed to the first and second divided lines. When the separation degree S at the time of division is sequentially traced, the binary according to the second embodiment is a value that is replaced with the maximum value of the separation degree S on the descendant side including the separation degree S at the time of division. Creates tree map data. More specifically, the binary tree map data creation processing unit 41, for example, in this embodiment, the separation degree calculation unit 211, the divided line division processing unit 212, the line division processing unit 213, and the divided line division The maximum separation degree Smax when dividing the divided line by the processing unit 212 is set as the child separation degree Sc and the separation degree S when generating the divided line is set as the parent separation degree Sp, and the parent separation degree Sp and the child separation degree When the degree Sc is sequentially traced by the separation degree S when the divided line is divided into the first and second divided lines from the parent to the descendant from the line to the divided line having no interior point, In place of the replacement processing unit 415 (shown by a broken line in FIG. 1) and the creation processing unit 214 in the first embodiment, the replacement processing unit 415 replaces with the maximum value of the descending side separation degree S including the separation degree S of All split lies The coordinate values of the start point and the end point in FIG. 5, the parent separation degree Sp processed by the replacement processing unit 415, the child separation degree Sc processed by the replacement processing unit 415, and the first generated by the divided line division processing unit 212 A creation processing unit 414 that creates binary tree map data that includes parent-child relationship information that represents a parent-child relationship that is a correspondence relationship between the first and second divided lines and the divided line that generated the divided line. .

  Further, the output map creation processing unit 42 according to the second embodiment creates a map according to the thinning degree T based on the binary tree map data by the operation described later, and outputs the created map to the output unit 13. The parent separation degree Sp and the child separation degree Sc of the divided line are sequentially compared with the thinning degree T inputted at the input unit 12, and as a result of comparison, the parent separation degree Sp larger than the thinning degree T is obtained. In addition, each coordinate value of the start point and the end point in the divided line having a child separation degree Sc equal to or less than the thinning-out degree T is acquired and output to the output unit 13.

Next, the operation of this embodiment will be described.
(Operation of Second Embodiment)
First, the operation in which the binary tree map data creation / output device 2 creates binary tree map data from the original map data will be described.

  FIG. 12 is a flowchart showing an operation of creating binary tree map data in the binary tree map data creation / output device according to the second embodiment. FIG. 13 is a flowchart showing the operation of the degree-of-separation replacement process in the binary tree map data creation / output device according to the second embodiment. FIG. 14 is a diagram illustrating binary tree map data (before replacement processing) expressed by a table according to the second embodiment. FIG. 15 is a diagram illustrating binary tree map data (after replacement processing) expressed by a table according to the second embodiment. FIG. 16 is a diagram illustrating binary tree map data expressed in a tree structure according to the second embodiment.

  For example, as in the first embodiment, the original map data is stored in the original map data storage unit 33 of the storage unit 14, and the binary tree map data generation program is stored in the binary tree map data generation program storage unit 51 of the storage unit 14. When called and executed, and the user inputs a binary tree map data creation start command from the input unit 12, the binary tree map data creation processing unit 41 of the arithmetic processing unit 11 is stored in the original map data storage unit 33 of the storage unit 14. Binary tree map data is created based on the stored original map data.

  That is, in FIG. 12, first, the binary tree map data creation processing unit 41 of the arithmetic processing unit 11 uses the original map data to convert the line data of the original map data into binary tree map data by the line division processing unit 213. One line data is taken out (S50).

  Subsequently, the binary tree map data creation processing unit 41 executes a process of calculating the degree of separation of each interior point (S51), a process of searching for and extracting the interior point of the maximum degree of separation (S52), and a line bisection. The processing (S53) is the same as the processing S11, processing S12 and processing S13 executed by the binary tree map data creation processing unit 21 in the first embodiment described above with reference to FIG. To do.

  Then, the binary tree map data creation processing unit 41 uses the creation processing unit 414 to draw data for drawing the line, the relationship between the line and the divided line (first and second divided lines), the line According to the second embodiment, the correspondence between the separation degree S (parent separation degree Sp) of the inner point and the separation degree S (child separation degree Sc) of the inner point dividing the line is generated. Binary tree data is created and temporarily stored in the storage unit 14 (S54).

  The binary tree data according to the second embodiment is stored in a table format as shown in FIGS. 14 and 15, for example, as binary tree map data as it is. The binary tree map data tables 201 ′ and 201 shown in FIGS. 14 and 15 register a management number field 211 for registering a management number which is an identifier for identifying and specifying each record in the table, and registers data related to the divided line. The divided line field 212, the parent-child relationship field 213 for registering data relating to the parent-child relationship for the divided line, and the separation degree field 214 for registering data relating to the separation degree S for the divided line are provided. Then, a record is created for each line and all divided lines. The split line field 212 further includes a split line name subfield 221 for registering the name of a line that is an identifier for identifying and specifying the split line, and a start point coordinate for registering the coordinate value of the start point of the split line. Each subfield includes a subfield 222 and an end point coordinate subfield 223 for registering the coordinate value of the end point in the divided line. The start point coordinate subfield 222 and the end point coordinate subfield 223 are configured to include subfields of x coordinate subfields 231 and 233 and y coordinate subfields 232 and 234, respectively. Further, the parent-child relationship field 213 is a line that is an identifier for identifying and specifying a divided line (parent line) that has generated the divided line by being divided into two at the inner point of the maximum separation degree Smax. A divided line name subfield 224 for registering the name of the divided line, and a divided line subfield 225 for registering data relating to the first and second divided lines (child lines) generated by dividing the divided line into two. Each subfield is configured. The divided line subfield 225 includes subfields of first and second divided line name subfields 235 and 236 for registering the names of lines that are identifiers for identifying and specifying the first and second divided lines. Composed. The separation degree field 214 further includes a parent separation degree subfield 226 for registering a separation degree (parent separation degree Sp) of an inner point obtained by dividing the divided line into two when the divided line is generated, and the divided part. Each of the sub-fields is a sub-field sub-field 227 for registering the inner-point separation degree (child separation degree Sc) for dividing the line into two. For the first line that is the root of the tree structure, the split line name and the parent separation degree Sp do not exist, and therefore, a code indicating that no value exists in the split line name subfield 224, For example, “*” is temporarily stored in the storage unit 14, and a sufficiently large value such as “99999” is stored in the parent separation degree subfield 226 so as not to be input from the input unit 12 as the thinning degree T. It is temporarily stored in the storage unit 14.

  Since the binary tree map data tables 201 ′ and 201 are configured in this way, the start point coordinate value and the end point coordinate value are stored in the start point coordinate subfield 222 and the end point coordinate subfield 223 as data for drawing the divided line. The names of the divided lines are registered as parent-child relationships between the divided lines and the divided lines, and the names of the first and second divided lines are the divided line name subfield 224, the first and second divided line name subfields, respectively. 235 and 236, and the parent separation degree Sp and the child separation degree Sc are registered in the parent separation degree subfield 226 and the child separation degree subfield 227, respectively, and these are registered in the same record. The relationship is shown.

  Subsequently, the process executed by the binary tree map data creation processing unit 41 to determine whether or not an internal point exists in the first and second divided lines (S55). As a result of the determination in this process S55, both internal points If one exists as a new divided line and the other is temporarily stored (S61), the result of the determination in S55 is that there is an internal point (one is present). The process (S62) in which the divided line where the inner point exists in () is a new divided line (S62) is executed by the binary tree map data creation processing unit 21 in the first embodiment described above with reference to FIG. Since the processing is the same as the processing S21 and the processing S22, description thereof will be omitted.

  On the other hand, if the result of determination in step S55 is that there are no internal points on both the first and second divided lines (both are not present), the binary tree map data creation processing unit 41 executes step S56 and step S53. Binary tree data similar to the processing S54 with regard to the first and second divided lines generated by dividing the divided line by the inner point of the maximum separation degree in FIG. Is created, temporarily stored in the storage unit 14, and the process S57 is executed. Note that the division line in this process S56 is a division line that has no inner point and cannot be further divided, so the name of the division line to be registered in the division line subfield 225 and the child separation degree sub Since there is no child separation degree Sc to be registered in the field 227, a code indicating that no value exists, for example, “*”, for example, “*” is temporarily stored in the storage unit 14 in the division line subfield 225, In the degree subfield 227, “0” is temporarily stored in the storage unit 14.

  Subsequently, the binary tree map data creation processing unit 41 determines whether or not the binary tree process has been completed for all the divided lines in the process S57. As a result of the determination in the process S57, the binary tree process is completed. If not (No), a split line that has not been processed by the binary tree process is set as a new split line (S63), and if the result of the determination in S57 is that the binary tree process has ended (Yes) The processing (S58) of storing the binary tree data of each line data in the binary tree map data storage unit 54 as binary tree map data (S58) in the first embodiment described above with reference to FIG. Since it is the same as the process S16, the process S23, and the process S17 executed by the creation processing unit 21, the description thereof is omitted.

  Subsequent to the processing S58, the binary tree map data creation processing unit 41 executes a replacement process of the separation degree S that replaces each separation degree in the tree structure with the maximum value in the descendant side including the separation degree S (S59). ). The replacement process of the degree of separation S will be described later.

  Next, the binary tree map data creation processing unit 41 determines whether binary tree map data has been created for all the lines constituting the original map data (S60).

  If binary tree map data has not been created for all the lines of the original map data as a result of the determination in this process S60 (No), the binary tree map data creation processing unit 41 uses other lines of the original map data. In order to create binary tree map data for, the processing is returned to the processing S50, and the processing of the above-described processing S50 to S59 is continued.

  On the other hand, if the result of determination in step S60 is that binary tree data has been created for all lines of the original map data (Yes), the binary tree map data creation processing unit 41 ends the process.

  By executing such processing, the binary tree map data creating / outputting device 2 according to the second embodiment can generate data for drawing the divided line and the parent divided line that generated the divided line. And a binary tree map data in a tree structure or table format representing the correspondence between the parent-child relationship of the first and second divided lines generated from the split line and the parent separation degree Sp and the child separation degree Sc. Can be remembered. As such binary tree map data, as will be described later, data necessary for creating a map corresponding to the thinning-out degree T can be extracted at high speed. For example, the binary tree map data table 201 ′ before the replacement process shown in FIG. 14 is generated for the line shown in FIG. 3B, and the binary tree after the replacement process shown in FIG. A map data table 201 is generated.

  Here, the replacement process of the separation degree S will be described. In FIG. 13, the binary tree map data creation processing unit 41 searches the binary tree map data in the line being processed stored in the binary tree map data storage unit 54 for terminal (leaf) binary tree data in the tree structure. And extracting (S71). This search is performed by, for example, a code indicating that no value exists in the divided line subfield 225 (first and second divided line name subfields 235 and 236) in the parent-child relationship field 213 in the binary tree map data table 201 ′, as described above. In this example, it can be performed by searching for a record in which “*” is registered. Alternatively, this search is performed by, for example, a record in which a code indicating that there is no value in the child separation degree subfield 227 in the separation degree field 214 in the binary tree map data table 201 ′, “0” in the above example is registered. Can be done by searching.

  Next, the binary tree map data creation processing unit 41 determines whether or not the child separation degree Sc in the extracted leaf binary tree data is larger than the parent separation degree Sp (S72). As a result of this determination, if the child separation degree Sc is not greater than the parent separation degree Sp (No), that is, if the child separation degree Sc is equal to or less than the parent separation degree Sp, the binary tree map data creation processing unit 41 Then, a process S74 described later is executed. On the other hand, as a result of this determination, when the child separation degree Sc is larger than the parent separation degree Sp (Yes), the binary tree map data creation processing unit 41 replaces the parent separation degree Sp with the child separation degree Sc and the replacement. The parent separation degree Sp and the child separation degree Sc in other records having the parent separation degree Sp as the parent separation degree Sp or the child separation degree Sc are also replaced (S73), and the process S74 is executed.

  In the process S74, the binary tree map data creation processing unit 41 refers to the divided line name subfield 224 of the parent-child relationship field 213, so that the binary tree data of the parent (one level above) the binary tree data being processed. Search for and extract.

  Next, the binary tree map data creation processing unit 41 determines whether or not the extracted parent binary tree data is a root in the tree structure (S75). This determination can be made, for example, by determining whether or not a code indicating that no value exists in the split line name subfield 224 of the parent-child relationship field 213, that is, “*” in the above example is registered. it can. Alternatively, this determination is made, for example, by determining whether or not a code indicating that no value exists in the parent separation degree subfield 226 of the separation degree field 214, that is, “99999” in the above example is registered. Can do.

  As a result of this determination, if the parent binary tree data is not a root in the tree structure (No), the binary tree map data creation processing unit 41 further performs a process S72 to perform a replacement process of the degree of separation S. Return to. On the other hand, as a result of the determination, when the binary tree data of the parent is the root in the tree structure (Yes), the binary tree map data creation processing unit 41 executed the process on the binary tree data of all the leaves. Whether or not (S76).

  If the result of determination in step S76 is that processing has not been performed on all leaf binary tree data, the binary tree map data creation processing unit 41 further separates from other leaf binary tree data. In order to perform the replacement process of degree S, the process returns to process S71. on the other hand. If the result of determination in step S76 is that processing has been executed for all leaf binary tree data, the binary tree map data creation processing unit 41 ends this separation degree S replacement processing.

By executing such processing, the binary tree map data creation / output device 2 according to the second embodiment, for example, replaces the binary tree map data table 201 ′ before the replacement processing shown in FIG. 14 with the replacement shown in FIG. A binary tree map data table 201 after processing is generated. As can be seen by comparing the binary tree map data table 201 ′ before the replacement process shown in FIG. 14 and the binary tree map data table 201 after the replacement process shown in FIG. 15, each record of the management numbers “1” to “5”. The value of the separation degree S in (shown by an arrow in the figure) is replaced. Further, when the binary tree map data shown in FIG. 15 is shown in a tree structure, the tree structure shown in FIG. 16 is obtained, and the separation degree S of the nodes P ₁ P ₁₁ is replaced from “10.4” to “11.8”. The degree of separation of the node P ₁ P ₁₈ is replaced from “11.2” to “11.8”.

  By operating in this way, from the original map data, the binary tree map data creation output device 2 obtains the name of the line for drawing the divided line and the maximum degree of separation Smax when dividing the divided line. A half of the tree structure in which the divided line is a parent and the first and second divided lines are children, and the separation degree S in the tree structure is replaced with the maximum value in the descendant side including the separation degree S Tree map data can be created and stored.

  Next, the operation in which the binary tree map data creation / output device 2 outputs a map corresponding to the thinning degree from the binary tree map data will be described.

  FIG. 17 is a flowchart showing an operation of creating binary tree map data in the binary tree map data creation / output device according to the second embodiment.

  For example, when the user causes the binary tree map data creation / output device 2 to create binary tree map data by the above-described operation, the binary tree map data according to the second embodiment is stored in the binary tree map data storage unit of the storage unit 14. 54. And the output map creation program which concerns on 2nd Embodiment is called from the output map creation program memory | storage part 52 of the memory | storage part 14, and is executed, for example, a user maps according to the thinning degree T from binary tree original map data. When the map output start command is input from the input unit 12 to output the binary tree map data creation / output device 2, the output map creation processing unit 42 of the arithmetic processing unit 11 causes the binary tree map data storage unit of the storage unit 14 to be output. Based on the binary tree map data stored in 54, a map corresponding to the thinning degree T is output.

  That is, in FIG. 17, first, the output map creation processing unit 42 of the arithmetic processing unit 11 prompts the user to input the thinning degree T, and the user inputs the thinning degree T from the input unit 12. Accept (S80).

  When the thinning-out degree T is input by the user, the output map creation processing unit 42 extracts one line of data from the binary tree map data (S81). For example, a binary tree map data table 201 shown in FIG. 15 is prepared for each line, and one binary tree map data table 201 is taken out.

  Next, the output map creation processing unit 42 selects and extracts data of one divided line from the extracted binary tree map data (S82). For example, in the binary tree map data table 201 shown in FIG. In the first embodiment, as described in step S31, it is necessary to always select the record for registering the root data of the tree structure, that is, the record having the management number “1” in the above description. In particular, in the embodiment, it is not always necessary to first select the record of the root data, and the processing described later may be executed on the data of all records. For this reason, it is easier to handle binary tree map data than in the first embodiment.

  Next, the output map creation processing unit 42 compares the parent separation degree Sp and the child separation degree Sc in the data of the extracted record with the thinning degree T, and the parent separation degree Sp in this data is greater than the thinning degree T. It is determined whether or not the child separation degree Sc is equal to or smaller than the thinning-out degree T (S83).

  Here, in the second embodiment, the parent separation degree Sp and the child separation degree Sc in the divided line (the original line and the dividing line) are the descendant side separation degrees S and the child separation degree of the divided line as described above. Since the value is not more than Sc, when the parent separation degree Sp is equal to or less than the thinning degree T or the child separation degree Sc is larger than the thinning degree T, the divided line may be thinned. That is, the divided line may not be used as drawing data.

  Therefore, as a result of the determination in the process S83, when the parent separation degree Sp in this data is equal to or less than the thinning degree T or the child separation degree Sc is larger than the thinning degree T (No), the output map creation processing unit 42 On the other hand, if the parent separation degree Sp in this data is larger than the thinning degree T and the child separation degree Sc is equal to or smaller than the thinning degree T (Yes), the output map creation processing unit 42 Outputs the respective coordinate values of the start point and end point of the data to the output unit 13 (S84), and then executes the process S85. The output unit 13 draws a line segment connecting the start point and the end point.

  Then, the output map creation processing unit 42 determines whether there is unprocessed divided line data. If there is unprocessed divided line data as a result of the determination (Yes), the output map creation processing unit 42 returns the process to step S82. On the other hand, if the result of the determination is that there is no unprocessed divided line data (No), the output map creation processing unit 42 determines whether there is a line that has not been subjected to the above-described thinning-out process S82 to S85. Is determined (S86).

  As a result of the determination in the process S86, if there is a line that has not been subjected to the thinning process (Yes), the output map creation processing unit 42 returns the process to the process S81 to execute the thinning process for other lines. The thinning-out process of the above-described processes S82 to S85 is continued. On the other hand, if there is no unprocessed line as a result of the determination in step S86 (Yes), the output map creation processing unit 42 ends the process.

  By operating in this way, the binary tree map data creation / output device 2 can output a map according to the thinning degree T of the user from the binary tree map data. The binary tree map data creation / output device 2 does not need to perform a depth-first search, unlike the binary tree map data creation / output device 1 according to the first embodiment, when executing the thinning process. Since it is only necessary to determine whether or not to draw each divided line data, the binary tree map data creation / output device 2 can output a map according to the thinning degree T of the user at high speed. For this reason, the user can easily obtain a map thinned out according to the purpose of use by the binary tree map data creation output device 2 at high speed. Then, by appropriately associating the thinning-out degree T with the scale, the binary tree map data creation / output device 2 can easily create a map of any scale at high speed. Further, by appropriately associating the thinning-out degree T with the size, the binary tree map data creation / output device 2 can easily create a map according to an arbitrary size at high speed. Furthermore, by appropriately associating the thinning-out degree T with the resolution, the binary tree map data creation / output device 2 can easily create a map corresponding to the arbitrary resolution at high speed.

As a specific example, a case where a single line is output using the binary tree map data table 201 shown in FIG. 15 will be described. When the user inputs a thinning degree T = 5, the processes S82 to S85 shown in FIG. 17 are executed. As a result, P ₇ P ₁₁ , P ₁₁ P ₁₆ , P ₁₆ P ₁₈ , P ₁ P ₃ and P ₃ P ₇ are output to the output unit 13 and drawn.

  Here, in the above-described second embodiment, whether or not the data of the divided line is to be thinned is determined by an inequality determination in step S83. In general, a computer has a higher calculation processing speed when determining whether or not an equation is satisfied than when determining whether or not an inequality is satisfied. Therefore, the binary tree map data creation / output device 2 may be configured so that the determination in step S83 can also be determined using an equation.

  In the case of the binary tree map data creation / output device 2 having such a configuration, first, a plurality of positive integers (rounded values) increasing at predetermined intervals are prepared, and the binary tree map data storage unit 54 is prepared. The degree-of-separation rounding processing unit 416 (shown by a broken line in FIG. 1) performs a degree-of-separation rounding process that rounds up the values of the parent separation degree Sp and the child separation degree Sc of the binary tree map data stored in FIG. .) Is further provided in the binary tree map data creation processing unit 41.

  A plurality of integers are, for example, numerical sequences such as 5, 10, 15, 20,... Increasing with an interval of 5, and 10, 20, 30, increasing with an interval of 10. Any numerical sequence such as a numerical sequence such as... For example, here, as a plurality of integers, a group of integers increasing in the relationship of powers of 10 (exponents = 0, 1, 2, 3,...) 1, 10, 100, 1000,. .. Is prepared and rounded by rounding up the value of the parent separation degree Sp and the child separation degree Sc of the binary tree map data to any one of the plurality of integers, and this rounded parent separation degree (rounding parent separation degree) Sp ′ And the child separation degree (rounding element separation degree) Sc ′ are further added to the binary tree map data. For example, when the parent separation degree Sp and the child separation degree Sc are 1 or less, they are rounded up to 1. When the parent separation degree Sp and the child separation degree Sc are greater than 1 and 10 or less, they are rounded up to 10. When the separation degree Sp and the child separation degree Sc are greater than 10 and less than or equal to 100, round up to 100, and when the parent separation degree Sp and the child separation degree Sc are greater than 100 and less than or equal to 1000, round up to 1000. . Then, as indicated by a broken line in FIG. 15, the rounding parent separation degree subfield 228 for registering the rounding parent separation degree Sp ′ and the rounder separation degree sub for registering the rounding element separation degree Sc ′ are registered in the binary tree map data table 201. A rounding distance field 215 including a field 229 is further provided.

  Then, the following process is performed instead of the above-described process S83. First, the output map creation processing unit 42 uses a rounding decimation degree Sp ′ and a rounding element separation degree Sc ′ of the divided line and a rounding decimation degree T ′ based on the decimation degree T input by the input unit 12. The divided line from which the coordinate values of the start point and the end point are to be acquired is determined by an equation according to the above rule.

  That is, when the predetermined rule for rounding is rounding up, the output map creation processing unit 42 determines that the rounding parent separation degree Sp ′ is a plurality of integers from the rounding thinning degree T ′ when the input thinning degree T is rounded up. Is equal to the rounding value equal to or higher than the rounding value one level lower than the rounding value, and the rounding element separation degree Sc ′ is one of a plurality of integers than the rounding thinning degree T ′ when the inputted thinning degree T is rounded up. Extract data that is equal to the rounding value below the rounding value at the lower level. For example, when the input thinning degree is “50”, the rounding thinning degree T ′ when this is rounded up is 100, and therefore the output map creation processing unit 42 has the rounding parent separation degree Sp ′. Data that is equal to 10, 100, 1000,... And the rounding element separation degree Sc ′ is equal to 10, 1.

  Next, among the extracted data, data having a rounding parent separation degree Sp ′ equal to 100, 1000,... And a rounding child separation degree Sc ′ equal to 1, Even if the child separation degree Sc is used, since the parent separation degree Sp is larger than the thinning-out degree T and the child separation degree Sc is always equal to or smaller than the thinning-out degree T, the output map creation processing unit 42 does not store these data. Is output to the output unit 13 and rendered. On the other hand, among the extracted data, the data having the rounding parent separation degree Sp ′ equal to 10 and the data having the rounding child separation degree Sc ′ equal to 10, the parent separation degree Sp is necessarily larger than the thinning degree T, and Since the condition that the child separation degree Sc is equal to or less than the thinning-out degree T is not always satisfied, the rounding parent separation degree Sp ′ is equal to 10 and the roundness separation degree Sc ′ is equal to 10. Only when the original parent separation degree Sp and the child separation degree Sc before rounding are used, it is determined whether or not the parent separation degree Sp is larger than the thinning degree T and the child separation degree Sc is equal to or smaller than the thinning degree T. . Then, the output map creation processing unit 42 outputs only the data in which the parent separation degree Sp is larger than the thinning degree T and the child separation degree Sc is equal to or smaller than the thinning degree T to the output unit 13 for drawing.

  By configuring in this way, the number of data determined by the inequality is reduced, so that a map corresponding to the thinning-out degree T can be output at higher speed.

  In the above description, even when rounded up, processing using an equation can be performed similarly even when rounded up.

  Further, in the binary tree map data creation output devices 1 and 2 according to the first and second embodiments described above, when the user creates a map using all the binary tree map data, FIG. As described above with reference to FIG. 17 and FIG. 17, it is sufficient to execute a thinning process on all the binary tree map data and output a map. When creating a map in a certain area, it is necessary to determine the output range.

  For example, in the process S31 of FIG. 9 and the process S81 of FIG. 17, a line selection process for selecting a line according to the next output range is executed.

FIG. 18 is a diagram for explaining line selection processing according to the output range. In FIG. 18, the output range is a rectangle ABCD, and the coordinate values A (X _A , Y _A ), B (X _B , Y _B ), C (X _C , Y _C ) and D (X _D , Y _D ) are specified by being input from the input unit 12. For example, by specifying two vertices (for example, vertex A and vertex C) having a diagonal relationship in the rectangle ABCD using the mouse, or by directly specifying the coordinate values of A, B, C, D of each vertex from the keyboard By inputting A (X _A , Y _A ), B (X _B , Y _B ), C (X _C , Y _C ), D (X _D , Y _D ), the binary tree map data creation output device 1, 2 is input.

Then, the output map creation processing units 22 and 42 take out the line when a part or all of the line covers the rectangular ABCD of the output range as in the lines L ₁₁ , L ₁₂ , and L ₁₃ in FIG. When the line does not cover the rectangular ABCD in the output range as in the case of the lines L ₂₁ , L ₂₂ , L ₂₃ , and L ₂₄ in FIG. 18, the line is not taken out.

That is, when each rectangular vertex ABCD is given as shown in FIG. 18, the output map creation processing units 22 and 42 indicate that the start and end x-coordinates X _R in the binary tree data of the line root are side AB. X _R <X _A (= X _B ), and the x-coordinate X _R of the start point and end point in the root binary tree data is on the right side of the side CD, and X _R > X _C (= If X _D ) is satisfied, the line is not taken out. The output map creation processing units 22 and 42, when the y coordinate Y _R of the start point and the end point in the binary tree data of the line root is above the side DA and satisfies Y _R > Y _D (= Y _A ), and When the y-coordinate Y _R of the start point and end point in the root binary tree data is below the side BC and satisfies Y _R <Y _B (= Y _C ), the line is not taken out. Then, the output map creation processing units 22 and 42 take out the line when the binary tree data at the root of the line does not satisfy such conditions.

  By performing such processing, it is possible to reliably extract the binary tree map data of the line within the range specified as the output range. Since it is not necessary to select a line strictly within the range specified as the output range or to divide the line, it is possible to easily execute the line selection process.

  In place of executing such a line selection process in the process S31 of FIG. 9 and the process S81 of FIG. 17, the output unit 13 in the process S41 of FIG. 9 and the process S84 of FIG. When outputting each coordinate value, even if such a line selection process is performed on the divided line, the binary tree map data of the line within the range specified as the output range can be reliably extracted.

  Further, even in such a line selection process, the output range may be determined by determination based on an equation. FIG. 19 is a diagram for explaining a coordinate value rounding process for rounding the coordinate values of the start point and the end point of a line. FIG. 20 is a diagram for describing line selection processing when binary tree map data including rounded coordinate values is used.

  For example, in the xy coordinate system provided in the graphic data, a plurality of layers having lattices with a constant interval are prepared, and the intervals between the lattices in the plurality of layers are increased with a predetermined interval. Of these layers, a layer having a relatively small lattice spacing is referred to as a lower layer, and a layer having a relatively large lattice spacing is referred to as an upper layer. When the line is included within the lattice region Q that is a region completely surrounded by the lattice, the lattice point having the largest x coordinate value and y coordinate value at the four lattice points constituting the lattice region Q. A coordinate value rounding processing unit 417 (indicated by a broken line in FIG. 1) that performs a coordinate value rounding process for rounding the coordinate values of the start point and end point of the line to the coordinate value of (the upper right grid point of the grid) is binary tree map data. Further provided in the creation processing units 21 and 41.

  The interval between the lattices of each layer increases, for example, with an interval of 5, 10, 15, 20,... Increasing at intervals of 5, or 10, 20, 30 increasing at intervals of 10. An arbitrary interval such as an interval such as. Here, for example, interval groups 1, 10, 100, 1000,... That increase with a power of 10 (index = 0, 1, 2, 3,...) Are prepared, and a binary tree map is prepared. The coordinate values of the start point and end point of the line in the data are rounded, and the coordinate values of the start point and end point of the rounded line are further added to the binary tree map data. For example, although not shown, the binary tree map data table 201 is further provided with a rounded coordinate value field for registering the respective coordinate values (rounded coordinate values) of the rounded start point and end point. This rounded coordinate value field includes an x-coordinate subfield and a y-coordinate subfield, respectively, similarly to the start point coordinate subfield 222 and the end point coordinate subfield 223 shown in FIG.

FIG. 19 is a diagram exemplifying a line in which xy coordinate values are rounded in a layer having a lattice interval of 10. For example, the coordinate value rounding processing unit 417 is configured such that all of the lines are completely as shown by a line L _{31 in} FIG. when included within the grating region Q _21, coordinates of the grid area Q ₂₁ of the four together the largest value x and y coordinate values at the grid points constituting the grid point q ₂₁ (top right of the grid points) At (820, 540), a coordinate value rounding process for rounding the coordinate values of the start point and end point of the line is performed. A lattice point to which each coordinate value of the start point and end point of the line is rounded is referred to as a representative point q of the lattice region Q. Here, the case where the line extends over the lattice region Q ₁₁ and the lattice region Q ₁₂ as shown by the line L ₃₂ in FIG. 19 or the case where the line extends over the lattice region Q ₂₂ and the lattice region Q ₁₂ as shown by the line L _{33 in} FIG. As described above, when a plurality of lattice regions Q are included in the layer having the lattice interval 10, the coordinate value is rounded to the representative point q of the lattice region Q in the upper layer. Will be. For example, the line L ₃₂ and the line L ₃₃ in FIG. 19 are completely included in the lattice region in the layer having the lattice interval 100.

In FIG. 19, a lattice region Q ₁₁ is a region surrounded by a lattice composed of four points of coordinates (810, 530), (810, 520), (820, 520), and (820, 530). The lattice region Q ₁₂ is a region surrounded by a lattice composed of four points of coordinates (820, 530), (820, 520), (830, 520), (830, 530), and the lattice region Q ₂₁ is It is a region surrounded by a grid consisting of four points of coordinates (810, 540), (810, 530), (820, 530), (820, 540), and the lattice region Q ₂₂ is represented by coordinates (820, 540), (820, 530), (830, 530), and (830, 540). Representative point q ₁₁ of the grating region Q ₁₁ are the coordinates (820,530), the representative point q ₁₂ of the grating region Q ₁₂ are the coordinates (830,530), the representative point q ₂₁ of the grating region Q ₂₁ is the coordinates (820,540), and the representative point q ₂₂ of the grating region Q ₂₂ are the coordinates (830,550).

  When the line selection process is performed, the output map creation processing units 22 and 42 take out the lattice area Q to which the input output range is applied, and round the same as the coordinate value at the representative point q of the extracted lattice area Q. Select the line with the specified coordinate value.

For example, as illustrated in FIG. 20, when the output range is rectangular ABCD, the lattice regions Q ₂₁ , Q ₂₂ , Q ₂₃ , Q ₂₄ , Q ₃₁ , Q ₃₂ , Q ₃₃ , which are shaded in FIG. An output range is applied to Q ₃₄ , Q ₄₁ , Q ₄₂ , Q ₄₃ , and Q _44, and their representative points q ₂₁ , q ₂₂ , q ₂₃ , q ₂₄ , q ₃₁ , q ₃₂ , q ₃₃ are indicated by ● in FIG. , Q ₃₄ , q ₄₁ , q ₄₂ , q ₄₃ , q ₄₄ coordinate values q ₂₁ (820, 540), q ₂₂ (830, 540), q ₂₃ (840, 540), q ₂₄ (850, 540) , Q ₃₁ (820, 550), q ₃₂ (830, 550), q ₃₃ (840, 550), q ₃₄ (850, 550), q ₄₁ (820, 560), q ₄₂ (830, 560), q Select a line with rounded coordinate values equal to ₄₃ (840, 560), q ₄₄ (850, 560).

  By performing such processing, the binary tree map data of the line within the range specified as the output range can be reliably extracted using an equation, so a map corresponding to the thinning degree T is output at higher speed. can do.

  In the above description, when the line is completely included in the lattice region Q, the lattice point having the largest x coordinate value and y coordinate value at the four lattice points constituting the lattice region Q (upper right corner of the lattice). The coordinate values of the start point and end point of the line are rounded to the coordinate values of the grid points), but the start point of the line and the coordinate values at the other grid points of the four grid points constituting the grid region Q are rounded off. Even if each coordinate value of the end point is rounded, processing using an equation can be performed similarly. For example, as the grid points to be rounded, the grid point at the lower right of the grid where only the x coordinate value is the largest, the grid point at the upper left of the grid where only the y coordinate value is the largest, the x coordinate value, The lower left lattice point of the lattice having the smallest y coordinate value may be used.

  The binary tree map data creation output devices 1 and 2 according to the first and second embodiments described above create binary tree map data from the original map data, and according to the thinning degree T based on the binary tree map data. Binary map data that creates and outputs a binary tree map data from the original map data, and a binary tree map data that creates and outputs a map according to the thinning degree T based on the binary tree map data You may comprise separately with an output device. Such a binary tree map data creation device functionally includes an arithmetic processing unit 11 including the above-described binary tree map data creation processing units 21 and 41, an input unit 12, an output unit 13, and a functional binary tree map. The data generation program storage units 31 and 51, the original map data storage unit 33 and the binary tree map data storage units 34 and 54, and the bus 15 are provided. Such a binary tree map data output device functionally includes an arithmetic processing unit 11 including the above-described output map creation processing units 22 and 42, an input unit 12, an output unit 13, and a functional output map creation. The storage unit 14 includes the program storage units 32 and 52 and the binary tree map data storage units 34 and 54, and the bus 15.

It is a block diagram which shows the structure of the binary tree map data creation output device which concerns on 1st Embodiment. It is a flowchart which shows the operation | movement which produces binary tree map data in the binary tree map data creation output device which concerns on 1st Embodiment. It is a figure which shows a line. It is FIG. (1) for demonstrating the operation | movement which produces binary tree map data in a binary tree map data creation output device. It is FIG. (2) for demonstrating the operation | movement which produces binary tree map data in a binary tree map data creation output device. It is FIG. (3) for demonstrating the operation | movement which produces binary tree map data in a binary tree map data creation output device. It is a figure which shows binary tree map data expressed with the table which concerns on 1st Embodiment. It is a figure which shows binary tree map data expressed with the tree structure which concerns on 1st Embodiment. It is a flowchart which shows the operation | movement which outputs the map according to the thinning degree from the binary tree map data in the binary tree map data creation output device which concerns on 1st Embodiment. It is a figure which shows the mode of the division line memorize | stored in the memory | storage part 14 as unprocessed data. It is a figure which shows the line after a thinning process. It is a flowchart which shows the operation | movement which produces binary tree map data in the binary tree map data creation output device which concerns on 2nd Embodiment. It is a flowchart which shows the operation | movement of the replacement process of the degree of separation in the binary tree map data creation output device which concerns on 2nd Embodiment. It is a figure which shows binary tree map data (before substitution process) expressed with the table which concerns on 2nd Embodiment. It is a figure which shows binary tree map data (after replacement process) expressed with the table which concerns on 2nd Embodiment. It is a figure which shows binary tree map data expressed with the tree structure which concerns on 2nd Embodiment. It is a flowchart which shows the operation | movement which produces binary tree map data in the binary tree map data creation output device which concerns on 2nd Embodiment. It is a figure for demonstrating the line selection process according to an output range. It is a figure for demonstrating the coordinate value rounding process which rounds each coordinate value of the starting point of a line, and an end point. It is a figure for demonstrating the line selection process at the time of using binary tree map data provided with a rounded coordinate value.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1, 2 Binary tree map data creation output device 211 Separation degree calculation part 11 Calculation processing part 212 Divided line division | segmentation process part 12 Input part 213 Line division | segmentation process part 13 Output part 214, 414 Creation process part 14 Storage part 415 Replacement process part 15 Bus 416 Separation degree rounding processing unit 16 External storage unit 417 Coordinate value rounding processing unit 17 Communication interface unit 21, 41 Binary tree map data creation processing unit 22, 42 Output map creation processing unit 31, 51 Binary tree map data creation program storage Units 32 and 52 Output map creation program storage unit 33 Original map data storage units 34 and 54 Binary tree map data storage unit

Claims (17)

Each coordinate value of the start point and end point in the line to be divided, and the maximum degree of separation of the inner points on the line to be divided between the start point and end point of the line to be divided, and the line to be divided And a parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the first and second divided lines generated from the divided line,
The degree of separation is a measure representing how far an inner point on the split line between the start point and end point of the split line is away from a line segment connecting the start point and end point of the split line,
The first and second dividing lines are generated by dividing the divided line into two at the inner point having the maximum degree of separation,
The line to be divided includes a line that can be represented by a line on a map including each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point; A binary tree map data creation device for creating binary tree map data that is a divided line excluding a divided line having no interior point among divided lines. The coordinate values of the start point and end point of the line to be divided, the degree of separation used when generating the line to be divided as the parent separation degree, and the degree of separation between the start point and end point of the line to be divided as the degree of child separation. The maximum separation degree among the separation degrees of the inner points on the dividing line is associated with,
The degree of separation is a measure representing how far an inner point on the split line between the start point and end point of the split line is away from a line segment connecting the start point and end point of the split line,
The divided line includes a line that can be represented by a line on a map including each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point, and a maximum degree of separation. All of the first and second split lines generated by splitting the split line into two at the inner point it has,
The parent separation degree and the child separation degree are divisions that do not have an inner point from the line when the correspondence between the divided line and the first and second divided lines generated from the divided line is a parent-child relationship. When the separation degree used to divide the divided line into the first and second divided lines from the parent to the descendant up to the line is sequentially followed, the separation degree of the descendant side including the separation degree when the division is performed A binary tree map data creation device for creating binary tree map data that is the value replaced by the maximum value. A binary tree for converting the map data of a line represented by a line on the map into binary tree map data, each coordinate value of the start point and the end point and the coordinate value of the inner point on the line between the start point and the end point In the map data creation device,
The degree of separation for calculating the degree of separation, which is a measure of how far the inner point on the divided line between the start point and the end point of the divided line is from the line segment connecting the start point and the end point of the divided line An arithmetic unit;
A divided line division processing unit that divides the divided line into two first and second divided lines at an inner point having the largest degree of separation calculated by the separation degree calculating unit;
By making the divided line generated by dividing the line into the first divided line and dividing by the divided line division processing unit as a new divided line, the divided lines are sequentially sequentially until there is no inner point. A line division processing unit for dividing the line;
The coordinate values of the start point and the end point of the line and the divided line that have been divided into lines by the line dividing processing unit, and the maximum separation used when the divided line is divided by the divided line dividing processing unit. The binary tree map data including the degree and the parent-child relationship information representing the parent-child relationship that is the correspondence relationship between the first and second divided lines generated by the divided line division processing unit and the divided line. A binary tree map data creation device, comprising: a creation processing unit that creates a map. In the binary tree map data creation device according to claim 3,
The maximum separation degree used when the divided line is divided by the divided line division processing unit is set as a child separation degree, and the separation degree used when the divided line is generated is set as a parent separation degree. The parent separation degree and the child separation degree are the separation degrees used when the divided line is divided into the first and second divided lines from the parent to the descendant from the line to the dividing line having no inner point. Are sequentially replaced with the maximum value of the degree of separation on the descendant side including the degree of separation when the division is performed,
The creation processing unit includes the coordinate values of the start point and the end point of the line and all the divided lines, the parent separation degree processed by the replacement processing unit, and the child separation degree processed by the replacement processing unit. A binary tree map data creation device, characterized in that the binary tree map data provided in association with each other is created. A binary tree for converting the map data of a line represented by a line on the map into binary tree map data, each coordinate value of the start point and the end point and the coordinate value of the inner point on the line between the start point and the end point In the map data creation method,
The degree of separation for calculating the degree of separation, which is a measure of how far the inner point on the divided line between the start point and the end point of the divided line is from the line segment connecting the start point and the end point of the divided line A computation step;
A divided line dividing process step of dividing the divided line into two first and second divided lines at an inner point having the largest degree of separation calculated in the separation degree calculating step;
By making the divided line generated by dividing the line into the first divided line and dividing in the divided line division processing step as a new divided line, the divided lines are sequentially sequentially until there are no interior points. A line dividing step for dividing the line;
The coordinate values of the start point and the end point of the line and the split line that are set as the split lines in the line split processing step, and the maximum separation used when the split line is split in the split line split processing step The binary tree map data including the degree and the parent-child relationship information indicating the parent-child relationship which is the correspondence relationship between the first and second divided lines generated in the divided line dividing processing step and the divided line. And a creation processing step for creating a binary tree map data creation method. In the binary tree map data creation method according to claim 5,
The maximum separation degree used when dividing the divided line in the divided line division processing step is set as a child separation degree, and the separation degree used when generating the divided line is set as a parent separation degree. The parent separation degree and the child separation degree are the separation degrees used when the divided line is divided into the first and second divided lines from the parent to the descendant from the line to the dividing line having no inner point. Are sequentially replaced with the maximum value of the degree of separation on the descendant side including the degree of separation when the division is performed,
In the creation processing step, the coordinate values of the start point and the end point in the line and all the divided lines, the parent separation degree processed in the replacement processing step, and the child separation degree processed in the replacement processing step. A binary tree map data creation method comprising: creating the binary tree map data provided in association with each other. A computer that has each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point, and converts map data of a line represented by a line on the map into binary tree map data In the binary tree map data creation program for
The degree of separation for calculating the degree of separation, which is a measure of how far the inner point on the divided line between the start point and the end point of the divided line is from the line segment connecting the start point and the end point of the divided line A computation step;
A divided line dividing process step of dividing the divided line into two first and second divided lines at an inner point having the largest degree of separation calculated in the separation degree calculating step;
By making the divided line generated by dividing the line into the first divided line and dividing in the divided line division processing step as a new divided line, the divided lines are sequentially sequentially until there are no interior points. A line dividing step for dividing the line;
The coordinate values of the start point and the end point of the line and the split line that are set as the split lines in the line split processing step, and the maximum separation used when the split line is split in the split line split processing step The binary tree map data including the degree and the parent-child relationship information indicating the parent-child relationship which is the correspondence relationship between the first and second divided lines generated in the divided line dividing processing step and the divided line. A binary tree map data creation program, comprising: a creation processing step for creating a binary tree. In the binary tree map data creation program according to claim 7,
The maximum separation degree used when dividing the divided line in the divided line division processing step is set as a child separation degree, and the separation degree used when generating the divided line is set as a parent separation degree. The parent separation degree and the child separation degree are the separation degrees used when the divided line is divided into the first and second divided lines from the parent to the descendant from the line to the dividing line having no inner point. Are sequentially replaced with the maximum value of the degree of separation on the descendant side including the degree of separation when the division is performed,
In the creation processing step, the coordinate values of the start point and the end point in the line and all the divided lines, the parent separation degree processed in the replacement processing step, and the child separation degree processed in the replacement processing step. A binary tree map data creation program characterized by creating the binary tree map data provided in association with each other. A computer that has each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point, and converts map data of a line represented by a line on the map into binary tree map data In a recording medium that records a binary tree map data creation program to be executed,
The binary tree map data creation program is:
The degree of separation for calculating the degree of separation, which is a measure of how far the inner point on the divided line between the start point and the end point of the divided line is from the line segment connecting the start point and the end point of the divided line A computation step;
A divided line dividing process step of dividing the divided line into two first and second divided lines at an inner point having the largest degree of separation calculated in the separation degree calculating step;
By making the divided line generated by dividing the line into the first divided line and dividing in the divided line division processing step as a new divided line, the divided lines are sequentially sequentially until there are no interior points. A line dividing step for dividing the line;
The coordinate values of the start point and the end point of the line and the split line that are set as the split lines in the line split processing step, and the maximum separation used when the split line is split in the split line split processing step The binary tree map data including the degree and the parent-child relationship information indicating the parent-child relationship which is the correspondence relationship between the first and second divided lines generated in the divided line dividing processing step and the divided line. And a creation processing step for creating a recording medium. The recording medium according to claim 9, wherein
The maximum separation degree used when dividing the divided line in the divided line division processing step is set as a child separation degree, and the separation degree used when generating the divided line is set as a parent separation degree. The parent separation degree and the child separation degree are the separation degrees used when the divided line is divided into the first and second divided lines from the parent to the descendant from the line to the dividing line having no inner point. Are sequentially replaced with the maximum value of the degree of separation on the descendant side including the degree of separation when the division is performed,
In the creation processing step, the coordinate values of the start point and the end point in the line and all the divided lines, the parent separation degree processed in the replacement processing step, and the child separation degree processed in the replacement processing step. A recording medium characterized by creating the binary tree map data provided in association with each other. Each coordinate value of the start point and end point in the line to be divided, and the maximum degree of separation of the inner points on the line to be divided between the start point and end point of the line to be divided, and the line to be divided And a parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the first and second divided lines generated from the split line, and the degree of separation is between the start point and the end point of the split line Is a scale representing how far the inner point on the split line is from the line segment connecting the start point and the end point of the split line, and the first and second split lines have a maximum degree of separation. The divided line is generated by dividing the line to be divided into two at the inner point having, and the divided line has the coordinate values of the start point and the end point and the coordinate value of the inner point on the line between the start point and the end point. And can be represented by a line on a map with From the line and, binary tree map data is a division line, except the division line having no inner point of the first and second division line, the map output device for outputting thinning out predetermined interior point,
An input unit for inputting a thinning degree that is a degree of thinning the inner point of the line;
As a result of sequentially comparing the maximum separation degree of the divided line and the thinning degree input in the input unit from the parent to the descendant from the line to the dividing line having no interior point, the comparison result, the thinning degree An output map creation processing unit for acquiring the coordinate values of the start point and the end point of the divided line having the maximum degree of separation below;
An output unit that outputs a line segment connecting the coordinate values of the start point and end point acquired by the output map creation processing unit. The coordinate values of the start point and end point of the line to be divided, the degree of separation used when generating the line to be divided as the parent separation degree, and the degree of separation between the start point and end point of the line to be divided as the degree of child separation. A maximum separation degree among the separation degrees of the inner points on the dividing line, and the separation point is an inner point on the divided line between the start point and the end point of the divided line. Is a scale representing how far the line segment connecting the start point and end point of the split line is, and the split line is located on the line between the coordinate values of the start point and end point and the start point and end point. All the first and second lines generated by dividing the line to be divided into two at the inner point having the maximum degree of separation, and a line that can be represented by a line on the map with the coordinate value of the inner point A two-divided line, wherein the degree of parent separation and child separation When the correspondence between the divided line and the first and second divided lines generated from the divided line is a parent-child relationship, from the parent to the descendant from the line to the divided line having no interior point When the separation degree used to divide the line to be divided into the first and second division lines is sequentially followed, the maximum value of the separation degree on the descendant side including the separation degree at the time of the division is replaced. In the map output device that outputs a predetermined internal point from a binary tree map data that is a value,
An input unit for inputting a thinning degree that is a degree of thinning the inner point of the line;
The parent separation degree and the child separation degree of the divided line are sequentially compared with the thinning degree input at the input unit, and as a result of the comparison, the parent separation degree is larger than the thinning degree, and the An output map creation processing unit for acquiring the coordinate values of the start point and the end point in the divided line having the child separation degree equal to or less than the thinning degree;
An output unit that outputs a line segment connecting the coordinate values of the start point and end point acquired by the output map creation processing unit. The map output device according to claim 12, wherein
The binary tree map data corresponds to a plurality of integers that increase with a predetermined interval, and a rounding parent separation degree and a rounding child separation degree obtained by rounding the parent separation degree and the child separation degree according to a predetermined rule, respectively. In addition,
The output map creation processing unit is configured to round the rounding thinning degree obtained by rounding the rounding parent separation degree and rounding child separation degree of the divided line and the thinning degree input by the input unit into the plurality of integers according to the predetermined rule. The map output device, wherein the divided line from which the coordinate values of the start point and the end point are to be acquired is determined by an equation according to the predetermined rule. In the map output device according to claim 11 or 12,
The input unit further receives a rectangular output range to be output to the output unit,
The map output device characterized in that the output map creation processing unit sets the divided line in a line in which a part or all of the rectangular output range input by the input unit is a target of the comparison. In the map output device according to claim 11 or 12,
In the xy coordinate system provided in the binary tree map data, the binary tree map data is a plurality of layers having lattices with a constant interval, and the intervals of the lattices are increased with a predetermined interval between each layer. The coordinate values of the grid points in a plurality of layers are further provided in association with rounded coordinate values obtained by rounding the coordinate values of the start point and end point of the divided line according to a predetermined rule,
The input unit further receives a rectangular output range to be output to the output unit,
The output map creation processing unit rounds a part or all of the rectangular output range input by the input unit of the lattice region formed by the lattice to the coordinate value of the lattice point in the lattice region. A map output device characterized in that a divided line having a coordinate value is a target of the comparison. Each coordinate value of the start point and end point in the line to be divided, and the maximum degree of separation of the inner points on the line to be divided between the start point and end point of the line to be divided, and the line to be divided And a parent-child relationship information representing a parent-child relationship that is a correspondence relationship between the first and second divided lines generated from the divided line,
The degree of separation is a measure representing how far an inner point on the split line between the start point and end point of the split line is away from a line segment connecting the start point and end point of the split line,
The first and second dividing lines are generated by dividing the divided line into two at the inner point having the maximum degree of separation,
The line to be divided includes a line that can be represented by a line on a map including each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point; A computer-readable recording medium on which binary tree map data, which is a divided line excluding a divided line having no interior point, is recorded. The coordinate values of the start point and end point of the line to be divided, the degree of separation used when generating the line to be divided as the parent separation degree, and the degree of separation between the start point and end point of the line to be divided as the degree of child separation. The maximum separation degree among the separation degrees of the inner points on the dividing line is associated with,
The degree of separation is a measure representing how far an inner point on the split line between the start point and end point of the split line is away from a line segment connecting the start point and end point of the split line,
The divided line includes a line that can be represented by a line on a map including each coordinate value of a start point and an end point and a coordinate value of an inner point on the line between the start point and the end point, and a maximum degree of separation. All of the first and second split lines generated by splitting the split line into two at the inner point it has,
The parent separation degree and the child separation degree are divisions that do not have an inner point from the line when the correspondence between the divided line and the first and second divided lines generated from the divided line is a parent-child relationship. When the separation degree used to divide the divided line into the first and second divided lines from the parent to the descendant up to the line is sequentially followed, the separation degree of the descendant side including the separation degree when the division is performed A computer-readable recording medium in which binary tree map data that is the value replaced with the maximum value is recorded.

Images