JP2009217000A - Drawing processor, drawing processing program, and drawing processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To achieve fast drawing processing without changing the structure of map data. <P>SOLUTION: In a drawing processor for drawing a graphic by using map data containing the information of the graphic to be drawn existing in each of parcels in a parcel structure 110 dividing an image, the parcel structure 110 is divided into a smaller virtual sub-parcel structure 120. a virtual sub-parcel wherein at least a part of the graphic in the parcel exists out of the divided virtual sub-parcels is specified, and the specified virtual sub-parcel is correlated with the graphic. On receiving an instruction on an image display area from drawing environment setting, the drawing processor extracts a parcel included in the display area out of graphic data, further, extracts a virtual sub-parcel included in the extracted parcel display area, and draws a graphic correlated with the extracted virtual sub-parcel out of the graphics existing at least in a part of the extracted parcel. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a drawing processing apparatus, a drawing processing program, and a drawing processing method that perform drawing processing of two-dimensional and three-dimensional map images.

  Conventionally, a navigation system and a map display system often employ a technique in which individual graphic data is drawn in real time in a dedicated graphics system to generate a map image as needed. This is because in a navigation system or a map display system, it is necessary to dynamically change the map image for display according to movement or an instruction from the user. This is because it is possible to provide a clear and scalable map image by generating one by one with a dedicated graphics system rather than rotating display.

  Further, the map data used in the system as described above is configured as a collection of data in units of sections generally called parcels. Specifically, each parcel is constituted by data obtained by grouping two-dimensional shape data such as roads and buildings on a map represented by the parcel. The two-dimensional shape data includes a drawing data necessary for drawing a map in real time such as a vertex coordinate of a figure and a fill color.

  Furthermore, the graphic data for drawing constituting the parcel is arranged in an optimized order so that the overlapping of roads, land use divisions and buildings can be correctly processed and drawn. Therefore, for example, when the size of a parcel is changed and a graphic contained in the parcel is transferred / transferred, it is necessary to rearrange the graphic data. Further, even when the figure crosses the boundary between adjacent parcels by changing the parcel size, it is necessary to cut the figure at the parcel boundary and redistribute the cut figure data to each parcel.

  In addition, when map drawing is performed using map data in parcel units, a map image in a designated display range is displayed. At this time, the size of one parcel is often larger than the size of an area displayed on a display screen such as a display. That is, the parcel includes a lot of map data that is not displayed on the display screen. In addition, since the density of map data is different between urban areas and suburbs, when the parcel size is uniform, the density of map data is biased. Therefore, a technique for variably constructing the parcel size according to the data density in order to improve the bias of the map data and increase the data access efficiency is also disclosed (for example, see Patent Document 1 below).

JP 2004-177959 A

  However, when the map image is generated from the map data configured in parcel units as described above, the drawing process of the graphic arranged on the map is executed in parcel units. Even if the image displayed on the display screen uses only a part of the graphic data included in the parcel, all the graphic data included in the same parcel is read and a drawing process is performed. Further, when the image displayed on the display screen is graphic data extending over a plurality of parcels, all map data for 2 parcels to 4 parcels is read regardless of the ratio displayed on the display screen, The drawing process has been performed.

  As described above, the conventional drawing process includes a lot of processes that are not actually reflected in the output to the display screen, and thus there is a problem that the drawing process cannot be accelerated. Even if the technique of Patent Document 1 is applied, the parcel size is changed according to the data density, and the data amount is made uniform, the leveling of the map data read amount is achieved, but other than the display screen The drawing process of the graphic part could not be suppressed, and the drawing process speed could not be increased.

  The present invention provides a drawing processing apparatus, a drawing processing program, and a drawing processing method capable of realizing high-speed drawing processing without changing the configuration of map data in order to solve the above-described problems caused by the prior art. Objective.

  In order to solve the above-described problems and achieve the object, the drawing processing apparatus, the drawing processing program, and the drawing processing method use the graphic data including the graphic information existing in the first area that divides the image. A drawing process for drawing an image, wherein the first area corresponding to the graphic data is divided into second areas smaller than the first area, and at least a graphic of the first area is divided from the divided second area; It is a requirement to include a process for specifying a second area where a part exists and associating the specified second area with the graphic.

  According to the drawing processing apparatus, the map drawing program, and the drawing processing method, for example, the first area is virtually divided for each first area with respect to the map data image accumulated in units of sections. A small second area group is set. An example of the second area is a rectangular group obtained by dividing a section. Then, the second area where at least a part of the graphic to be drawn in the first area exists is specified and associated with the graphic. Therefore, when a drawing instruction is received for the first area without changing the configuration of the map data, it is possible to embed information serving as a criterion for determining whether or not to perform the drawing process.

  In the drawing processing apparatus, the drawing processing program, and the drawing processing method, when the graphic reference table is included in the first area unit, the association unit includes the second area, You may associate with a reference table.

  According to the drawing processing device, the map drawing program, and the drawing processing method, in order to associate the reference table of the drawing target graphic with the second area, the information about the drawing target graphic included in the map data is directly associated with the second area. There is no need to embed information serving as a criterion for determining whether or not to perform the drawing process.

  In the drawing processing apparatus, the drawing processing program, and the drawing processing method, when receiving an instruction for a display area of the image, the first area included in the display area is extracted from the graphic data. A first extraction, a second extraction for extracting the first area extracted by the first extraction and the second area included in the display area, and the first area extracted by the first extraction; A process of drawing a graphic associated with the second extracted second area from the graphic existing in at least a part of the image may be provided.

  According to the drawing processing device, the drawing processing program, and the drawing processing method, the drawing target graphic displayed in the first area necessary for drawing the map image of the designated display area is displayed in the display area. It is possible to prevent the drawing process of other drawing target graphics that are drawn only and not displayed.

  According to the drawing processing apparatus, the drawing processing program, and the drawing processing method, there is an effect that high-speed drawing processing can be realized without changing the configuration of the map data.

  Exemplary embodiments of a drawing processing device, a drawing processing program, and a drawing processing method will be described below in detail with reference to the accompanying drawings.

(Overview of map drawing processing according to this embodiment)
First, an outline of the map drawing process according to the present embodiment will be described. FIG. 1 is an explanatory diagram showing an outline of map drawing processing according to the present embodiment. As shown in FIG. 1, in the present embodiment, the map data 100 is configured as a collection of data of the parcel structure 110. Each parcel structure 110 is further virtually divided into virtual sub-parcel structures 120.

  The virtual sub parcel structure 120 is a concept for virtually dividing the parcel structure into smaller parcel structures as the name indicates. Therefore, the data structure representing each parcel structure 110 stored in the map data 100 does not require data reconstruction processing such as rearrangement of graphic data in the parcel structure 110 or cutting of graphics at sub-parcel boundaries. As shown in the data string 130, the data string 130 is composed of information representing the conventional parcel structure 110.

  In the case of the drawing process according to the present embodiment, information related to the virtual sub-parcel virtually divided by the virtual sub-parcel structure 120 is embedded in the same data structure as described above and used for the drawing process determination. Specifically, one parcel structure 110 includes data of a drawing target graphic (for example, graphic A) existing in the parcel as in the data string 130. A sub-parcel identification code 131 indicating which virtual sub-parcel is located when this drawing target graphic is divided as in the virtual sub-parcel structure 120 is added to the information about the graphic A in the data string 130 and embedded.

  The above process will be described along with an actual drawing process. First, as preparatory processing for drawing processing, graphic data for each parcel structure 110 included in the map data 100 is drawn in order to generate a map database for an actual map image display system (for example, navigation system). It is determined in which virtual sub-parcel position the data of the object graphic is contained, and a sub-parcel identification code 131 corresponding to the result is given. At this time, if it cannot fit in one virtual sub-parcel, a sub-parcel identification code 131 indicating that it is displayed by a plurality of virtual sub-parcels is assigned. The sub-parcel identification code 131 may be given to the graphic data itself as shown in FIG. 1, or may be given to a reference table indicating an address where the graphic data exists.

  Next, processing related to actual map drawing will be described. Actual map drawing is triggered by the reception of designation of the display area 111 from the user or a higher system. The sub-parcel identification code 131 is embedded in the graphic data of each parcel of the map data 100, and the map data 100 of the parcel structure 110 portion including the designated display area 111 is read from the map data 100. .

  Conventionally, all the drawing target figures included in the read map data 100 of the parcel structure 110 are drawn. In the present embodiment, the display area 111 of the parcel structures 110 including the display area 111 is displayed. The graphic data in which the sub-parcel identification code 131 representing the sub-parcel included in is embedded is extracted and drawn. Therefore, the drawing process is omitted for the graphic existing outside the display area 111.

  In the case of conventional drawing processing, if the parcel size is relatively larger than the display area, that is, the display screen size, a lot of map data that is not displayed on the display screen is included in the parcel. The decline was significant. However, in the case of the drawing process as in the present embodiment, the drawing process is performed only on the actually displayed graphic, so that the drawing speed is improved.

  In the case of the conventional drawing process, for example, even if the drawing of the off-screen data is suppressed by the clipping process, the number of figures included in the map data is enormous. The entire drawing process was a bottleneck. However, the above-described problem does not occur in the drawing process as in the present embodiment.

  Also, in the conventional drawing process, measures such as performing prior visibility determination with a bounding box and boundary sphere, which are often used in game graphics to suppress drawing outside the display screen, were taken. This is not always effective when the figure to be drawn as a map drawing is limited to a specific shape. The reason for this is that characters such as people and monsters in the game have a large number of vertices per body, so the effect of reducing the number of vertices by the bounding box is great. It does n’t have as many vertices. That is, the effect of reducing the number of individual vertices is small, and a huge number of bounding boxes must be processed, which does not lead to an improvement in the drawing speed. In the case of the drawing process of the present embodiment, the effect can be exhibited without limiting the type of figure.

  Although the parcel size can be optimized according to the screen size, it is not a realistic drawing process in view of the processing load. The first reason is that the relative ratio between the parcel size and the screen size always changes when the scaled drawing is performed according to the map scale. This means that there are a myriad of optimal parcel sizes depending on the scale, and even if the relative size ratio variation is limited, map data with the same level of detail must be implemented as multiple parcel sizes. It means that the effect cannot be obtained unless these conditions are satisfied. When such processing is realized, for example, there is a possibility that the storage capacity of map data such as an HDD may become tight.

  The second reason is that changing the parcel size always involves rearrangement of the graphic data storage order, cutting and redistribution of the graphic at the parcel boundary, and possibly an increase in the amount of data. It is. This kind of map database tuning is not a principle / general-purpose measure, but only an individual optimization for each product, which is a heavy burden for map data makers and car navigation system makers, and tends not to be adopted. It is in.

  Therefore, unlike the drawing processing according to the present embodiment, the feature that the drawing processing of the portion that has been wasted in the past can be omitted even though the configuration of the map data is not required is different for various systems. It also includes the effect that the process is easy to apply. Therefore, a specific configuration and processing contents for realizing a drawing processing apparatus having the drawing processing features described with reference to FIG. 1 will be described in detail below.

(Hardware configuration of map drawing device)
First, a hardware configuration of a drawing processing apparatus that realizes drawing processing according to the present embodiment will be described. FIG. 2 is an explanatory diagram illustrating a hardware configuration of the drawing processing apparatus according to the present embodiment.

  In FIG. 2, the drawing processing apparatus 200 includes a CPU (Central Processing Unit) 201, a ROM (Read Only Memory) 202, a RAM (Random Access Memory) 203, a hard disk drive 204, a hard disk 205, and an optical disk drive 206. An optical disk 207, a display 208, an I / F (interface) 209, a keyboard 210, a mouse 211, a scanner 212, and a printer 213. Each component is connected by a bus 200.

  Here, the CPU 201 controls the entire drawing processing apparatus 200. The ROM 202 stores a program such as a boot program. The RAM 203 is used as a work area for the CPU 201. The hard disk drive 204 controls reading / writing of data with respect to the hard disk 205 according to the control of the CPU 201. The hard disk 205 stores data written under the control of the hard disk drive 204.

  The optical disk drive 206 controls reading / writing of data with respect to the optical disk 207 according to the control of the CPU 201. The optical disk 207 stores data written under the control of the optical disk drive 206, and causes the drawing processing apparatus 200 to read data stored on the optical disk 207.

  As the optical disk 207, a CD (Compact Disk), a DVD (Digital Versatile Disk), an MO (Magneto Optical), a memory card, or the like can be used. The display 208 displays data such as a document, an image, and function information as well as a cursor, an icon, or a tool box. As this display 208, for example, a CRT (Cathode Ray Tube), a TFT (Thin Film Transistor) liquid crystal display, a plasma display, or the like can be adopted.

  The I / F 209 is connected to a network 214 such as the Internet through a communication line, and is connected to other devices via the network 214. The I / F 209 controls an internal interface with the network 214 and controls data input / output from an external device. For example, a modem or a LAN (Local Area Network) adapter may be employed as the I / F 209.

  The keyboard 210 includes keys for inputting characters, numbers, various instructions, and the like, and inputs data. Moreover, a touch panel type input pad or a numeric keypad may be used. The mouse 211 performs cursor movement, range selection, window movement, size change, and the like. A trackball or a joystick may be used as long as they have the same function as a pointing device.

  The scanner 212 optically reads an image and takes in the image data into the drawing processing apparatus 200. The scanner 212 may have an OCR (Optical Character Reader) function. The printer 213 prints image data and document data. As the printer 213, for example, a laser printer or an ink jet printer can be employed.

  In the case of the drawing processing apparatus 200 according to the present embodiment, in addition to the case where the drawing processing apparatus 200 is realized as a single apparatus as illustrated in FIG. In some cases, a mobile terminal navigation system is realized. Therefore, the hardware configuration of the drawing processing apparatus 200 in FIG. 2 is merely an example, and may be realized by another configuration. Examples realized as a car navigation system or a portable terminal navigation system will be described later.

(Functional configuration of drawing processing device)
Next, a functional configuration of the drawing processing apparatus will be described. FIG. 3 is a block diagram illustrating a functional configuration of the drawing processing apparatus. In FIG. 3, the drawing processing apparatus 200 includes a dividing unit 301, a specifying unit 302, an associating unit 303, a section extracting unit 304, a rectangle extracting unit 305, and a drawing unit 306. These functions 301 to 306 are entered by causing the CPU to execute programs related to the functions 301 to 306 stored in the storage unit (for example, the hard disk 205 described with reference to FIG. The function can be realized by the output I / F.

  The drawing processing apparatus 200 draws a map image using map data 100 that includes information of a drawing target figure existing in each parcel as a section (first area) unit for dividing a map. Accordingly, the map data 100 having a parcel unit data structure is prepared and read by the drawing processing apparatus 200.

  The dividing unit 301 divides an arbitrary parcel in the read map data into smaller rectangular (second area) groups, that is, virtual sub-parcel groups. In the present embodiment, the second region serving as the virtual sub-parcel is divided so as to be rectangular. However, the shape of the second region is not particularly limited as long as the division is complete. As described above, the division by the dividing unit 301 is a virtual division, and does not divide the map data 100, but generates setting information indicating the arrangement of virtual sub-parcels that are individual rectangles when divided. To do.

  The specifying unit 302 specifies a virtual sub-parcel in which at least a part of a drawing target graphic in the parcel exists from the virtual sub-parcel group divided by the dividing unit 301.

  The associating unit 303 associates the virtual sub-parcel specified by the specifying unit 302 with the drawing target graphic. The association between the virtual subparcel and the drawing target graphic is specifically recorded in association with the setting information of the virtual subparcel specified in the information related to the drawing target graphic. As an example, there is a method of embedding the sub-parcel identification code 131 in the information related to the drawing target graphic as in the data string 130 of FIG.

  Note that the associating unit 303 may associate the virtual sub-parcel with the reference table instead of the drawing target graphic as long as the reference table that represents the storage destination of the information related to the drawing target graphic is included.

  Further, as described above, when the specifying unit 302 specifies a plurality of virtual sub-parcels in which at least a part of the drawing target graphic exists without the drawing target graphic being contained in one virtual sub-parcel, the associating unit 303 A plurality of specified virtual sub-parcels may be associated with drawing target graphic information and reference tables.

  The preparation for performing the drawing process according to the present embodiment has been completed by the dividing unit 301 to the associating unit 303 described above. Next, a process for actually drawing a map image will be described. As described above, this process is triggered by reception of information relating to a display area instruction from the outside.

  Upon receiving an instruction for the map display area 111 from the drawing environment setting, the section extraction unit 304 extracts a parcel included in the display area 111 from the map data 100. The parcel information extracted here is output to the rectangle extraction unit 305.

  The rectangle extraction unit 305 extracts virtual sub-parcels included in the display area 111 from the virtual sub-parcel group that divides the parcels extracted by the section extraction unit 304. Information on the virtual sub-parcel extracted here is output to the drawing unit 306.

  The drawing unit 306 uses the drawing target graphic information associated with the virtual sub-parcel extracted by the rectangle extracting unit 305 from the drawing target graphic information included in the parcel extracted by the section extracting unit 304. A map of the display area 111 is drawn. The display data drawn by the drawing unit 306 is output to an arbitrary display device 310.

  As described above, since only the drawing target graphic associated with the virtual sub-parcel included in the display area 111 is drawn in the drawing unit 306, the drawing target graphic that does not appear in the display area 111 while existing in the parcel. Since drawing is not performed at all, the drawing speed can be greatly improved. Hereinafter, a more specific method will be described for the processes of the dividing unit 301 to the associating unit 303 and the processes of the partition extracting unit 304 to the drawing unit 306 described above.

(Composition of map data per parcel)
First, the configuration of map data used when a map image is drawn by the drawing processing apparatus 200 according to the present embodiment will be described. FIG. 4 is an explanatory diagram showing the relationship between the parcel structure of map data and the display screen. In FIG. 4, it is an assembly of parcels 401 stored in the map data 400.

  The map data 400 is composed of four parcels 401 arranged in four vertical rows and four horizontal rows, and each parcel 401 is a rectangle of parcel width W × parcel height H. A tilted rectangle 411 at the center is a screen for displaying a map image drawn by the drawing processing device 200, and represents, for example, an area corresponding to the visual field displayed on the display screen. In the example of FIG. 4, the case of a two-dimensional orthographic display in which the map surface is looked down vertically is taken as an example. Further, the central four parcels 410 with hatched lines in the map data 400 are rectangles 411, that is, the parcels 401 that are extracted as execution targets of the drawing process, depending on the user's field of view. It shows that.

  As is clear from the example of FIG. 4, the area of the screen is much smaller than the area of the four parcels 410 with hatching. In such a case, if drawing processing is performed on all the graphic data included in the four parcels 410 with hatched lines, it becomes a wasteful graphic outside the field of view rather than an effective graphic that appears in the user's field of view. On the other hand, a lot of drawing processing is consumed. Therefore, in order to suppress this waste, the virtual sub-parcel described below is set.

  Here, first, graphic data included in map data having a parcel structure will be described. FIG. 5 is a chart showing an example of a data format of graphic data included in map data having a parcel structure. FIG. 6 is a chart showing an example of the data format of the graphic data reference table.

  The data format of FIG. 5 has the same data structure as that of map data having a conventional parcel structure. This data string 500 corresponds to drawing attribute data for one figure. In this example, the number of vertices constituting a figure, a figure type designation code such as a polygon, a triangle, and a line, a fill color of the figure, and vertex coordinate values are arranged in a format. Note that the format of the data string 500 is merely an example, and other attribute data may be added or the attribute order may be changed.

  Further, the data handled by the actual drawing processing apparatus 200 is a sequence of numerical values, and finally realized by binary numbers of 0 and 1. However, here, it is expressed as a notation with a high degree of abstraction in consideration of easy understanding.

  Further, the drawing attribute data in the data string 500 is created as a series of 32-bit integers per word, for example. Depending on the value of each numerical value, it may be an unsigned integer or 16 bits per word. In the data string 500, it is assumed that the number of vertices is 6, the figure type is polygon, the fill color is RGBA packed with 8 bits and 4 channels each, and the vertex coordinates are packed with 16 bits for x and y. .

  The graphic type in the data string 500 can be expressed by a simple rule that typically assigns 1 to a straight line, 2 to a triangle, and 3 to a polygon. Such an expression may depend on the convenience of the application, but generally, the total number of graphic types is not so large that the bit width is exhausted, so there is often a large free bit area. By using this feature, it can be used as an embedding location of an identification code of a virtual sub-parcel to be described later.

  A data string 600 in FIG. 6 represents the format of a graphic data reference table that holds the reference address to the graphic data shown in FIG. In the data string 600, only the reference offset address is recorded. In addition, the arrangement order of each figure is sorted without contradiction in order to appropriately process the overlapping of the figures.

(Configuration of virtual sub-parcel)
Next, the virtual sub-parcel will be described. As described with reference to FIG. 1, in the present embodiment, the parcel is further divided into small rectangular groups, and these rectangular groups are set as sub-parcels.

  FIG. 7 is an explanatory diagram showing the relationship between the virtual sub-parcel structure and the display screen. FIG. 7 is an enlarged view of the four parcels 410, some of which are visible among the parcels shown in FIG. 4, and at least a portion of the virtual sub-parcels included in a rectangle 411 representing the field of view. Parcels are hatched with diagonal lattices to represent a virtual sub-parcel group 700. The drawing process performed later is limited to the virtual sub-parcel group 700 region.

(Graphic data generation process)
First Method for Generating Graphic Data: Parcel Division Using Higher Bits Next, two methods for generating graphic data for drawing will be described. The first method effectively performs parcel division using the upper bits. FIG. 8 is an explanatory diagram showing virtual sub-parcels on parcels in graphic data generation by the first method.

  8 has a relative size of 300 × 300 and is divided into 25 virtual sub-parcels from 00 to 44. Also, the two-digit number from 00 to 44 displayed on the virtual sub parcel becomes the identification code of the virtual sub parcel as it is.

  In the parcel 800, the parcel relative size is 300 units (300 × 300) both vertically and horizontally, and the relative size of the virtual sub-parcel is 64 units (64 × 64). However, sub-parcels having identification codes of 04, 14, 24, 34 and 40, 41, 42, 43, 44 cannot be divided by 64, and therefore have sides having a length corresponding to a remainder of 300 ÷ 64. . Specifically, the virtual sub-parcels 04, 14, 24, and 34 are 44 × 64 size, the virtual sub-parcels 40, 41, 42, and 43 are 64 × 44 size, and the virtual sub-parcel 44 is 44 × 44 size.

  Further, in FIG. 8, seven figures are extracted from the innumerable figures included in the parcel 800 as representatives. The figure A represents a road, the figures B, C, and D represent site boundaries, and the figures E, F, and G represent buildings. Here, in the parcel 800, the data arrangement order, that is, the drawing order when only focusing on the above seven figures is ABCDEFG order. Actually, many figures (not shown) are inserted between figures A to G, but the drawing order is properly sorted as a whole so that the overlap can be handled appropriately. Has been taken into account.

  In addition, the drawing order of each figure is optimized on a parcel basis as in the prior art. Therefore, if the virtual subparcel is not actually divided, but the map data structure itself is actually divided into subparcels, a large figure that does not fit in one virtual subparcel, such as figure A, is cut at the virtual subparcel boundary. Thus, it must be divided into a plurality of graphic pieces such as the graphic A1 to A9.

  For the graphic pieces divided as described above, a new drawing order must be correctly calculated for each sub-parcel and inserted into the graphic data string. In particular, since the figures B, C, D and the figures E, F, G are distributed and complicated in a plurality of sub-parcels that are separated from each other, the data collected for each virtual sub-parcel must be sorted again. More specifically, the graphic data string originally in the order of ABCDEFG must be converted into the order of arrangement such as BEA1A2A3A4A5A6A7CFA8DGA9.

  However, in the present embodiment, the virtual sub-parcel is a virtual concept as the name implies, and is reflected only in the identification code of the virtual sub-parcel. Therefore, the order of arrangement of the graphic data string may remain ABCDEFG, and there is no need to fundamentally change the data structure.

  FIG. 9 is a chart showing an example of a data format of graphic data including the identification code of the virtual sub-parcel. The data string 900 in FIG. 9 is map data that incorporates the concept of virtual sub-parcels. That is, in the data string 900, the virtual sub-parcel identification code is embedded in the empty bit area of the graphic type designation code word having a 32-bit width. For example, the graphic type designation code is limited to the lower 16 bits, and the upper 16 bits are used as the sub parcel identification code area. In the data string 900, the words other than the graphic type designation code word have the same configuration as the data format of the data string 500 in FIG.

  FIG. 10 is a flowchart showing a procedure for generating graphic data by the first method. The procedure for setting the virtual sub-parcel as described with reference to FIG. 9 will be described with reference to the flowchart of FIG. First, the figure number counter i for selecting all the figures and the vertex number counter j for selecting all the vertices of the selected figure are reset to 0 (steps S1001 and S1002), and the map material data is displayed. It is input in a stream (step S1003). Both the figure number counter i and the vertex number counter j count from 0 to n (END).

  Graphic data corresponding to the graphic number counter i is extracted from the data string constituting the map material data input in step S1003, and the x-coordinate and y-coordinate are referenced with reference to the graphic vertex coordinates included in this graphic data. Is written in the map database file (step S1004). The processing in step S1004 is the same processing as the conventional drawing processing, and specifically corresponds to processing for converting the format of the map material data into a format suitable for the display device.

  In the present embodiment, processing focusing on the sub-parcel identification code is performed in parallel with the processing in step S1004. First, the upper bits of the values of the x coordinate and y coordinate are extracted (step S1005). In the case of the present embodiment, assuming that the vertex coordinate format is an integer type instead of a floating point type, if the sub-parcel size is 64 units in length and width, a numerical value from 0 to 63 is 6 bits. Can be expressed as Therefore, if the lower 6 bits are removed by the shift operation, a numerical value related to the size and position of the sub-parcel is obtained.

  For example, taking the vertex AP1 of the concave portion of the figure F in FIG. 8 as an example, the vertex coordinates are (x, y) = (224, 32). If 224 is shifted 6 bits to the right, 3 remains, and 32 is shifted 6 bits to the right to 0. Therefore, the identification code of the virtual sub-parcel to which this vertex belongs is 30.

  Returning to the description of FIG. 10, when the upper bits of the vertex coordinates are extracted in step S1005, the temporary variable P is generated by converting the identification code of the extracted virtual sub-parcel of the vertex (step S1006). Then, it is determined whether or not the vertex coordinate read in step S1005 is the first vertex of the figure, that is, j = 0 (step S1007). If j = 0 and if it is the first vertex (step S1007: Yes), the temporary variable P generated in step S1006 is saved as temporary storage Q (step S1008).

  On the other hand, if j = 0 and the vertex read in step S1005 is not the first vertex (step S1007: No), the temporary variable P generated in step S1006 is compared with the temporary storage Q (step S1009).

  If the comparison results in step S1009 match (step S1009: Yes), it is determined whether or not selection of all vertices has been completed depending on whether j = jEND (step S1010). If there is a vertex that has not yet been selected (step S1010: No), j is incremented (step S1011), and the process returns to step S1003 to continue the next vertex number loop j.

  On the other hand, if the comparison result between P and Q does not match in step S1009 (step S1009: No), the calculation of the temporary variable P is continued while continuing the vertex number loop j relating to the writing of the figure vertex coordinates to the map database file. With respect to, the vertex number loop j is interrupted, and the process proceeds to step S1012.

  In step S1012, step S1013, depending on the comparison result between temporary variable P and temporary storage Q in step S1009, either temporary storage Q or large graphic exception code is identified as the virtual subparcel identification code of the graphic being processed. Adopt as. Specifically, when selection of all vertices is completed in step S1010 (step S1010: Yes), the stored Q is adopted as the sub-parcel identification code (step S1013).

  If the comparison result between P and Q does not match in step S1009 (step S1009: No), the large figure exception code is adopted as the sub-parcel identification code (step S1012), and the process proceeds to step S1014. The large figure exception code here is an identifier that is set for a figure that has a size and arrangement that does not fit in a single virtual subparcel, and represents a subparcel that fits in a virtual subparcel alone. It can be clearly distinguished from the identification code. Specifically, since there are 16 types of identification codes of virtual sub-parcels from 00 to 44 in FIG. 8, for example, 55 may be assigned as a code that does not overlap with these.

  When the sub-parcel identification code is adopted in step S1012 or step S1013, the adopted code is embedded in the graphic data in the map database (step S1014). Thereafter, it is determined whether or not the figure number counter i has ended (step S1015). If it has not ended (step S1015: No), the figure number counter i is incremented (step S1016). The process returns to S1002. Such processing is repeated, and when it is determined that the figure number counter i has ended (step S1015: Yes), a series of processing ends. Thus, when all the processes are completed, the sub-parcel identification code is embedded in all the graphic data in the map database.

Second Method for Generating Graphic Data: Parcel is equally divided Next, generation of graphic data by the second method will be described. In the second method, after the parcel is divided so that the sizes of the virtual sub-parcels are equal, the sub-parcel identification code is set.

  FIG. 11 is an explanatory diagram showing virtual sub-parcels on parcels in the generation of graphic data by the second method. FIG. 11 shows a state in which one parcel 1100 is enlarged and virtual sub-parcels set by the second method are overlaid. The difference from the parcel 800 of the first method described with reference to FIG. 8 is how to divide the virtual sub-parcel.

  In the first method, by using 64 which is a power of 2 as a unit, the identification code of the virtual sub-parcel is set only by shifting the vertex coordinate value and extracting the upper bits. On the other hand, as shown in FIG. 11, in the second method, the original parcel 1100 is equally divided, and the size of the virtual sub-parcel is made uniform.

  In FIG. 11, for ease of viewing, the figures B to G are drawn larger than the actual size of the virtual sub-parcel, and the arrangement is also shifted from that of FIG. 8 to fit in the virtual sub-parcel. it's shown. In actual map data, since the occupied area of a building is relatively smaller than the virtual sub-parcel size, there are often a few buildings that straddle adjacent virtual sub-parcel boundaries.

  FIG. 12 is a flowchart showing a procedure for generating graphic data by the second method. FIG. 12 shows a procedure for setting the virtual sub-parcel as described with reference to FIG. In the flowchart of FIG. 12, the process immediately after step S1014 from the process after step S1001 of the process of the flowchart of FIG. 10 is shown.

  Furthermore, when compared with the process of the flowchart of FIG. 10, only steps S1005 to S1006 are different. Therefore, the processes in steps S1204 to S1210 that are different from steps S1005 to S1006 in FIG. 10 will be described in detail below.

  When the drawing figure vertex coordinates are written in the map database file (step S1203), in parallel with this processing, the parcel is virtually divided vertically into M (step S1204) and horizontally into N (step S1207). At this time, the strip-shaped region obtained by the vertical division in step S1204 is set as Hm. Further, a strip-like region obtained by the horizontal division in step S1207 is set as Vn. M and n are variables for identifying the respective strips, and there are M and N strip-shaped regions.

  Subsequently, it is determined in which strip each the vertex coordinates x, y read in step S1202 are included. Specifically, the boundary coordinate value of the strip and the coordinate value of the vertex are compared by size comparison. It is determined whether or not xεVm with respect to the x coordinate (step S1205), m is incremented until it is determined that Vm belongs to x (step S1206), and loop processing is performed (step S1205: No loop). ). Similarly, with respect to the y coordinate, it is determined whether or not yεHn (step S1208), n is incremented until it is determined that Hn belongs to y (step S1209), and loop processing is performed (step S1208). : No loop).

  When a strip to which the vertex coordinates belong is found for each of the vertex coordinates x and y (steps S1205 and S1208: Yes), the strip numbers of x and y are connected to sub-parcel identification code mn (where mn is m and n). Mn is a temporary variable P (step S1210). The processing after setting the temporary variable P is the same as that in step S1007 in FIG. 10. When all the processing is completed, the sub parcel identification code is embedded in all the graphic data in the map database.

(Method to embed in reference table)
Sub-parcel identification codes are set and embedded in the corresponding graphic by the first and second methods described above, but the storage location of graphic data is not directly embedded in the graphic data. It may be embedded in a reference table.

  FIG. 13 is a table showing an example of the data format of the graphic data reference table including the identification code of the virtual sub-parcel. A data string 1300 in FIG. 13 represents an example in which the sub-parcel identification code set by using the above-described method is embedded in a reference table for map data.

  The data format of the graphic included in the map data is the same as the data string 500 illustrated by FIG. That is, in this method, the sub-parcel identification code is not embedded in the graphic data, but is provided on the external reference table side.

  The difference between the processes of the first and second methods described above and the process of direct embedding is that, in step S1014 in FIG. 10, the sub-parcel identification code is to be embedded separately from the graphic data in the map database. It is only a point that is changed to a reference table for graphic data to be processed.

(Map drawing procedure)
Next, a map drawing procedure in the drawing processing apparatus will be described. Here, a case where the drawing processing apparatus 200 is applied as a part of a navigation system mounted on a moving body such as a vehicle will be described as an example, and a map drawing procedure using two different methods will be described. In the first method, a case where the sub-parcel identification code is directly embedded in the graphic data described with reference to FIG. 9 will be described. In the second method, a case where a sub parcel identification code is embedded in the reference table described with reference to FIG. 13 will be described.

First Map Drawing Method FIG. 14 is a flowchart showing a map drawing procedure according to the first method. In the flowchart of FIG. 14, since it represents the behavior during normal operation (running), it can be expressed as an infinite loop originally, but here, a series of processes from when the user starts to run to when it ends.

  First, when the vehicle position is updated (step S1401), a visual field (for example, a display screen) is calculated by a general method in combination with the map scale (step S1402). When the field of view is determined in step S1402, a parcel that at least partially covers the field of view is extracted by a predetermined geometric calculation (step S1403). The geometric calculation in step S1403 is not particularly limited, and a known one is used. Further, in the same manner as in step S1403, a virtual sub-parcel whose at least part is in the field of view is extracted (step S1404).

  Then, with respect to the parcel for the field of view extracted in step S1403, a reference table for graphic data is read into the main memory (step S1405), and the parcel map data itself is also read into the main memory (step S1406).

  Further, the graphic data is read out from the parcel map data based on the reference table to the graphic data read in step S1405 (step S1407). Subsequently, the embedded sub-parcel identification code is extracted from the read graphic data (step S1408).

  In step S1408, it is determined whether or not the extracted sub-parcel identification code matches the large figure exception code (step S1409). If they match (step S1409: Yes), the figure is drawn. (Step S1410). On the other hand, if it is determined in step S1409 that they do not match (step S1409: No), it is determined whether or not the virtual subparcel represented by the extracted subparcel identification code is extracted as visible in step S1404. (Step S1411).

  In step S1411, if the virtual sub-parcel is extracted as visible in step S1404 (step S1411: Yes), the figure in the sub-parcel is drawn (step S1412), and the process proceeds to step S1413. On the other hand, in step S1411, if the virtual sub-parcel is not extracted as visible in step S1404 (step S1411: No), the process proceeds to step S1413 as it is.

  Thereafter, it is determined whether all the graphics included in the parcel recognized as visible have been processed (step S1413). If there are graphics and parcels that have not been processed yet (step S1413: No), the process returns to step S1407. Continue loop processing. In step S1413, when it is determined that all the figures included in the parcel recognized as visible have been processed (step S1413: Yes), the travel continuation determination is performed (step S1414). Step S1414: Yes), the process returns to Step S1401, and the process is continued. On the other hand, when it is determined that the traveling is finished (step S1414: No), the series of processing is finished as it is.

FIG. 15 is a flowchart showing a map drawing procedure according to the second method. In the flowchart of FIG. 15, steps S1501 to S1505 are the same as the processes of steps S1401 to S1405 of FIG.

  Then, the sub-parcel identification code embedded in the reference table read in step S1505 is extracted (step S1506). In step S1506, it is determined whether or not the extracted sub-parcel identification code matches the large figure exception code (step S1507). If they match (step S1507: Yes), then the large figure Based on the exception code, graphic data is read from the map data to the main memory (step S1508), and the read large graphic is drawn (step S1509).

  On the other hand, if it is determined in step S1507 that they do not match (step S1507: No), it is determined whether the virtual sub-parcel represented by the extracted sub-parcel identification code is extracted as visible in step S1504. (Step S1510). In step S1510, if the virtual sub-parcel is extracted as visible in step S1504 (step S1510: Yes), graphic data is read from the map data about the virtual sub-parcel into the main memory (step S1511), and this sub-parcel The figure inside is drawn (step S1512), and the process proceeds to step S1513. On the other hand, if it is determined in step S1510 that the virtual sub-parcel has not been extracted in step S1504 (step S1510: No), the process proceeds to step S1513.

  Thereafter, it is determined whether all the graphics included in the parcel recognized as visible have been processed (step S1513). If there are graphics and parcels that have not been processed yet (step S1513: No), the process returns to step S1506. Continue loop processing. In step S1513, when it is determined that all the graphics included in the parcel recognized as visible have been processed (step S1513: Yes), the travel continuation determination is performed (step S1514). Step S1514: Yes), the process returns to step S1501, and the process is continued. On the other hand, when it is determined that the traveling is finished (step S1514: No), the series of processing is finished as it is.

(Examples of application to various systems)
Next, specific application examples of the drawing processing apparatus 200 described above to various systems will be described. Here, an example in which the drawing processing apparatus 200 is applied to a car navigation system and an example in which the drawing processing apparatus 200 is applied to a mobile terminal navigation system will be described.

  FIG. 16 is a block diagram showing an example of application to a car navigation system. In FIG. 16, the car navigation apparatus 1600 is realized by applying the function of the drawing processing apparatus 200 to the car navigation system.

  As a general example, the car navigation apparatus 1600 includes a CPU 1601, a graphics LSI 1602, a main memory 1603, a graphics memory 1604, a display 1605, an IO (Input Output) controller 1606, an HDD unit 1607, an optical unit, and the like. A disk drive unit 1608, a gyro sensor 1609, and a GPS unit 1610 are provided.

  In the car navigation device 1600, the CPU 1601 reads the map data 100 stored in the HDD of the HDD unit 1607 via the IO controller 1606. The read map data 100 is stored in the main memory 1603 after performing operations and necessary conversion on the read map data 100. The data stored at this time is data in which the identification code of the virtual sub-parcel described in the present embodiment is embedded. As a result, when a drawing command is sent from the CPU 1601 to the graphics LSI 1602, generation of useless commands is suppressed, and system performance is improved.

  FIG. 17 is an explanatory diagram showing an example of application to a mobile terminal navigation system. In the system 1700 of FIG. 17, when the application server of the application provider 1710 that has received a request from the user of the mobile phone terminal 1740 via the base station 1730 and the communication carrier 1720 executes the map information providing service, The present invention described in the embodiment functions effectively.

  More specifically, the position and size information on the map space of the field of view to be displayed on the screen of the mobile phone terminal 1740 is transmitted as a request packet from the mobile phone terminal via the communication carrier 1720 to the application provider. 1710 to the application server. Upon receiving this request packet, the application server of the application provider 1710 extracts only map data related to the visual field area of the mobile phone terminal 1740 based on the identification code of the virtual sub-parcel and converts it into map drawing data.

  As a result, the application provider 1710 transmits the map drawing data of only the part related to the visual field area of the mobile phone terminal 1740 via the communication carrier 1720. By using this data, useless packet communication is suppressed and responsiveness is improved. Although not shown, the present invention can also be applied to a map application as a general wired Internet service other than the mobile phone service.

(Other hardware configuration examples)
Next, another configuration example of hardware for realizing the drawing processing function according to the present embodiment will be described. FIG. 18 is a block diagram illustrating another example of the hardware configuration of the drawing processing apparatus. The graphics LSI 1800 in FIG. 18 shows a configuration example when the sub-parcel identification code is embedded in a reference table to graphic data.

  Conventionally, the parcel of the visual field portion is searched by the CPU. Briefly describing the procedure, the vertex coordinates are input to the vertex shader to perform coordinate conversion and illumination processing. Subsequently, after receiving a triangle setup process, the input vertex is interpreted as a triangle vertex in the screen coordinates. Then, it is converted into pixel coordinates for each scanning line by a rasterizer. After that, the effect color or the like is applied to the pixel by the fragment shader, and finally the final visibility determination or the semi-transparency processing is performed by the pixel processing, and then the drawing is performed in the frame buffer.

  On the other hand, in the graphics LSI 1800 of FIG. 18, the visible parcel search and the visible sub-parcel search are implemented as hardware on the graphics LSI 1800. From the visible sub-parcel search module, an identification code of the sub-parcel determined to be visible as a search result is issued to the vertex data reading control module.

  The vertex data reading control module collates the visible sub-parcel identification code (plural) received from the visible sub-parcel search module with the sub-parcel identification code input from the outside of the graphics LSI 1800. Then, only when the collation result matches or when a large graphic exception code is input, processing can be performed so that the vertex coordinates of the corresponding graphic are read.

  As described above, according to the present embodiment, the map of the portion that does not contribute to the map display on the screen display while being the graphic data included in the same parcel without significantly modifying the original map data configuration. Data drawing can be suppressed. As a result, it is possible to improve the map drawing speed even under conditions in which great restrictions are imposed on the modification of the map data. Therefore, high-speed drawing processing can be realized without changing the configuration of the map data.

  The map drawing method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The program may be a medium that can be distributed via a network such as the Internet.

  In addition, the second processing apparatus 200 described in this embodiment is a PLD (hereinafter simply referred to as “ASIC”) such as a standard cell or a structured specific integrated circuit (ASIC) or a PLD (such as an FPGA). It can also be realized by Programmable Logic Device). Specifically, for example, the drawing processing device 200 is manufactured by defining the functions 301 to 306 of the above-described drawing processing device 200 by HDL description, logically synthesizing the HDL description and giving it to the ASIC or PLD. Can do.

  Furthermore, as a more realistic implementation method, the series of processes described in the present embodiment can be divided into two parts: a pre-process executed in non-real time and a post-process executed in real time. Specifically, functions 301 to 303 that do not necessarily need to be executed in real time are executed by a computer such as a personal computer or a workstation, and a map drawing database with a virtual sub-parcel identification code is created in advance. deep. Since the functions 304 to 306 need to be executed in real time during operation of the navigation system, it is desirable that the functions 304 to 306 be implemented as hardware as an LSI or executed in real time by the CPU.

  The following additional notes are disclosed with respect to the embodiment described above.

(Supplementary Note 1) A drawing processing apparatus for drawing an image using graphic data including graphic information existing in a first region into which an image is divided,
Dividing means for dividing the first area corresponding to the graphic data into a second area smaller than the first area;
Specifying means for specifying a second area in which at least a part of the graphic of the first area exists from the second area divided by the dividing means;
Association means for associating the second area identified by the identification means with the graphic;
A drawing processing apparatus comprising:

(Supplementary note 2) The supplementary note 1 according to supplementary note 1, wherein when the first area unit includes the reference table of the graphic, the associating unit associates the second area with the reference table. Drawing processing device.

(Supplementary Note 3) If the graphic does not fit in the specified second area, the specifying means specifies a plurality of second areas including the graphic,
The drawing processing apparatus according to appendix 1, wherein the associating unit associates the plurality of second regions identified by the identifying unit with the graphic.

(Supplementary Note 4) If the graphic does not fit in the specified second area, the specifying means specifies a plurality of second areas where at least a part of the graphic exists,
The drawing processing apparatus according to appendix 2, wherein the associating means associates the plurality of second areas specified by the specifying means with the reference table.

(Supplementary Note 5) When receiving an instruction for a display area of the image, a first area extracting unit that extracts the first area included in the display area from the graphic data;
Second region extraction means for extracting the first region extracted by the first region extraction means and the second region included in the display region;
Drawing for drawing a graphic associated with the second area extracted by the second area extracting means from among the figures existing in at least a part of the first area extracted by the first area extracting means Means,
The drawing processing apparatus according to any one of appendices 1 to 4, further comprising:

(Supplementary Note 6) A drawing processing program for causing a computer to draw the image using graphic data including graphic information existing in the first region into which the image is divided,
The computer,
A dividing means for dividing the first area corresponding to the graphic data into a second area smaller than the first area;
Specifying means for specifying the second area in which at least a part of the graphic in the first area exists from among the second areas divided by the dividing means;
Association means for associating the second area identified by the identification means with the graphic;
A drawing processing program characterized by functioning as

(Appendix 7) Upon receiving an instruction for the display area of the image,
The computer further
A first area extracting means for extracting the first area included in the display area from the graphic data;
Second area extraction means for extracting the second area included in the display area and the first area extracted by the first area extraction means;
Drawing means for drawing a graphic associated with the second area extracted by the second area extracting means from among the figures existing in at least a part of the first area extracted by the first area extracting means. ,
The drawing processing program according to appendix 6, which is caused to function as

(Supplementary note 8) A drawing processing method for drawing a map image using graphic data including information of a graphic existing in a first region into which an image is divided,
A dividing step of dividing the first area corresponding to the graphic data into a second area smaller than the first area;
A specifying step of specifying a second region in which at least a part of the graphic in the first region exists from the second region divided by the dividing step;
An associating step of associating the second region identified by the identifying step with the graphic;
The drawing processing method characterized by including.

(Supplementary Note 9) Upon receiving an instruction for a display area of the image, a first area extraction step of extracting the first area included in the display area from the graphic data;
A second region extracting step of extracting the first region extracted by the first region extracting step and the second region included in the display region;
Drawing for drawing a graphic associated with the second area extracted by the second area extraction process from among the figures existing in at least a part of the first area extracted by the first area extraction process Process,
The drawing processing method according to appendix 8, further comprising:

It is explanatory drawing which shows the outline | summary of the map drawing process concerning this Embodiment. It is explanatory drawing which shows the hardware constitutions of the drawing processing apparatus concerning this Embodiment. It is a block diagram which shows the functional structure of a drawing processing apparatus. It is explanatory drawing which shows the relationship between the parcel structure of map data, and a display screen. It is a graph which shows an example of the data format of the graphic data contained in the map data of a parcel structure. It is a chart which shows an example of the data format of the reference table of figure data. It is explanatory drawing which shows the relationship between a virtual subparcel structure and a display screen. It is explanatory drawing which shows the virtual subparcel on the parcel in the graphic data generation by a 1st method. It is a graph which shows an example of the data format of the graphic data containing the identification code of a virtual subparcel. It is a flowchart which shows the production | generation procedure of the graphic data by a 1st method. It is explanatory drawing which shows the virtual subparcel on the parcel in the production | generation of the graphic data by a 2nd method. It is a flowchart which shows the production | generation procedure of the graphic data by a 2nd method. It is a graph which shows an example of the data format of the reference table of the graphic data containing the identification code of a virtual subparcel. It is a flowchart which shows the procedure of the map drawing by a 1st method. It is a flowchart which shows the procedure of the map drawing by a 2nd method. It is a block diagram which shows the example of adaptation to a car navigation system. It is explanatory drawing which shows the example of adaptation to a portable terminal navigation system. It is a block diagram which shows the other example of the hardware constitutions of a drawing processing apparatus.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Map data 110 Parcel structure 111 Display area 120 Virtual sub parcel structure 200 Drawing processing apparatus 301 Dividing part 302 Specifying part 303 Associating part 304 Section extracting part 305 Rectangle extracting part 306 Drawing part 310 Display apparatus 1600 Car navigation apparatus 1601 CPU
1602 Graphics LSI
1603 Main memory 1604 Graphics memory 1605 Display 1606 IO controller 1607 HDD unit 1608 Optical disk drive unit 1609 Gyro sensor 1610 GPS unit 1710 Application provider 1720 Communication carrier 1730 Base station 1740 Mobile phone terminal

Claims (5)

A drawing processing apparatus that draws the image using graphic data including information on a graphic existing in a first area for dividing the image,
Dividing means for dividing the first area corresponding to the graphic data into a second area smaller than the first area;
Specifying means for specifying a second area in which at least a part of the graphic of the first area exists from the second area divided by the dividing means;
Association means for associating the second area identified by the identification means with the graphic;
A drawing processing apparatus comprising:   2. The drawing processing apparatus according to claim 1, wherein when the first area unit includes a reference table of the graphic, the association unit associates the second area with the reference table. 3. . A first area extracting means for extracting the first area included in the display area from the graphic data upon receiving an instruction for the display area of the image;
Second region extraction means for extracting the first region extracted by the first region extraction means and the second region included in the display region;
Drawing for drawing a graphic associated with the second area extracted by the second area extracting means from among the figures existing in at least a part of the first area extracted by the first area extracting means Means,
The drawing processing apparatus according to claim 1, further comprising: A drawing processing program for causing a computer to draw the image using graphic data including information of a graphic existing in a first area for dividing the image,
The computer,
A dividing means for dividing the first area corresponding to the graphic data into a second area smaller than the first area;
Specifying means for specifying the second area in which at least a part of the graphic in the first area exists from among the second areas divided by the dividing means;
Association means for associating the second area identified by the identification means with the graphic;
A drawing processing program characterized by functioning as A drawing processing method for drawing a map image using graphic data including information on a graphic existing in a first area for dividing an image,
A dividing step of dividing the first area corresponding to the graphic data into a second area smaller than the first area;
A specifying step of specifying a second region in which at least a part of the graphic in the first region exists from the second region divided by the dividing step;
An associating step of associating the second region identified by the identifying step with the graphic;
The drawing processing method characterized by including.

Images