Drawing information management system

• US 4,811,244 A
• Filed: 09/25/1987
• Issued: 03/07/1989
• Est. Priority Date: 09/26/1986
• Status: Expired due to Term

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Miyazaki, Atsuo, Kondoh, Akimitsu, Shimada, Shigeru
• Primary Examiner(s): Paschall, M. H.
• Assistant Examiner(s): SALATA, ANTHONY J
• Application Number:
  US07/101,020
• Time in Patent Office: 529 Days
• Field of Search: 364/521, 364/522, 364/518, 364/488, 364/480, 340/720, 340/723, 340/732, 340/734, 340/721, 340/722, 340/731, 358/104
• US Class Current: 345/443
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

A domain covering a drawing data subjected to information processing is determined and equally divided into meshes of predetermined smallest size. For each of vectors constituting a drawing data subjected to the processing, the number of the meshes traversed by the vector is counted. When the number of the meshes traversed by a given one of the vectors exceeds a predetermined value, the domain is equally divided into meshes of a larger mesh size and the number of the updated meshes traversed by the given one vector is counted. By repeating this operation, all the vectors are stored in a memory as the drawing information in terms of the mesh size and the coordinates of the meshes traversed by vector. Since the number of the meshes traversed by the vector thus can not exceed the predetermined value, the speeding-up of the drawing information processing can be accomplished. A predetermined value may be provided for the mesh size, if desired. When the mesh size for a given vector exceeds this predetermined value, the coordinates of a rectangle circumscribing the given vector may be stored in the memory as the drawing information.

Claims

1. A method of managing drawing information in a drawing information management system including a graphic processor and a storage unit, comprising steps of:

(a) determining a domain which covers a whole drawing data to be subjected to processing;

(b) dividing said domain into a first number of meshes of a same size;

(c) determining the number of the meshes traversed by a vector constituting a part of said drawing data; and

(d) comparing said number of the meshes with a predetermined value, wherein

(i) when said number of the meshes is not greater than a predetermined value, the current mesh size and the positions of the meshes traversed by said vector are stored in said storage unit a drawing information of said vector, and a next vector constituting another part of said drawing data is selected to execute the aforementioned steps (b), (c) and (d), while

(ii) when said number of the meshes exceeds said predetermined value, said domain is divided into a second number of meshes of a same size, which number differs from said first number, being then followed by execution of the aforementioned steps (c) and (d), and

(iii) when the drawing information have been determined for all the vectors constituting said drawing pattern, storage of said drawing information into said storage unit is completed.

2. A drawing information managing method according to claim 1, wherein at the aforementioned step (d) (ii), said domain is equally divided into the meshes of a mesh size greater than the preceding one.

3. A drawing information managing method according to claim 1, wherein at the aforementioned step (b), said domain is equally divided into the meshes of such a size in which the greatest number of vectors of those constituting said drawing data can be included by the individual meshes.

4. A drawing information managing method according to claim 1, wherein at the aforementioned steps (b) and (d) (ii), said domain is equally divided by a factor of 2²ⁿ (where n is given one selected from group consisting of 0, 1, 2, 3, . . . ).

5. A drawing information managing method according to claim 1, wherein at the aforementioned step (d) (i), a table relating the management number of the vector, the mesh size appropriate to said vector and the position of the mesh traversed by said vector to one another is prepared in said storage unit, and said graphic processor manages said drawing data with the aid of said table.

6. A drawing information managing method according to claim 1, wherein at the aforementioned step (d) (ii) where said domain is equally divided into said different number of meshes, when the mesh size resulting from this division exceeds a predetermined size, position data of a rectangle circumscribing said vector is stored in said storage unit as the drawing data of said vector, and a next vector constituting a part of said drawing data is selected to undergo the processing in the aforementioned steps (b), (c) and (d).

7. A method of managing drawing information in a drawing information management system including a graphic processor and a storage unit, comprising steps of:

(a) determining a domain covering a whole drawing data to be subjected to the graphic processing, said drawing data including a closed region;

(b) dividing said domain into a first number of meshes of a same size;

(c) determining the number of those meshes which bear overlap relation to said closed region of said drawing data; and

(d) comparing said number of the meshes with a predetermined value, wherein

(i) when said number of the meshes is not greater than a predetermined value, the mesh size and positions of all the meshes lying in overlap relation with said closed region are stored in said storage unit as the drawing data;

while

(ii) when said number of the meshes exceeds said predetermined value, said domain is equally divided into a number of meshes which number differs from said first number of meshes, being followed by execution of the aforementioned steps (c) and (d).

8. A drawing information managing method according to claim 7, wherein said drawing data is a circumscribed rectangle circumscribing a text/symbol string.

9. A drawing information managing method according to claim 7, wherein at the aforementioned step (d) (ii), said domain is equally divided into the meshes of a mesh size greater than the preceding one.

10. A drawing information managing method according to claim 7, wherein at the aforementioned step (b), said domain is equally divided into the meshes of such a size in which the greatest number of vectors of those constituting said drawing data can be included by the individual meshes.

11. A drawing information managing method according to claim 7, wherein at the aforementioned steps (b) and (d) (ii), said domain is equally divided by a factor of 2²ⁿ (where n is a given one selected from 0, 1, 2, 3, . . . ).

12. A drawing information managing method according to claim 7, wherein at the aforementioned (d) (i), a table relating a management number of said drawing data, the mesh size appropriate to said drawing data and positions of the meshes covered by the closed region of said drawing data to one another is prepared in said storage unit, and said graphic processor manages the drawing data with the aid of said table.

13. A drawing information managing method according to claim 12, wherein the positions of said meshes are arrayed in a predetermined sequence in said table.

14. A system for managing drawing information, comprising:

display means for displaying visually drawing information for graphic processing;

coordinate input means for designating positions on said display means;

storage unit for storing said drawing information; and

a processor coupled to said display means and said storage unit for processing said drawing information;

said processor executing the following steps;

(a) determining a domain which covers a whole drawing data to be subjected to the information processing;

(b) dividing said domain into a first number of meshes of a same size;

(c) determining the number of the meshes traversed by a vector constituting a part of said drawing data; and

(d) comparing said number of the meshes with a predetermined value, wherein

(i) when said number of the meshes is not greater than a predetermined value, the current mesh size and the positions of the meshes traversed by said vector are stored in said storage unit as drawing information of said vector, and a next vector constituting another part of said drawing data is selected to undergo the processing in the aforementioned steps (b), (c) and (d), while

(ii) when said number of the meshes exceeds said predetermined value, said domain is divided into a second number of meshes of a same size, which number differs from said first number, being then followed by execution of said steps (c) and (d), and

(iii) when the drawing information have been determined for all the vector constituting said drawing data, storage of said drawing information into said storage unit is completed.

15. A system for managing schematic information, comprising first memory means for storing schematic information including constituents such as picture, text, symbol or the like;

and second memory means for storing indexes for allowing said constituents to be retrieved at a high speed, said indexes being prepared by deciding ranges appropriate to sizes of said constituents and arrayed hierarchically on the basis of the result of said decision, wherein a plurality of different managements are performed with the aid of said indexes stored in said second storage means, said indexes being classified into two hierarchies of high and low levels, respectively, wherein the indexes of low hierarchical level are prepared by dividing a whole schematic into virtual small areas referred to as meshes, determining the mesh identification numbers of the meshes traversed by said constituent, dividing again said whole schematic in such a sense that the size of the mesh is increased until predetermined conditions for the number of the meshes traversed by one constituent are satisfied to thereby allow the appropriate mesh data including the mesh size and the mesh identification number of the mesh traversed by said constituent to be stored only when said predetermined conditions are satisfied, while said indexes of said high level hierarchy designated the storage of circumscribed rectangular regions corresponding to the individual constituents, respectively.