JP2010250518A - Information processor and method, program, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To more easily manage drawing information than a conventional manner, and to sharply increase a processing speed. <P>SOLUTION: Disclosed is a drawing information management device and method for dividing a drawing configured of a plurality of drawing elements into a plurality of meshes by using a computer, and for making the respective drawing elements belong to all the meshes overlapped on the respective drawing elements, and for managing them in a storage device, wherein a drawing data processor 10 divides the mesh including more than the prescribed number of drawing elements among the plurality of meshes obtained by dividing the drawing according to a predetermined pattern into a plurality of meshes again according to the pattern, and performs the minimum mesh division so that the number of the drawing elements included in all the meshes can be made equal to or less than the prescribed number. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to an information processing apparatus and method, a program, and a recording medium, and more particularly, information processing for managing drawing elements in a storage device when drawing using an application such as CAD (Computer Aided Design) using a computer. The present invention relates to an apparatus and method, a computer-executable program, and a computer-readable recording medium on which the program is recorded.

  In order to efficiently register, search, and register a large amount of element data contained in a drawing, for example, Patent Document 1 discloses a drawing information management method according to the following conventional example. In other words, element data in a drawing is managed in units of mesh created by dividing the drawing. Here, the mesh is created by dynamically dividing the drawing so that the number of element data to be managed is uniform. The mesh division is performed by recursively repeating the mesh division, and the position of the mesh in the drawing is designated by the relative position from the mesh before the division.

  Specifically, the drawing information management method according to the conventional example is a drawing information management in which a drawing composed of a plurality of drawing elements is divided into a plurality of meshes, and each drawing element is assigned to any one mesh for management. A method comprising: a plurality of meshes obtained by dividing a drawing according to a predetermined pattern; and a mesh including a plurality of drawing elements exceeding a predetermined number is again divided into a plurality of meshes according to the pattern to thereby include drawings included in all meshes. It is characterized by performing a minimum mesh division in which the number of elements is equal to or less than a predetermined number.

  In the drawing information management method, when the minimum number of mesh division conditions in which the number of drawing elements included in all meshes is equal to or less than a predetermined number due to increase / decrease in drawing elements are not satisfied, the above condition is satisfied. It is characterized in that mesh division or mesh integration is performed so as to satisfy.

  Further, in the above drawing information management method, a drawing composed of a plurality of drawing elements is divided into a plurality of meshes, each drawing element is assigned to any one mesh and managed, and the drawings are divided according to a predetermined pattern. A first step of dividing the mesh into a plurality of meshes, and a second step of dividing a mesh including drawing elements exceeding a predetermined number among the divided meshes into a plurality of meshes again according to the pattern, wherein the second step It is characterized by repeating until the number of drawing elements included in the mesh is equal to or less than a predetermined number.

  Furthermore, in the above drawing information management method, a drawing element that spans a plurality of meshes when the mesh is divided is characterized in that the mesh to which it belongs is the mesh before division.

JP 2001-005953 A.

However, the drawing information management method according to the conventional example described above has the following problems.
(1) Since management is performed so that drawing elements do not extend over a plurality of meshes, there are cases where a plurality of meshes exist at the same position, and management of drawing information is very complicated.
(2) In a three-dimensional drawing or the like, for example, when performing hidden line processing or hidden surface processing or checking interference, if there are many small meshes in a large mesh, For example, if there is a large number of figures, characters, symbols, etc. that form a drawing element, such as a river, all drawing elements in a small mesh must be targeted only for that one drawing element. It takes a long time to process.
(3) In addition, when there are elongated drawing elements such as rivers in a large mesh, it is considered that there are many meshes that do not overlap at all in the small mesh in the large mesh. However, processing must be performed unconditionally, which takes time.
(4) At the boundary of mesh division, division and integration are repeated every time the number of graphic elements increases or decreases, which complicates processing, increases the amount of processing, and takes time.
(5) In addition, when there are many large drawing elements or when there are many overlaps in the depth (Z-axis) direction in a three-dimensional drawing, the number of drawing elements in the mesh may not be less than the predetermined number, and the division is infinite May follow.

  SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned problems, to manage drawing information more easily than in the prior art, and to further improve the processing speed, information processing apparatus and method, program, and recording medium Is to provide.

The information processing apparatus according to the first invention divides a drawing composed of a plurality of drawing elements into a plurality of meshes using a computer, and assigns each drawing element to all the meshes overlapping with each drawing element. A drawing information management device managed in a storage device,
By dividing a mesh including a predetermined number of drawing elements into a plurality of meshes according to the above pattern among a plurality of meshes obtained by dividing the drawing according to a predetermined pattern, the number of drawing elements included in all meshes can be reduced. Control means for performing minimum mesh division so as to be equal to or less than the predetermined number is provided.

  In the information processing apparatus, the control unit repeats the step of performing the minimum mesh division so that the number of drawing elements included in all meshes is equal to or less than the predetermined number.

  In the information processing apparatus, the control means does not perform mesh integration when the graphic elements are reduced, and the number of drawing elements included in all the meshes is equal to or less than a predetermined number only when the drawing elements are increased. When the minimum condition for mesh division is no longer satisfied, or when the number is smaller than a predetermined number or a number calculated according to a predetermined pattern, mesh division is performed so that the above condition is satisfied. It is characterized by.

  Further, in the information processing apparatus, the control means executes re-division of the mesh when a drawing is read, or when a drawing element exceeding a predetermined number is edited in a moving process, a copying process, or a deleting process. It is characterized by doing.

  Still further, in the information processing apparatus, when the mesh is divided, when the mesh size is smaller than a predetermined size or a size calculated according to a predetermined pattern, or a predetermined end When the condition is satisfied, the mesh division is terminated.

  Furthermore, in the information processing apparatus, when the control means checks or processes the relationship between the drawing elements, the drawing element that overlaps at least partly with the mesh to be processed is included in the mesh to be processed. When all checks or processes are completed, the processing for each drawing element is stored in the storage device, and whether or not the target drawing elements have been checked or processed at the time of the entire check or processing of the next mesh to be processed is described above. The determination is made based on the information stored in the storage device, and if the processing is completed, the processing is omitted.

An information processing method according to a second invention uses a computer to divide a drawing composed of a plurality of drawing elements into a plurality of meshes, and assign each drawing element to all the meshes overlapping each drawing element. A drawing information management method for managing in a storage device,
By dividing a mesh including a predetermined number of drawing elements into a plurality of meshes according to the above pattern among a plurality of meshes obtained by dividing the drawing according to a predetermined pattern, the number of drawing elements included in all meshes can be reduced. The method includes a step of performing minimum mesh division so as to be equal to or less than the predetermined number.

  In the information processing method, the step of performing the minimum mesh division is repeated so that the number of drawing elements included in all meshes is equal to or less than the predetermined number.

  In the above information processing method, the minimum number of meshes in which the number of drawing elements included in all the meshes is less than or equal to the predetermined number only when the number of drawing elements is increased, without integrating the meshes when the number of graphic elements is reduced. The method further includes a step of dividing the mesh so that the condition is satisfied when the condition for the division is not satisfied, or when the condition is smaller than a predetermined number or a number calculated according to a predetermined pattern. Features.

  Furthermore, the information processing method further includes a step of re-dividing the mesh when a drawing is read or when more than a predetermined number of drawing elements are edited in the moving process, copying process, or deleting process. It is characterized by that.

  Furthermore, in the above information processing method, when the mesh size is smaller than a predetermined size or a size calculated according to a predetermined pattern at the time of mesh division, or a predetermined end condition is satisfied The method further includes the step of ending the mesh division.

  Furthermore, in the above information processing method, when checking or processing the relationship between drawing elements, for a drawing element that overlaps at least partly with the mesh to be processed, all checks or processes in the mesh to be processed are performed. When finished, the processing for each drawing element is stored in the storage device, and whether or not the target drawing elements have been checked or processed at the time of all checks or processing of the next mesh to be processed is stored in the storage device. The method further includes a step of determining based on the information and omitting the processing if it has been processed.

  A program executable by a computer according to the third invention includes the steps included in the information processing method.

  A computer-readable recording medium according to a fourth invention stores the above program.

  Therefore, according to the present invention, it is possible to provide an information processing apparatus, method, and the like that can easily manage drawing information as compared with the conventional example and can greatly improve the processing speed. Specifically, the present invention has the following specific effects.

(1) Since only one mesh exists at the same position, there is no need to be aware of overlap with other meshes, and the management of drawing information is simple.
(2) When processing a multi-layer mesh for a three-dimensional drawing or the like, for example, when performing hidden line processing or hidden surface processing, or checking for interference, only drawing elements belonging to each mesh can be processed. Therefore, it is not necessary to perform processing with other meshes, and processing can be performed in a very short time. For example, when performing hidden line processing, hidden surface processing, or interference check, it is only necessary to determine the brute force area between parts in each mesh. Processing can be realized. When the division number D is 10, an effect of up to 10 times (that is, 1/10 in processing time) is obtained, and when the division number D is 100, an effect of up to 100 times (processing time: 1/100) is obtained. Similarly, when performing the selection operation, it is only necessary to target drawing elements in the mesh that overlap the selection range. Therefore, as described above, the effect of improving the processing speed of the contents and the like can be obtained at the maximum.
(3) The overhead for detecting the reduction of each drawing element is greatly reduced.
(4) The division does not continue indefinitely in a special case, and the division ends quickly with an appropriate number of divisions.
(5) When multiple meshes are processed, hidden lines / hidden surfaces, interference check, etc. check and process the relationship between drawing elements. Checking and processing are performed only once, and processing is not wasted.

It is a block diagram which shows the structure of the drawing data processing apparatus which concerns on one Embodiment of this invention. FIG. 2 is a block diagram illustrating a configuration of a hard disk memory 23 in FIG. 1. It is a figure which shows an example of drawing element table 23b of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the mesh table 23c of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the line segment data table 23d of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the circle data table 23e of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the ellipse data table 23f of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the processed drawing element table 23g of FIG. 2 in Example 1 of FIG. It is a figure which shows an example of the mesh table 23c (attribute element) of FIG. 2 in Example 2 of FIG. It is a figure which shows an example of the mesh table 23c (attribute) of FIG. 2 in Example 3 of FIG. (A) is a figure which shows an example of the processed drawing element table 23g of the initialization state in Example 3 of FIG. 22, (b) is the processed drawing element table when the area | region R1 in the said Example 3 is processed. It is a figure which shows an example of 23g, (c) is a figure which shows an example of the processed drawing element table 23g when the area | region R2 in the said Example 3 is processed, (d) is area | region R3 in the said Example 3. It is a figure which shows an example of the processed drawing element table 23g when processing is carried out. It is a flowchart which shows the "hidden line process" (step S1) which concerns on this embodiment. It is a flowchart which shows the "mesh division and determination process" (step S2) which concerns on this embodiment. It is a flowchart which shows the "hidden line process per mesh" (step S3) which concerns on this embodiment. It is a flowchart which shows the "drawing element selection process" (step S4) based on this embodiment. It is a flowchart which shows the "drawing reading process" (step S5) which concerns on this embodiment. It is a flowchart which shows the "copy process" (step S6) based on this embodiment. It is a flowchart which shows the "deletion process" (step S7) which concerns on this embodiment. It is a flowchart which shows the "drawing element increase / decrease determination process" (step S8) based on this embodiment. It is a top view of drawing which shows arrangement | positioning of components AF in 4 division area D1-D4 of Example 1 which concerns on this embodiment. It is a top view of drawing which shows arrangement | positioning of components AG in area | region R1-R4 of Example 2 which concerns on this embodiment. It is a top view of drawing which shows arrangement | positioning of components AG in area | region R1-R4 of Example 3 which concerns on this embodiment. It is a top view of the component in case the number of parts is 3000 which shows the method to determine the division | segmentation number according to the number of parts based on Example 4 of this embodiment. It is a top view of the component in case the number of parts is 7000 which shows the method to determine the division | segmentation number according to the number of components based on Example 5 of this embodiment.

10. Drawing data processing device,
20 ... CPU,
21 ... ROM,
22 ... RAM,
23. Hard disk memory,
23a: Drawing data memory,
23b ... Drawing element table,
23c ... Mesh table,
23d: line segment data table,
23e ... yen data table,
23f ... Ellipse data table,
23g ... processed drawing element table,
24 ... Program memory,
30 ... Bus
31 ... Keyboard interface,
32 ... Mouse interface,
33 ... Display interface,
34 ... Printer interface,
35a, 35b ... drive device interface,
41 ... Keyboard,
42 ... mouse,
43 ... CRT display
44 ... Printer,
45 ... CD-ROM drive device,
45a ... CD-ROM,
70 ... Equipment information database server device,
80 ... Internet,
D1 to D4 ... 4 divided areas,
R1 to R4 region,
RR1, RR2 ... Existing areas of all parts,
SR: Selected rectangular area.

  Hereinafter, embodiments according to the present invention will be described with reference to the drawings. In addition, in each following embodiment, the same code | symbol is attached | subjected about the same component.

  FIG. 1 is a block diagram showing a configuration of a drawing data processing apparatus 10 according to an embodiment of the present invention. The drawing data processing apparatus 10 in FIG. 1 is a digital computer which is an information processing apparatus, for example, and by executing the processing programs in FIGS. 12 to 19, a drawing composed of a plurality of drawing elements using a computer. In a drawing information management apparatus and method for dividing a plurality of meshes and assigning each drawing element to all meshes overlapping with each drawing element and managing them in the storage device, the drawing data processing apparatus 10 follows a predetermined pattern. Of the plurality of meshes obtained by dividing the drawing, a mesh including a predetermined number of drawing elements is again divided into a plurality of meshes according to the pattern, so that the number of drawing elements included in all the meshes is equal to or less than the predetermined number. As described above, the minimum mesh division is performed.

  Hereinafter, the configuration and processing of the drawing data processing apparatus 10 according to the present embodiment will be described in detail.

  In FIG. 1, the communication interface 51 of the drawing data processing apparatus 10 is connected via the Internet 80 to an equipment information database server 70 that stores and provides equipment information in advance, and the drawing data processing apparatus 10 By accessing the equipment information database server device 70, desired equipment information is acquired and stored in the hard disk memory 23. Further, the drawing data processing apparatus 10 is connected to an external storage device 60 that is, for example, a hard disk memory and stores and provides equipment information in advance, via the drive device interface 35 b of the drawing data processing apparatus 10. The desired equipment information may be acquired and stored in the hard disk memory 23 by accessing.

In FIG. 1, a drawing data processing apparatus 10
(A) a CPU (central processing unit) 20 of a computer that calculates and controls the operation and processing of the drawing data processing apparatus 10;
(B) a ROM (read only memory) 21 for storing a basic program such as an operation program and data necessary for executing the basic program;
(C) a RAM (random access memory) 22 that operates as a working memory of the CPU 20 and temporarily stores parameters and data (including the temporary list table 22a) necessary for the drawing data processing;
(D) a hard disk memory 23 for storing various data (see FIG. 2) used in the drawing data processing;
(E) A program memory that is composed of, for example, a hard disk memory and stores the processing programs of FIGS. 12 to 19 (these programs are programs that can be executed by a computer) read using the CD-ROM drive device 45. 24,
(F) a communication interface 51 that is connected to the equipment information database server device 70 via the Internet 80 and transmits / receives data to / from the equipment information database server device 70;
(G) A keyboard connected to a keyboard 41 for inputting predetermined data and instruction commands, receiving data and instruction commands input from the keyboard 41, performing predetermined interface processing such as signal conversion, and transmitting the data to the CPU 20 Interface 31;
(H) Connected to a mouse 42 for inputting instruction commands on the CRT display 43, receives data and instruction commands input from the mouse 42, performs predetermined signal conversion and other interface processing, and transmits them to the CPU 20. A mouse interface 32;
(I) Connected to a CRT display 43 that displays data processed by the CPU 20, a setting instruction screen, generated device table data, system diagram data, and the like, and converts image data to be displayed into an image signal for the CRT display 43. A display interface 33 for outputting and displaying on the CRT display 43;
(J) Connected to a printer 44 that prints data processed by the CPU 20 and predetermined generated device table data, system diagram data, etc., performs predetermined signal conversion of the print data to be printed, and outputs it to the printer 44 A printer interface 34 for printing,
(K) Connected to a CD-ROM drive device 45 that reads program data of the program from the CD-ROM 45a in which the processing programs of FIGS. 12 to 19 are stored, and the read program data of the image processing program is a predetermined signal. A drive device interface 35a for performing conversion and transferring to the program memory 24;
(L) A drive device that stores data of equipment information, for example, is connected to an external storage device 60 such as a hard disk memory and transfers the read data to the CPU 20 or the hard disk memory 23 by performing predetermined signal conversion or the like An interface 35b,
These circuits 20 to 24, 31 to 34, 35 a, 35 b and 51 are connected via a bus 30.

FIG. 2 is a block diagram showing the configuration of the hard disk memory 23 of FIG. In FIG. 2, the hard disk memory 23 includes a plurality of memories 23a for storing the following data files.
(A) Drawing data memory 23a: A memory for storing drawing data of duct wiring such as air conditioning equipment in a building.
(B) The following table is stored in the drawing data memory 23a.
(B1) drawing element table 23b;
(B2) Mesh table 23c;
(B3) line segment data table 23d;
(B4) Yen data table 23e;
(B5) Ellipse data table 23f;
(B6) A processed drawing element table 23g.

  FIG. 3 is a diagram showing an example of the drawing element table 23b of FIG. 2 in the first embodiment of FIG. As shown in FIG. 3, the drawing element table 23b has a drawing element name, an existing area (maximum coordinates and minimum coordinates in XYZ coordinates), and a figure forming a part (figure 1) for each part ID that is a drawing element. To figure n).

  FIG. 4 is a diagram illustrating an example of the mesh table 23c of FIG. 2 in the first embodiment of FIG. As shown in FIG. 4, the mesh table 23 c includes items of an existing region (maximum coordinates and minimum coordinates in XYZ coordinates) and belonging drawing elements (each element and determination result) for each region. Here, in the determination result, ◯ indicates “completely included”, and Δ indicates “overlapping”. The same applies to the mesh table 23c.

  FIG. 5 is a diagram showing an example of the line segment data table 23d of FIG. 2 in the first embodiment of FIG. As shown in FIG. 5, the line segment data table 23d has items of a start point indicated by XYZ coordinates and an end point indicated by XYZ coordinates for each name of the drawing data.

  6 is a diagram showing an example of the circle data table 23e of FIG. 2 in the first embodiment of FIG. As shown in FIG. 6, the circle data table 23e has items of a center and a radius indicated by XYZ coordinates for each name of drawing data.

  FIG. 7 is a diagram illustrating an example of the ellipse data table 23f of FIG. 2 in the first embodiment of FIG. As shown in FIG. 7, the ellipse data table 23 f has items of a center, a radius, a flatness ratio, and a slope indicated by XYZ coordinates for each drawing data name.

  FIG. 8 is a diagram showing an example of the processed drawing element table 23g of FIG. 2 in the embodiment 1 of FIG. As shown in FIG. 8, the drawing element table 23g has, for each part ID, an item of a drawing element name that is a part and a drawing element ID (address, etc.).

  First, a processing flow of hidden line processing according to the four-division fixed method executed by the drawing data processing apparatus 10 of FIG. 1 will be described below.

  In this embodiment, for example, the graphic of each part is expanded into a line segment, and the intersection of the line segment of each lower part graphic (including an infinite line, that is, an extended line from the line segment) and all the graphic of the upper part. And calculate whether or not there is an intersection before the end point of the line segment, and how far the line segment overlaps with the combination of the states at both ends of the line segment, and perform a hidden calculation by performing a hidden line Hidden line determination processing is performed, and “Hidden line determination”, “Hidden line determination” or “Hidden line determination” means “determine whether a line is displayed or erased” The same applies hereinafter in the description and the like.

  FIG. 12 is a flowchart showing “hidden line processing” (step S1) according to the present embodiment. In FIG. 12, first, in step S11, data in the “processed drawing element table 23g” is deleted and initialized, and in step S12, “mesh division and determination processing” (S2) is executed. Here, executing the “mesh division and determination process” (S2) in advance is effective in executing the entire process. Next, it is determined whether or not the hidden line processing has been performed on all the meshes obtained in step S13. If YES, the processing ends. If NO, the processing proceeds to step S14. In step S14, “hidden line processing in mesh units” (S3) is executed, and then the process returns to step S13. Here, by executing “hidden line processing in units of meshes” (S3), it is possible to increase the speed up to the same multiple as the number of meshes.

  FIG. 13 is a flowchart showing the “mesh division and determination process” (step S2) according to the present embodiment.

  In FIG. 13, first, in step S21, the total number of parts in the mesh is calculated. In step S22, it is determined whether the total number of parts is greater than a predetermined number N. If YES, the process proceeds to step S23, while NO. If so, the process is terminated and the process returns to the original process. In step S23, the existence area of all the parts in the mesh is calculated, and in step S24, the mesh is equally divided into four equal parts (each divided vertically and horizontally), and the mesh divided in step S25 is smaller than a predetermined minimum size. It is determined whether or not it is large. When the answer is YES (that is, when the mesh is equal to or smaller than the predetermined size), the process proceeds to step S26, and when the answer is NO, the process proceeds to step S33. In step S26, it is determined whether or not the region has been determined for all parts of the mesh before division. When YES, the process proceeds to step S33, and when NO, the process proceeds to step S27. In step S27, it is determined whether or not region determination has been performed for all divided meshes. If YES, the process returns to step S26, and if NO, the process proceeds to step S28. In step S28, the part area of the part under determination is calculated. In step S29, it is determined whether the part area under determination covers the mesh. If YES, the process proceeds to step S30. If NO, The process returns to step S27. In step S30, the part under determination is registered in the mesh table 23c as “overlapping” on the mesh. In step S31, it is determined whether or not it is completely included in the mesh of the component area being determined. If YES, the process proceeds to step S32. If NO, the process returns to step S27. In step S32, the part under determination is registered in the mesh table 23c as “completely included” in the mesh. Then, the process returns to step S27.

  Next, in step S33, the numbers of “overlapping” and “completely included” of all the divided meshes are calculated, and in step S34, the number of “overlapping” in each mesh ≧ the number of “completely included”. It is determined whether or not there is, and when the answer is YES (when a predetermined end condition is satisfied), the process ends and the process returns to the original process. When the answer is NO, the process proceeds to step S35. Next, it is determined whether or not the region has been determined for all the meshes divided in step S35. If YES, the process proceeds to step S35, and if NO, the process proceeds to step S36. In step S36, the “mesh division and determination process” (S2) subroutine is read and executed for the mesh being determined, and the process returns to step S35.

  FIG. 14 is a flowchart showing “hidden line processing in units of meshes” (step S3) according to the present embodiment.

  In FIG. 14, it is first determined in step S41 whether or not hidden line processing has been executed for all parts of the mesh. If YES, the process proceeds to step S48, and if NO, the process proceeds to step S42. In step S42, the upper part and the lower part to be hidden are acquired, and in step S43, it is determined whether or not the upper part is “overlapping”. If YES, the process proceeds to step S44, and if NO. Advances to step S47. In step S44, it is determined whether the upper part is registered in the “processed drawing element table 23g”. If YES, the process proceeds to step S45. If NO, the process proceeds to step S47. Next, in step S45, it is determined whether the lower part is “overlapping”. If YES, the process proceeds to step S46, and if NO, the process proceeds to step S47. In step S46, it is determined whether or not the lower part is registered in the “processed drawing element table 23g”. If YES, the process returns to step S41. If NO, the process proceeds to step S47. In step S47, hidden line processing is performed between the upper part and the lower part, and the process returns to step S41.

  In step S48, it is determined whether or not all parts of the mesh have been checked. If YES, the process ends. If NO, the process proceeds to step S49. In step S49, it is determined whether or not the part is “overlapping”. If YES, the process proceeds to step S50, and if NO, the process returns to step S48. In step S50, the part with “overlap” is registered in the “processed drawing element table 23g”, and the process returns to step S48.

  Next, drawing element selection processing executed by the drawing data processing apparatus 10 of FIG. 1 will be described below.

  FIG. 15 is a flowchart showing the “drawing element selection process” (step S4) according to the present embodiment. Note that the mesh division and determination process (S2) of FIG. 13 is performed in advance. In FIG. 15, first, in step S51, it is determined whether or not region determination has been performed for all meshes. If YES, the process ends. If NO, the process proceeds to step S52. Next, in step S52, the overlap with the selected area is checked in units of meshes. In step S53, it is determined whether or not there is an overlap of the areas. If YES, the process proceeds to step S54. If NO, the process returns to step S51. . Further, in step S54, selection processing is executed for all parts in the mesh, and the process returns to step S51. In other words, by determining the area in units of meshes, the speed can be increased up to the same multiple as the number of meshes.

  Further, a drawing element increase or decrease process executed by the drawing data processing apparatus 10 of FIG. 1 will be described below.

  FIG. 16 is a flowchart showing the “drawing reading process” (step S5) according to the present embodiment. In FIG. 16, first, in step S61, drawing element data is read from the drawing element table 23b, and the number (saved value) of the drawing elements increased / decreased in step S62 is acquired. In step S63, “drawing element increase / decrease determination processing”. The subroutine (S8) is read and executed, and the process is terminated.

  FIG. 17 is a flowchart showing the “copying process” (step S6) according to the present embodiment. In FIG. 17, first, the drawing element data to be edited is copied in step S71, and the number of drawing elements copied in step S72 is added to the increased or decreased drawing element number. In step S73, “drawing element increase / decrease determination process” ( The subroutine of S8) is read and executed, and the process is terminated.

  FIG. 18 is a flowchart showing the “deleting process” (step S7) according to the present embodiment. 18, first, the drawing element data to be edited is deleted in step S81, and the deleted drawing element number is subtracted from the increased or decreased drawing element number in step S82. In step S83, “drawing element increase / decrease determination process” is performed. The subroutine (S8) is read and executed, and the process is terminated.

  FIG. 19 is a flowchart showing “drawing element increase / decrease determination processing” (step S8) according to the present embodiment. In FIG. 19, first, in step S91, the number of increased / decreased drawing elements is acquired. In step S92, it is determined whether or not the increased number of drawing elements exceeds a predetermined value. If YES, the process proceeds to step S94. If NO, the process proceeds to step S93. Next, it is determined whether or not the number of drawing elements decreased in step S93 exceeds a predetermined value. If YES, the process proceeds to step S94. If NO, the process ends. In step S94, the subroutine “mesh division and determination process” (S2) is read and executed, and the process ends.

  In the above embodiment, it may be executed by using a CD-ROM 45a readable by a computer in which the processing programs of FIGS. 12 to 19 are stored, CD-R, CD-RW, DVD, DVD-R, Various recording media readable by a computer such as DVD-RW and DVD-RAM may be used.

  FIG. 20 is a plan view of the drawing showing the arrangement of the parts A to F in the four divided regions D1 to D4 of Example 1 according to the present embodiment. 3 to 8 are examples of the tables 23b to 23g used in the first embodiment. That is, FIG. 20 shows the arrangement of the parts A to F by dividing the plane of the drawing into four regions D1 to D4. The processed drawing element table 23g of FIG. 8 can be obtained by executing the processing of FIGS. 12 and 13 on the first embodiment of FIG.

  FIG. 21 is a plan view of the drawing showing the arrangement of the parts A to G in the regions R1 to R4 of Example 2 according to the present embodiment. FIG. 9 is a diagram showing an example of the mesh table 23c (belonging element) of FIG. 2 in the second embodiment of FIG. In the second embodiment, the selection process of FIG. 15 is executed. Hereinafter, an outline of the selection process will be described below.

(1) In FIG. 21, the selection process is executed within the range of the selected rectangular area SR.
(2) The overlap between the area R1 and the selected rectangular area SR is checked, and since there is an overlap, the selection process is executed for the parts (part C, part F, part G) belonging to the area R1. In the embodiment, as a result, the parts C and F are selected.
(3) The overlap between the region R2 and the selected rectangular region SR is checked, and the process is omitted because there is no overlap.
(4) The overlap between the region R3 and the selected rectangular region SR is checked. Since there is no overlap, this processing is omitted.
(5) Check the overlap between the area R4 and the selected rectangular area SR, and since there is an overlap, execute the selection process for the parts belonging to the area R4 (part C, part D, part E, part F). To do. However, since it is understood that the selected part is selected in the selection process, the process is omitted. In the second embodiment, as a result, the part D is additionally selected.

  FIG. 22 is a plan view of the drawing showing the arrangement of the parts A to G in the regions R1 to R4 of Example 3 according to the present embodiment. FIG. 10 is a diagram showing an example of the mesh table 23c (belonging element) of FIG. 2 in the third embodiment of FIG. Further, FIG. 11A is a diagram showing an example of the processed drawing element table 23g in the initialized state in the third embodiment of FIG. 22, and FIG. 11B is a diagram when the region R1 in the third embodiment is processed. FIG. 11C is a diagram showing an example of the processed drawing element table 23g when the region R2 in the third embodiment is processed, and FIG. d) is a diagram showing an example of the processed drawing element table 23g when the region R3 in the third embodiment is processed. In the third embodiment, hidden line processing is executed. Hereinafter, an outline of the hidden line processing will be described below.

(1) In FIG. 22, hidden line processing is executed in the entire area.
(2) The region of the drawing is divided into four to be R1 to R4.
(3) It is checked whether a combination of parts (part C, part F, part G) belonging to the region R1 is registered in the “processed drawing element table 23g”, and there is no registered part (FIG. 11 ( (See “Processed drawing element table 23g (initialized state)” in a).) Therefore, hidden line processing is executed for all parts. As a result, hidden line processing is performed between the parts C and F.
(4) The “overlapping” parts (part C, part F) in the region R1 are registered in the “processed drawing element table (initialized state)” of FIG. 11A, and “parts” of FIG. Processed drawing element table 23g (process area R1) ".
(5) It is checked whether a combination of parts (part A, part B, part F) belonging to the region R2 is registered in the “processed drawing element table 23g”, and there is no combination (FIG. 11A (See “Processed Drawing Element Table (Initialized State)”).)) Execute hidden line processing for all parts. As a result, hidden lines are processed between the parts A and B and between the parts A and F.

(6) The “overlapping” part (part B) in area R2 is additionally registered in “processed drawing element table 23g (process area R1)” of FIG. Processed drawing element table 23g (process area R2) ".
(7) It is checked whether a combination of parts (part B, part F) belonging to the region R3 is registered in the “processed drawing element table 23g”, and there is a combination (see “ (See “Processed drawing element table 23g (process area R2)”.) As a result, hidden lines are processed between the parts A and B and between the parts A and F.
(8) Since there is no part to be added in the “overlapping” part in the region R3, there is no change in the “processed drawing element table (process the region R2)” in FIG. d) “Processed drawing element table (process area R3)”.
(9) Of the combinations of parts belonging to the region R4 (part C, part D, part E, part F), the combination of the part C and the part F is registered in the “processed drawing element table 23g”. (See “Processed Drawing Element Table 23g (Process Region R3)” in FIG. 118d)), and hidden line processing is executed for combinations other than the combination. As a result, hidden lines are processed between the parts D and F and between the parts D and E.
(10) Since there is no part to be added in the “overlapping” part in the region R4, there is no change in the “processed drawing element table 23g (process the region R3)” in FIG. This completes the hidden line process.

  FIG. 23 shows a method for determining the number of divisions according to the number of components according to Example 4 of the present embodiment, and is a plan view of components in the case of 3000 components. As a reference example of division, division is performed so that the number of parts of each mesh is 1000 or less (S22 in FIG. 13: hereinafter referred to as process A). In FIG. 23, when the number of parts is 3000, the existing mesh is divided into four. Then, in each mesh, if the number of parts exceeds 1000, the number of divisions is similarly determined for that mesh. Then, it is divided (step S22 in FIG. 13: hereinafter referred to as process B). Further, the processes A and B are repeatedly executed for each mesh (step S36 in FIG. 13).

  FIG. 24 shows a method for determining the number of divisions according to the number of components according to Example 5 of the present embodiment, and is a plan view of components in the case of 7000 components. When the number of parts is 7000 in the fifth embodiment, the existing mesh is divided into nine by process A (step S22 in FIG. 13). Next, as in the fourth embodiment, the process B is executed (step S22 in FIG. 13), and the processes A and B are repeatedly executed for each mesh (step S36 in FIG. 13).

In the sixth embodiment, a method is used in which an area of the drawing is divided into two (fixed number division), and the division is finished according to the number of parts belonging to each mesh.
(1) When the number of parts of each mesh is 1000, the mesh is divided into two (fixed number division) (step S24 in FIG. 13).
(2) If the number of parts exceeds 1000 in each mesh, the mesh is similarly divided into two (individual constant division) (step S24 in FIG. 13).
(3) The above processes (1) and (2) are repeated for each mesh (step S36 in FIG. 13).

  Verification of the effects of the processing of Examples 5 and 6 is performed as follows. Here, when there are N parts, the number Nj of determining the area is expressed by the following equation.

[Equation 1]
Nj == N × (N−1) / 2 (1)

  Therefore, when the number N of parts is 100,000, the number of times of area determination is Nj = 4,999,550,000 times, and about 5 billion area determinations are required. Here, a case where the number of divisions is D and parts are evenly arranged on each mesh will be verified. In this case, the number of parts in each mesh is N / D. The number of times Nj for determining the area is expressed by the following equation.

[Equation 2]
Nj
= D * N + (N / D * (N / D-1)) / 2 * D
= D * N + N * (N / D-1) / 2
= D * N + (N * (ND) / 2) / D
= D * N + N (D-1) / 2D + (N * (N-1) / 2) / D (2)

  Here, when the number N of parts is sufficiently large, when the number N of parts is compared to (N × (N−1) / 2) / D, D × N + N (D−1) / 2D is overwhelmingly small. Since the first term and the second term on the right side of the final formula of formula (2) can be ignored, the following formula is obtained.

[Equation 3]
Nj≈ (N × (N−1) / 2) / D (3)

  Therefore, it can be seen that the number of times Nj for determining the region is the same multiple as the number of divisions and the processing time is reduced. For example, when dividing the total number of parts N = 100,000 so that the number of parts is equal to or less than 1000, when the case where the parts are evenly arranged in each divided area is verified, the division number D = 100 divisions. In this case, the processing speed can be increased 100 times (processing time is 1/100) as compared with the processing according to the conventional example.

  As described above in detail, according to the present invention, it is possible to provide an information processing apparatus, method, and the like that can easily manage drawing information as compared with the conventional example and can greatly improve the processing speed. Specifically, the present invention has the following specific effects and has industrial applicability.

(1) Since only one mesh exists at the same position, there is no need to be aware of overlap with other meshes, and the management of drawing information is simple.
(2) When processing a multi-layer mesh for a three-dimensional drawing or the like, for example, when performing hidden line processing or hidden surface processing, or checking for interference, only drawing elements belonging to each mesh can be processed. Therefore, it is not necessary to perform processing with other meshes, and processing can be performed in a very short time. For example, when performing hidden line processing, hidden surface processing, or interference check, it is only necessary to determine the brute force area between parts in each mesh. Processing can be realized. When the division number D is 10, an effect of up to 10 times (that is, 1/10 in processing time) is obtained, and when the division number D is 100, an effect of up to 100 times (processing time: 1/100) is obtained. Similarly, when performing the selection operation, it is only necessary to target drawing elements in the mesh that overlap the selection range. Therefore, as described above, the effect of improving the processing speed of the contents and the like can be obtained at the maximum.
(3) The overhead for detecting the reduction of each drawing element is greatly reduced.
(4) The division does not continue indefinitely in a special case, and the division ends quickly with an appropriate number of divisions.
(5) When multiple meshes are processed, hidden lines / hidden surfaces, interference check, etc. check and process the relationship between drawing elements. Checking and processing are performed only once, and processing is not wasted.

Claims (14)

A drawing information management device that uses a computer to divide a drawing composed of a plurality of drawing elements into a plurality of meshes, and assigns each drawing element to all meshes that overlap each drawing element and manages them in a storage device. And
By dividing a mesh including a predetermined number of drawing elements into a plurality of meshes according to the above pattern among a plurality of meshes obtained by dividing the drawing according to a predetermined pattern, the number of drawing elements included in all meshes can be reduced. An information processing apparatus comprising control means for performing minimum mesh division so as to be equal to or less than the predetermined number.   2. The information processing apparatus according to claim 1, wherein the control means repeats the step of performing the minimum mesh division so that the number of drawing elements included in all meshes is equal to or less than the predetermined number. .   The above control means does not perform mesh integration when the graphic elements are reduced, and only when the number of drawing elements is increased, the minimum number of mesh division conditions in which the number of drawing elements included in all meshes is equal to or less than the predetermined number. The mesh division is performed so that the above condition is satisfied when the value is not satisfied or is smaller than a predetermined number or a number calculated according to a predetermined pattern. 2. The information processing apparatus according to 2.   The control means executes re-division of the mesh when a drawing is read, or when a drawing element exceeding a predetermined number is edited in a moving process, a copying process, or a deleting process. The information processing apparatus according to any one of 1 to 3.   When the mesh size is smaller than a predetermined size or a size calculated according to a predetermined pattern, or when a predetermined termination condition is satisfied, the control means performs mesh division. The information processing apparatus according to claim 1, wherein the information processing apparatus is terminated.   When checking or processing the relationship between drawing elements, the above control means, for drawing elements that overlap at least partly with the mesh to be processed, after all checks or processing within the mesh to be processed have been completed, Based on the information stored in the storage device, whether or not the target drawing elements have been checked or processed at the time of all checks of the next processing target mesh or processing is stored in the storage device. The information processing apparatus according to claim 1, wherein the processing is omitted if it is determined and processed. A drawing information management method in which a drawing composed of a plurality of drawing elements is divided into a plurality of meshes using a computer, and each drawing element is attributed to all meshes overlapping each drawing element and managed in a storage device. And
By dividing a mesh including a predetermined number of drawing elements into a plurality of meshes according to the above pattern among a plurality of meshes obtained by dividing the drawing according to a predetermined pattern, the number of drawing elements included in all meshes can be reduced. An information processing method comprising a step of performing minimum mesh division so as to be equal to or less than the predetermined number.   8. The information processing method according to claim 7, wherein the step of performing the minimum mesh division is repeated so that the number of drawing elements included in all meshes is equal to or less than the predetermined number.   Mesh integration is not performed when the number of figure elements decreases, and the above minimum mesh division condition that the number of drawing elements included in all meshes is less than the predetermined number is not satisfied only when the number of drawing elements increases The method further includes a step of dividing the mesh so that the above condition is satisfied when the predetermined number or the number calculated according to the predetermined pattern is smaller than the predetermined number. The information processing method described.   8. The method of claim 7, further comprising a step of re-dividing the mesh when a drawing is read, or when a predetermined number of drawing elements have been edited in a move process, a copy process, or a delete process. The information processing method as described in any one of thru | or 9.   In mesh division, if the size of the mesh is smaller than a predetermined size or a size calculated according to a predetermined pattern, or if a predetermined termination condition is satisfied, the step of terminating the mesh division is further performed The information processing method according to claim 7, wherein the information processing method is included.   When checking or processing the relationship between drawing elements, drawing elements that overlap at least partly with the processing target mesh are processed for each drawing element after all checks or processing in the processing target mesh is completed. This is stored in the storage device, and whether all the drawing elements to be processed are checked or processed at the time of all checks or processing of the next mesh to be processed is determined based on the information stored in the storage device and processed. The information processing method according to claim 7, further comprising a step of omitting the process.   A computer-executable program comprising steps included in the information processing method according to any one of claims 7 to 12.   A computer-readable recording medium storing the program according to claim 13.

Images