CN1691018A - Recording medium, program and data structure for representing two- or three-dimensional object - Google Patents

Abstract

The present invention provides a data structure which does recording uniformly to the two-dimension or three-dimension pattern with a same form, a data structure with little data volume and excellent processing efficiency and a program that executes reading-and-writing to the data structure at the state that the computer is used for executing the graphic processing. The data structure is a facility which is used for recording the data of the processed pattern in the computer memory at the state that the computer is used for processing two-dimension or three-dimension graphic, wherein at the state that the point P has the abutting points Q, R, S, ... which are linked with a line, the data of the point includes the following components: (1) the address of the area where the data of the point P is recorded; (2) a pointer of the address which is recorded on the data area of the point P in sequence according to a regulation determined beforehand and points the area where the respective point data of a plurality of abutting points Q, R, S ... abutting to a same point P are recorded.

Description

Make data structure, program and the recording medium of Computer Storage 2 dimensions/3 dimension figures

Technical field

The present invention relates to be used for data structure in memory, program and recording medium that 2 dimensions that will be described by the computing machine of the arithmetic unit that possesses store graphics data and handle to the device of its program of handling with to above-mentioned graph data and 3 dimension figures reproducibly are recorded in computing machine.

Background technology

In recent years, shape as 2 dimensions or 3 dimensional objects carries out graphics process on computers as CAD/CAM, be recorded in the storer or the graph data of playback record in storer carries out various processing after the data structureization with treated this 2 dimension or 3 dimension figures, this is not only with design or produces relevant operation, all occupies very important key element in extensive fields such as the field relevant with the environment identification mechanism of robot, science simulation field, field of Computer Graphics.

And particularly in the field of CAD/CAM, be able to motion and utilization as tieing up the various modes of the methods of graphic recording in the storer of computing machine with treated 3.

In the CAD system in the early stage, most use only gives the data structure of mode of the information of summit and crest line as polyhedral data, but follow the high capacity of the storer of computing machine, can give more information, necessary processing can be more easily and the data structure of carrying out at short notice, on data, hold the application-oriented mode of redundance just adopted and utilized.

What nowadays, adopted the most widely as the basic data structure of CAD system is to being easier to make land used to carry out the data structure that is referred to as " half of data structure: half-edge data structure " after the improvement as " wing limit data structure: winged-edge data structure " by the data structure of B.G.Baumgart institute motion.

Above-mentioned half of data structure is can be corresponding to neatly polyhedral multiple processing data structure operable.

Figure 27 is as the key diagram of prior art " half of data structure ".Polyhedron just becomes expression crest line, such with Figure 27 (a) of the annexation of adjacent summit of crest line and face when watching its crest line from the outside.Among the figure, e is a crest line, the downside summit of crest line e is that pv, upside summit are nv, to appear at upper left crest line be that pccw, the crest line that appears at the lower-left are pcw, to appear at upper right crest line be that ncw, the crest line that appears at the bottom right are nccw, then, with respect to the face of crest line e on a left side be pf, face on the right side is nf.

Like that respectively in connection with two face pf and nf, consider polyhedral crest line e is divided into two by the common crest line e of the face pf in left side with by the common crest line e ' of the face nf on right side by half of data structure shown in Figure 27 (a) for polyhedral crest line e.

Promptly, in data structure according to half of data structure, crest line e for the left side, shown in Figure 27 (b), give direction to the above side direction of crest line e like that, and give crest line pcw, the crest line e ' of the left surface that rotates into the summit nv of the summit pv of starting point and terminal point, with inhour, the crest line pccw and the relevant information of left surface pf of the left surface that rotates away with inhour.Then, though also further additional crest line e ' the relevant information opposite with being identical crest line direction.Crest line e ' about the right side gives 6 kinds of information (with summit pv ', summit nv ', the crest line e of terminal point, crest line pcw ', crest line bccw ', the relevant information of right side pf ' of starting point) too.

Though the redundance of this structured data is higher, but can efficient carry out well the distortion of the formula three-dimensional shape that engages in the dialogue or, shape computing etc. utilized necessary various processing operations under the situation of shaped design of CAD, also help the shortening of needed time of program creation simultaneously, thereby extensively used.

Gu Chuanjin, Xiang Jingshen control work on [non-patent literature] " basis of CAD/CAM system and actual "

22 pages of upright altogether publication on September 25th, 2002 Co., Ltd. distribution

But, even if hold above-mentioned data structure under the situation of the solid figure that is constituted by plane and curved surface, because the plane is different with the processing method of data of curved surface, so obtain the conformability of data in the coupling part of plane and curved surface extremely difficult, needed labour is also big on program creation, in addition, the necessary memory capacity of program self necessary memory capacity increase while data also becomes huge.

In addition, also there is this CAD system, do not look to the plane is connected exactly with curved surface but manages to make it to be connected so exactly just when picture shows showing.

But, because wherein the shape of figure is not is not recorded and narrated exactly, thus for example for numerically controlled machine tool with creating under the situation of tool path or will taking place during operations such as establishment improper significantly in the data that are sent to the lamination styling apparatus.

Relevant with the curved surface in the figure in addition processing method of data is very complicated.Though under situation about as 2 curved surfaces, defining, do not need to handle especially geological information, the field of definition of mathematical expression and variable need be held as data with mathematical expression.

In addition under SPLINE (spline curve), NURBS (Non-Uniform RationalB-Spline s), B-SPLINE situations such as (B-spline curve), generally be to hold method by the coordinate figure at point or reference mark with the form of table.

And then, like that, not to be under the situation about representing that multiplies each other of the individual such number in length and breadth of m * n with point such as 3 dihedral sticking patch (patch) etc., also need to prepare special data structure.

So, just do not have unified method, then be not able to the level of discussing about data volume number and treatment effeciency about the processing of the data of the curved surface that is used for expressing figure.

On the other hand, about the means that in graphics process, the change history when the shape of change figure kept, adopt following way mostly, in dialog mode shape generation operation, want to cancel under the situation of wrong operation or cancel, the history of instruction is kept as different data, when carrying out mandatum cassatorium according to command history from beginning to re-execute the order that has given at first, perhaps carrying out the equal effect of cancellation that inverse operation is obtained and operated under for reversible situation near the order of front.

Consider also that in addition change history with shape is stored in the method in the same data structure, but in the method because many shape datas are stored in the same data structure, so cause the low of treatment effeciency, in the CAD system of reality, utilize less.

Summary of the invention

Will be after the storer of computing machine as the data recording of 2 dimensions of 2 dimensions or the shape of 3 dimensional objects or 3 dimension figures, whenever reading these data and this figure being carried out various processing, just as described above, because of the shape of figure has to complicated and different data structures necessary processing be disposed, workload is also many, and huge unavoidable treatment effeciency is low thereby data volume also becomes.

In addition, except as described above be the data structure of benchmark with the crest line, the data structure that with the face is benchmark also is able to motion, but there is not data structure outstanding on curved surface in present stage, many curved surface intricatelys are made up the solid figure that constitutes or plane and curved surface to be mixed under the situation of such solid figure, so owing to not having can be improper more with the data structure that the relation between plane and curved surface or curved surface is stored uniformly, overcoming of curved surface difficult treatment just becomes big problem.

And then, if means with regard to the deformation history when keeping the shape of figure is out of shape, then geometric data becomes huge in above-mentioned way, just becomes a bigger problem whenever this data volume of figure deformation makes the become problem of non-constant of treatment effeciency with regard to significantly increasing.

Therefore be purpose with the program that provides a kind of data structure and comprise in the present invention to the order of reading and writing by same data structure recorded data, this data structure is used for all graph datas are recorded in storer with same unity of form, and do not need numerous and diverse processing operation amount less, and then it is more outstanding than significantly cut down on treatment effeciency in the past to make data volume.

The present invention will solve above-mentioned problem exactly, provides a kind of being used for that after treatment 2 dimensions and 3 dimension figures on computers reproducibly are recorded in data structure in memory, program and the recording medium of computing machine based on following formation.

Technical scheme 1 of the present invention provides a kind of data with 2 dimensions and 3 dimension figures to be recorded in the data structure in memory of computing machine, be a kind of means that 2 dimensions that will be described by the computing machine of the computing means that possess store graphics data and handle to the device of its program of handling with to above-mentioned graph data and 3 dimension figures reproducibly are recorded in the storer of computing machine that are used for, can be only with making the each point that constitutes this figure as the end points of the line of the geometry shape of expressing this figure, the data structure that maintenance is carried out the expression of this figure for the aggregate of the point data of expressing the figure information necessary, it is characterized in that: to write down above-mentioned each constitute the point data intrinsic address of point data region allocation separately of point, to be made as Q with the abutment points that this formation point P is in the relation that links with line, R, S... the time, the abutment points Q of this P, R, the address date of each point data area S... is recorded in the point data zone of this P in turn according to the rule that is determined in advance.

Technical solution of the present invention 2 provides a kind of data structure, it is characterized in that: in technique scheme 1 described data structure, the address date (below be referred to as P address date) of representing the point data zone of this P be recorded in the each point data area of abutment points Q, R, S... order for which numerical value be recorded in the point data zone of same point P.

Technical solution of the present invention 3 provides a kind of data structure, it is characterized in that: in technique scheme 1 described data structure, the rule that is determined is meant dextrorotation or left-handed in 2 dimension figures in advance, is meant that watching the summit from the outside of figure is dextrorotation or left-handed in 3 dimension figures.

Technical solution of the present invention 4 provides a kind of data structure, it is characterized in that: in technique scheme 1 described data structure, above-mentioned point data maintains attribute information.

Technical solution of the present invention 5 provides a kind of data structure, it is characterized in that: in technique scheme 4 described data structures, the attribute information of above-mentioned point data is the pointer of address that is writing down the zone of coordinate figure from the coordinate figure of this P or sensing, the numerical value that is determined in advance or the character data of the kind of expression point, the numerical value that is determined in advance or the character data of the color of expression point, the numerical value that is determined in advance or the character data of the kind of the processing that expression is relevant with point, the pointer of address in the zone of other graph datas is being write down in sensing, and expression is SPL (Spline Curve), B-SPL (B-spline Curve), Bezier (BezierCurve), nurbs curve (Non-Uniform Rational B-Spline Curve), sectionalization curve (Subdivision Curve), perhaps B-SPL, Bezier, in the free curve beyond the nurbs curve which the numerical value that is determined in advance at reference mark or character data in 1 or 2 above attributes being selected.

Technical solution of the present invention 6 provides a kind of data structure, it is characterized in that: in technique scheme 4 described data structures, the attribute information of above-mentioned point data be be adjacent a little at this point between the relevant attribute information of line drawn.

Technical solution of the present invention 7 provides a kind of data structure, it is characterized in that: in technique scheme 6 described data structures, the above-mentioned attribute information relevant with line is numerical value that is determined in advance or the character data from the kind of expression line, the numerical value that is determined in advance or the character data of the color of expression line, the pointer of the address in the definition data of online situation lower curve for curve or the zone of the definition that curve is being stored in sensing, the pointer of the address in the zone that field of definition is being stored in the field of definition data of coefficient and variable or sensing, and expression is SPL (SplineCurve), B-SPL (B-spline Curve), Bezier (Bezier Curve), nurbs curve (Non-Uniform Rational B-Spline Curve), sectionalization curve (Subdivision Curve), perhaps B-SPL, Bezier, the attribute of being selected in the numerical value that is determined in advance of which kind in the free curve beyond the nurbs curve or the character data more than 1 or 2.

Technical solution of the present invention 8 provides a kind of data structure, it is characterized in that: in technique scheme 1 described data structure, because of constituting moving of 1 of this object figure or a plurality of points, deletion, the establishment of new point, the change of attribute or the change of abutment points and under the situation of being out of shape, moving of this point, deletion, the new point of creating, carried out to represent it is mobile by the time sequence with records of values as historical information in each point data of attribute change or abutment points change, deletion, the new point of creating, the information of point of attribute change or abutment points change and the distortion time numerical value of which time distortion that this distortion of souvenir is this object figure have been carried out.

Technical solution of the present invention 9 provides a kind of data structure, it is characterized in that: in technique scheme 8 described data structures, to establish the distortion number of times be 1 to this historical information and will be out of shape number of times phase Calais in turn and carry out record to each distortion under the situation of having carried out distortion, distortion at figure is under the situation about causing because of the deletion of putting, and additional this distortion of souvenir is the mark that causes because of the deletion of putting on above-mentioned distortion time numerical value.

Technical solution of the present invention 10 provides a kind of data structure, it is characterized in that: in technique scheme 8 described data structures, whenever moving because of the point that constitutes this object figure, deletion, the attribute change, or abutment points change and being out of shape, with before the moving of this P, before the deletion, attribute before changing, or abutment points point data before changing is made as Pi, after will moving, after the deletion, attribute after changing, or abutment points point data after changing is made as under the situation of Pi+1, in the point data of this P, writing down mobile before, before the deletion, attribute before changing, or the point data of abutment points point Pi before changing and move after, after the deletion, attribute after changing, or the point data of abutment points point Pi+1 after changing.

Technical solution of the present invention 11 provides a kind of data structure, it is characterized in that: in technique scheme 8 described data structures, whenever this object figure is out of shape because of the establishment of the new point that constitutes this figure, with the data of this Q as point data Qi create, record.

Technical solution of the present invention 12 provides a kind of program, be when 2 dimensions that will be described by the computing machine of device that possesses store graphics data and program that it is handled and the computing means that above-mentioned graph data is handled and 3 dimension figures reproducibly are recorded in the storer of computing machine, to constitute the program that the point data of this P of this figure writes or reads according to technique scheme 1 described data structure on storer, and it is characterized in that comprising: (1) distribute the zone that the data of this P are recorded the address order and according to utilizing purpose to read the order of this address; (2) according to the rule that is determined in advance will write with the address date of a plurality of abutment points Q, the R of same point P adjacency, S... each point in turn this P the point data zone order and according to the order that utilizes purpose to read from the same area.

Technical solution of the present invention 13 provides a kind of program, it is characterized in that: in technique scheme 12 described programs, with the address date of this P of expression be recorded in the each point data area of abutment points Q, R, S... order for which numerical value write same point P the point data zone order and according to the order that utilizes purpose to read from the same area.

Technical solution of the present invention 14 provides a kind of program, it is characterized in that: in technique scheme 12 described programs, the rule that is determined is meant dextrorotation or left-handed in 2 dimension figures in advance, is meant that watching the summit from the outside of figure is dextrorotation or left-handed in 3 dimension figures.

Technical solution of the present invention 15 provides a kind of program, it is characterized in that: in technique scheme 12 described programs, technique scheme 4 described attribute informations are write the order in above-mentioned point data zone and according to the order that utilizes purpose to read from the same area.

Technical solution of the present invention 16 provides a kind of program, it is characterized in that: in technique scheme 12 described programs, technique scheme 8 described historical informations are write the order in above-mentioned point data zone and according to the order that utilizes purpose to read from the same area.

Technical solution of the present invention 17 provides a kind of program, it is characterized in that: available technique scheme 12 described programs are carried out the graphics process that 2 dimension graphics process, 3 dimension graphics process or 2 peacekeepings, 3 dimension figures mix on computers.

Technical solution of the present invention 18 provides a kind of recording medium that has write down the embodied on computer readable of technique scheme 12 described computer programs.

Technical solution of the present invention 19 provides a kind of recording medium that writes down the embodied on computer readable of utilizing based on data base system behind the graph data of above-mentioned data structure, and wherein said data structure utilizes technique scheme 12 described computer programs to create.

According to the data structure that in the storer of computing machine, writes down 2 dimensions and 3 dimension graph datas of the present invention, because so all graph data is only considerably less with keeping aggregate for the point data of the expression information necessary of figure to constitute data volume separately, by means of the just obviously raising of treatment effeciency of computing machine.

And, so owing to the data of the each point that constitutes above-mentioned this figure will keep just can taking out the annexation of point necessary on the figure or derivation each point and need not carrying out numerous and diverse processing according to purpose as information with the relation of abutment points mutually.

And then, because the data that constitute the each point of this figure can keep the attribute information of this point or straight line of being drawn and curve etc. between this point and abutment points, even if so can construct data structure with same fully unity of form ground in the 3 dimension figures that 2 dimension figures, 3 dimension figure, particularly planes and curved surfaces mix, this graph data just can not have 2 to tie up, 3 tie up and be recorded in the storer distinctively yet.

In addition, because the attribute information that is kept in the above-mentioned point data carries out record as the numerical value or the character data that are determined in advance or the pointer that points to other figures, so even if hypothesis has been recorded and narrated many attributes, the data volume of point data self can not increase so yet, thus all amounts of graph data also can not increase and computing machine on treatment effeciency can not reduce.

And then, because can make the information relevant with the distortion of figure in the point data of the point that constitutes figure stores as the change historical information, each deform of figure time numerical value is stored in and is out of shape in the related point data, so operation is just extremely easy again.

For example under the situation of the behavior that cancellation was carried out just now, exploration gets final product the corresponding information that subtracts after 1 of historical grade, is wanting to turn back under the situation of 5 shapes before the stage, explores the information that historical grade is subtracted after 5 and gets final product.In addition because if watch above-mentioned historical information just can learn easily the distortion of present stage by which inferior distortion is caused, so graph data according to data structure of the present invention, even if the increase of distortion number of times also can get history management without any confusion, can carry out inferior arbitrarily graph data change, that operability is higher that returns or revise and become.

And, because the program that recorded data in the data structure of the present invention is read and write is to abide by graphic documentation that data structure of the present invention will create with computing machine in storer, the perhaps program of reading from storer according to processing intent, just can need not numerous and diverse data storage and create the graph data of the less compactness of data volume so comprise the graphic processor of this program with routine ground, become processing speed fast, can be effectively and easily handle the program of all figures.

In addition, because if abide by data structure of the present invention then 2 dimensions, 3 dimension figures handle with regard to available same data structure, so realize to just become the program in the graphics software world that starts the brand-new uniqueness that did not have based on its 2 dimensions, functional programs that 3 dimension figures are handled in the past.

In addition, the computer-readable recording medium that has write down aforementioned calculation machine program just can extensively easily provide the computer program that above-mentioned data structure is applied flexibly.

And then, apply flexibly, just become general interchangeability and convenience higher data storehouse by anyone basic data that all can easily make full use of, can be used as under the figure situation of drawing complexity of database that said procedure is created.

Description of drawings

Fig. 1 is the 2 dimension figures that are used to illustrate data structure of the present invention.

Fig. 2 is the 3 dimension figures that are used to illustrate data structure of the present invention.

Fig. 3 is the basic comprising key diagram that data structure according to the present invention is expressed the point data of 2 dimension figures.

Fig. 4 is the basic comprising key diagram that data structure according to the present invention is expressed the point data of 3 dimension figures.

Fig. 5 is the additional function key diagram that data structure according to the present invention is expressed the point data of 2 dimension figures.

Fig. 6 is the additional function key diagram that data structure according to the present invention is expressed the point data of 3 dimension figures.

Fig. 7 is the relevant key diagram of attribute information that keeps with each point data in data structure of the present invention.

Fig. 8 is other the relevant key diagram of attribute information that keeps with each point data in data structure of the present invention.

Fig. 9 is the figure that expression is used for the change process that just the present invention's change history describes.

Figure 10 is the key diagram of the data structure of the present invention in the historical grade 1 of figure of the above-mentioned change process of expression.

Figure 11 is the key diagram of the data structure of the present invention in the historical grade 2 of figure of the above-mentioned change process of expression.

Figure 12 is the key diagram of the data structure of the present invention in the historical grade 3 of figure of the above-mentioned change process of expression.

Figure 13 is according to the process flow diagram of data structure of the present invention with the program of the point data write store of figure.

Figure 14 is according to the process flow diagram of data structure of the present invention with the program of the point data deletion of figure.

Figure 15 is the process flow diagram of program that the point of figure is made as the abutment points of other points according to data structure of the present invention.

Figure 16 is according to the process flow diagram of data structure of the present invention with the program of the abutment points information deletion of the point of figure.

Figure 17 is the process flow diagram of the program of the point data of the figure that write down in the storer being taken out abutment points to turn clockwise according to data structure of the present invention.

Figure 18 takes out the process flow diagram of the program of abutment points to the point data of the figure that write down in the storer with the inhour rotation according to data structure of the present invention.

Figure 19 is the process flow diagram that generates the program of new point according to data structure of the present invention between the point of figure is adjacent a little.

Figure 20 is the process flow diagram of the program of the formation point of the face of the figure that write down in the storer being taken out with the inhour rotation according to data structure of the present invention.

Figure 21 is the process flow diagram of the program of the formation point of the face of the figure that write down in the storer being taken out to turn clockwise according to data structure of the present invention.

Figure 22 is that the embodiment of expression data structure of the present invention illustrates the figure with 2 dimension figures.

Figure 23 is that to be illustrated among above-mentioned Figure 22 with a V0 be the figure of point data table of the some V0 of example.

Figure 24 is the figure of expression to 2 data structures of the present invention expressed of dimension figures of above-mentioned Figure 22.

Figure 25 is illustrated in 2 of above-mentioned Figure 22 to tie up the figure that keeps the data structure of the present invention of elevation information in the figures.

Figure 26 is that the embodiment of expression data structure of the present invention illustrates the figure with 3 dimension figures.

Figure 27 is the figure of expression to 3 data structures of the present invention expressed of dimension figures of above-mentioned Figure 26.

Figure 28 is the figure of non-manifold that is used to illustrate the embodiment of data structure of the present invention.

Figure 29 is the figure of expression at the data structure of the present invention of the non-manifold of above-mentioned Figure 28.

Figure 30 is that expression the present invention illustrates figure usefulness, cancellate point range.

Figure 31 is the explanation point data figure that is used for taking out from each point data of data structure of the present invention in cancellate point range 1 point range.

Figure 32 is that expression data structure according to the present invention is from the figure of 2 dimension figures to the example of 3 dimension graph expansions.

To be expression generate the key diagram of method of the curved surface of the figure that the plane curved surface mixes by the sectionalization method to Figure 33.

Figure 34 is the figure that 3 of barrel surface is tieed up figures that has that expression is used to illustrate embodiments of the invention.

Figure 35 be illustrated in 3 dimensions with barrel surface be in the figures plane and curved surface borderline formation point, according to the figure of the example of point data of the present invention.

Figure 36 is the key diagram as the half of data structure of prior art.

Figure 37 is expression with the explanation of the operating process of the graph data that data structure of the present invention write down with 3 figure that tie up figure A.

Figure 38 is the figure of the flow process of respectively operating grade of the above-mentioned 3 dimension figure A of expression.

Figure 39 is the historical chart with memory space of the change in the establishment of the above-mentioned 3 dimension figure A of expression.

Figure 40 is illustrated in the graph data that writes down with data structure of the present invention, is used to check the figure of 3 dimension figure B of the relation that changes historical and use amount of memory.

Figure 41 is the historical chart with amount of memory of the change of constructive process 100 times of the above-mentioned 3 dimension figure B of expression.

Figure 42 is the half of data structure of prior art and the comparison sheet of data structure of the present invention.

Embodiment

The present invention is, be used to make handled on computers all graphics memory in data structure in memory, comprise in accordance with above-mentioned data structure and the storer of computing machine is write or according to the program of utilizing purpose with all or part of order of reading of these data recording medium graph data, that available computers reads that has write down said procedure or created by this program.

The figure that the present invention is made as object be the figure that constitutes as the connection of straight line or curve on computers, only by figure that the plane constituted, by figure that plane and curved surface constituted, only by all 2 dimensions such as figure, 3 dimension figures that curved surface constituted, and the shape of keeping aloof from patterned things of desire or object is how.

And data structure of the present invention is applied flexibly in all spectra of handling geometric configuration.For example can be used in the following data structure, promptly, machinery is Data Structures in the CAD/CAM system, data structure in the CAD system for building, utilize the three-dimensional shape data to carry out the data structure of relevant conversion to the STL data when the lamination moulding, the data structure of the shape in the environment identification mechanism of robot in the computing machine of relevant suitable robot brains, in Database Systems to be shaped as basic data structure when analogous shape is retrieved, data structure during the tectonic analysis of atom or molecule etc., the drafting of CG or processing vector figure is a data structure of software, the data structure of the graph data in auto navigation or the cartographic information etc., the data structure of the cartoon system in entertainment industries such as recreation or the education industry, surgical navigational by means of virtual reality (VR), the data structure of medical applications systems such as surgical simulation, flight simulator, astronomical universe analog machine, the data structure that the image conversion of scientific theory is used is at the household electrical appliances safety equipment, other have data structure under the situation of process graphical data in the equipment of menu display function healthy equipment.

Illustrate according to data structure of the present invention based on accompanying drawing.

The example of the 2 dimension figures that Fig. 1 represents to illustrate is of the present invention, will use in data structure in memory with the dimension of 2 after Computer Processing graphic recording, Fig. 2 represents the example of 3 dimension figures.Fig. 3～6th, the formation key diagram of the data structure with above-mentioned graphic recording in storer the time.

Among the figure, figure A is 2 dimension figures, and figure B is 3 dimension figures, and some P, Q, R, S are respectively the points that constitutes the figure that is made as object.

According to data structure of the present invention, the each point that constitutes the object figure is respectively as keeping the point data for expressing the figure information necessary to carry out record.

The key diagram of data structure shown in Figure 3 is that the some P that constitutes 2 dimensional object figure A has the example under the situation of a plurality of abutment points Q, R, and the key diagram B of data structure shown in Figure 4 is that the some P that constitutes 3 dimensional object figures has the example under the situation of a plurality of abutment points Q, R, S.

In the data structure of the present invention that is used for figure A is recorded storer, a P, Q, R are distributed the address (being referred to as the address of P, Q, R later on) of the each point data area that the data of this P, Q, R are recorded, on the point data zone of P, write down in turn and a plurality of abutment points Q of same point P adjacency, the address date of R each point according to the rule that is determined in advance.

The address P1 of (1) this P in the point data of the some P of figure A, (2) be recorded in turn according to the rule that is determined in advance this P the data area, with a plurality of abutment points Q, the R address date separately of same point P adjacency be Q1, R1.

Same in the point data of Q the address of (1) this Q be Q1, (2) be recorded in turn according to the rule that is determined in advance this Q the data area, with a plurality of abutment points R, the P address date separately of same point Q adjacency be R1, P1.

Same in addition in the point data of R the address of (1) this R be R1, (2) be recorded in turn according to the rule that is determined in advance in the data area of this R, with a plurality of abutment points P, the Q address date separately of same point R adjacency be P1, Q1.

The rule of the order of conduct record abutment points is that " rule that is determined in advance " is the inhour rotation in the drawings in addition, records and narrates though be made as counter-clockwise rotation in the following description, also can be made as to turn clockwise.

In the data structure of the present invention that is used for figure B is recorded storer, a P, Q, R, S are distributed the address (address that is called P, Q, R, S later on) of the each point data area that the data of this P, Q, R, S are recorded, on the point data zone of P, write down in turn and a plurality of abutment points Q, the R of same point P adjacency, the address date of S each point according to the rule that is determined in advance.

The address of (1) this P is P1 in the point data of the some P of figure B, (2) be recorded in turn according to the rule that is determined in advance this P the data area, with a plurality of abutment points Q, R, the S address date separately of same point P adjacency be Q1, R1, S1.

Same in the point data of Q the address of (1) this Q be Q1, (2) be recorded in turn according to the rule that is determined in advance this Q the data area, with a plurality of abutment points R, P, the S address date separately of same point Q adjacency be R1, P1, S1.

Same in addition in the point data of R the address of (1) this R be R1, (2) be recorded in turn according to the rule that is determined in advance this R the data area, with a plurality of abutment points S, P, the Q address date separately of same point R adjacency be S1, P1, Q1.

And then same in the point data of S the address of (1) this S be S1, (2) be recorded in turn according to the rule that is determined in advance this S the data area, with a plurality of abutment points P, R, the Q address date separately of same point S adjacency be P1, R1, Q1.

Data structure shown in Figure 5 order among the address date that appends this P of expression on Fig. 3 of the data structure of the above-mentioned figure A of expression is recorded in each point data of abutment points Q, R for which individual numerical value (being referred to as to dispose numerical value later on) constitutes.

The order that the same address date that appends this Q of expression on the data of Q is recorded in each point data of abutment points R, P for which individual numerical value constitutes.

And then the order that the address date that appends this R of expression on the data of R is recorded in each point data of abutment points P, Q for which individual numerical value constitutes.

Among the figure in the point data of a P, the address date of representing this P be recorded among each point data of abutment points Q, R order for which numerical value, be 2 to be 1 in abutment points R in abutment points Q.

Same in the point data of Q, the address date of representing this Q be recorded among each point data of abutment points R, P order for which numerical value, be 2 to be 1 in abutment points P in abutment points R.

Same in addition in the point data of R, the address date of representing this R be recorded among each point data of abutment points P, Q order for which numerical value, be 2 to be 1 in abutment points Q in abutment points P.

Data structure shown in Figure 6 order among the address date that appends this P of expression on Fig. 4 of the data structure of the above-mentioned figure B of expression is recorded in abutment points Q, R, each point data of S for which individual numerical value (configuration numerical value) constitutes.

Promptly which individual numerical value is the order among the address date that appends this P of expression on the data of above-mentioned P is recorded in abutment points Q, R, each point data of S be.

Which individual numerical value is the order that the same address date that appends this Q of expression on the data of Q is recorded in abutment points R, P, each point data of S be.

On the data of R, append in addition the expression this R address date be recorded in abutment points S, P, each point data of Q order for which numerical value.

And then which individual numerical value is the order that the address date that appends this S of expression on the data of S is recorded in abutment points P, R, each point data of Q be.

In the point data of a P, representing that the address date of this P is which individual numerical value is 2 by the order of the regular record that is determined among abutment points Q, R, each point data of S in abutment points Q among the figure, is 2 in abutment points R, is 1 in abutment points S.

Same in the point data of Q, represent that the address date of this Q is which individual numerical value is 3 by the order of the regular record that is determined among abutment points R, P, each point data of S in abutment points R, be 1 in abutment points P, be 3 in abutment points S.

Same in addition in the point data of R, represent that the address date of this R is which individual numerical value is 2 by the order of the regular record that is determined among abutment points S, P, each point data of Q in abutment points S, be 2 in abutment points P, be 1 in abutment points Q.

And then in the point data of S, represent that the address date of this S is which individual numerical value is 3 by the order of the regular record that is determined among abutment points P, R, each point data of Q in abutment points P, and be 1 in abutment points R, be 3 in abutment points Q.

Fig. 7, Fig. 8 are the pie graphs that is illustrated in the example under the situation of record attribute information in the above-mentioned data structure of the present invention.

In the attribute information of the data that are contained in the some P that constitutes figure, have regulation point character or with the relation of other figures with put self relevant attribute information pa1, pa2..., about and abutment points between attribute information pb1, the pb2... of the line drawn.

For a Q, R, S have too with point self and and abutment points between relevant attribute information qa1...qb1..., ra1...rb1..., the sa1...sb1... of the line drawn.

As above-mentioned and self relevant attribute information of point, the pointer that the address in the coordinate figure of this P or the zone that coordinate figure is being write down in sensing is arranged, the numerical value that is determined in advance or the character data of the kind of expression point, the numerical value that is determined in advance or the character data of the color of expression point, the numerical value that is determined in advance or the character data of the kind of the processing that expression is relevant with point, the pointer of address in the zone of other graph datas is being write down in sensing, and expression is SPL (SplineCurve), B-SPL (B-spline Curve), Bezier (Bezier Curve), nurbs curve (Non-Uniform Rational B-Spline Curve), sectionalization curve (Subdivision Curve), perhaps B-SPL, Bezier, the numerical value that is determined in advance at the some reference mark in the free curve beyond the nurbs curve or character data etc., the information more than 1 or 2 of these attributes is put down in writing as the data of this P as scheming.

The above-mentioned attribute information relevant with line, numerical value that is determined in advance or character data that the kind of expression line is arranged, the numerical value that is determined in advance or the character data of the color of expression line, the pointer of the address in the definition data of online situation lower curve for curve or the zone of the definition that curve is being stored in sensing, the pointer of the address in the zone that field of definition is being stored in the field of definition data of coefficient and variable or sensing, and expression is SPL (Spline Curve), B-SPL (B-spline Curve), Bezier (Bezier Curve), nurbs curve (Non-Uniform Rational B-Spline Curve), sectionalization curve (SubdivisionCurve), perhaps B-SPL, Bezier, the numerical value that is determined in advance or the character data of the some kinds in the free curve beyond the nurbs curve, these information more than 1 or 2 are put down in writing as the attribute information of line.

The above-mentioned attribute information relevant that is recorded in point data with line on actual transaction preferably the kind according to attribute be predetermined numerical value.

Below expression representational, relevant put and abutment points between the example of attribute information of the line drawn.Certainly the attribute information number that is distributed can at random be selected by program.

Attribute information number contents processing

The straight line on 10 regulation planes

2100 is bezier surface at the border of plane and curved surface top-surface camber

2200 is the B batten at the border of plane and curved surface top-surface camber

2310 is sectionalization curved surface (S curved surface) at the border of plane and curved surface top-surface camber

2320 is the sectionalization curved surface at the border of plane and curved surface top-surface camber

(Catmull-Clark curved surface: カ Star ト マ Le Network ラ one Network curved surface)

2400 is the spline interpolation curved surface at the border of plane and curved surface top-surface camber

2500 is that NURBS, weight determine separately at the border of plane and curved surface top-surface camber

2600 is that 2 curved surfaces, conditions determine separately at the border of plane and curved surface top-surface camber

The reference mark of 3110 curved surfaces (is 4 dihedral sticking patch at bezier surface)

The reference mark of 3120 curved surfaces (is 3 dihedral sticking patch at bezier surface)

The reference mark of 3130 curved surfaces (is 5 dihedral sticking patch at bezier surface)

The reference mark of 3210 curved surfaces (is 4 dihedral sticking patch at B-spline surface)

…

In data structure of the present invention, will be used to distinguish the point that constitutes figure and be point on the plane, still the reference mark of curved surface or plane and the borderline point of curved surface information as and put self relevant attribute and carry out record.Make each attribute corresponding to the numerical value that is determined in advance.

For example making decision in the situation of numerical value 1 is the point on the plane, and making decision in 2 situation is the reference mark of curved surface, and making decision in 3 situation is borderline point.

And then at length determine at needs under the situation of attribute, the kind increase of the numerical value that is distributed is got final product.For example establish numerical value 14 and be the reference mark on the bezier surface, 15 is the reference mark of nurbs surface, and 20 is 2 points on the curved surface or the like.

But, under situation about as 2 curved surfaces etc., expressing, then write down information such as the coefficient of formula or interval of definition separately with mathematical expression, perhaps also will point to the pointer of storer of the information of the coefficient that writing down formula or interval of definition and also note.

In addition in Fig. 7, Fig. 8 for example in the tables of data of a P on the hurdle of the horizontal pb1 of the address date of abutment points Q, writing down under the situation of attribute information 10, if the line of point of contact P and abutment points Q is a straight line, the point that 2 P, Q are on the plane is handled, and divides at these 2 in the situation that is writing down 15 in addition and is linking with circular arc and to handle.The numerical value 10,15 that writes in this table suitably distributes after the decision in advance.

Disposal route is different because of these numerical value of putting down in writing.For example if come representation attribute with 16, then can carry out the processing of 65,536 kinds of different attributes in addition.

Owing to give attribute information with the numerical value or the character string that are determined in advance like this, good this numerical value of record or character string get final product on each point data, so data structure of the present invention can with regard to the characteristic of being had a few or and abutment points between the line drawn carry out detailed expression, and the data volume of point data self is increased so.

In addition because no matter data structure of the present invention is 2 dimension figures or all available fully same form of 3 dimension figures handles, so also can make the processing of the model that the plane curved surface mixes become easy.

In data structure according to the present invention, the distortion of figure because of the moving of the point that constitutes the object figure, delete, append, under the situation that the change of the change of attribute or abutment points takes place, this change can be carried out recorded and stored as changing historical information in each point data.

Under the situation of being out of shape, in each point data that the moving of this point, deletion, the new point of creating, attribute change or abutment points change have been carried out, to represent it is the information of the point that carried out of point, attribute change or the abutment points change moving, delete, newly create and the inferior numerical value of distortion of which time distortion that this distortion of souvenir is this object figure by the time sequence with records of values as historical information because of the change of the change of the establishment that constitutes the moving of 1 of this object figure or a plurality of points, deletion, new point, attribute or abutment points.

To establish the distortion number of times be 1 to this historical information and will be out of shape number of times phase Calais in turn and carry out record to each distortion under the situation of having carried out distortion, distortion at figure is under the situation about causing because of the deletion of putting, and additional this distortion of souvenir is the mark that causes because of the deletion of putting on above-mentioned distortion time numerical value.

Data structure of the present invention like this is exactly to write down the structure of the information relevant with the change of figure certainly on one's body in the data of each point, even if the processing operation in finishing computing machine and preserve graph data hereof after, read in once more with under the situation of carrying out processing operation, owing in the history as graph data in the past, do not depend on the part of instruction, so the data in any stage of past change can both freely be taken out according to historical information, go far towards efficiency of operationization.

In order to keep the information relevant, in data structure of the present invention, just on the data of each point, keeping information before changing like this with the distortion of object figure.

For example, whenever moving because of the point that constitutes this object figure, deletion, the attribute change, or abutment points change and being out of shape, with before the moving of this P, before the deletion, attribute before changing, or abutment points point data before changing is made as Pi, after will moving, after the deletion, attribute after changing, or abutment points point data after changing is made as under the situation of Pi+1, in the point data of this P, writing down mobile before, before the deletion, attribute before changing or the point data of abutment points point Pi before changing and move after, after the deletion, attribute after changing, or the point data of abutment points point Pi+1 after changing.

And whenever being out of shape because of the establishment of the new point that constitutes this figure at this object figure, the data of this Q just are used as point data Qi and create.Even if data structure of the present invention like this is exactly under situation about changing because of the distortion of figure, storing information before changing and need not to carry out the reference etc. of other information, and the increase of total amount of data is being suppressed to minimal ruly data structure.

Fig. 9～12nd is with the historical relevant key diagram of the change in the data structure of the present invention.

Fig. 9 (a) is the figure (former figure) as the historical grade 1 of the 1st distortion, and Fig. 9 (b) is the figure as the historical grade 2 of the 2nd distortion, and Fig. 9 (c) is the figure as the historical grade 3 of the 3rd distortion.

10 is figures in the historical grade 1 in Fig. 9, the 20th, the figure in the historical grade 2, the 30th, the figure in the historical grade 3,10a, 10b, 20a, 20b, 30a, 30b are point data in Figure 10～12,10c, 20c, 30c are distortion time numerical value, the 40th, and the change record data.

At first constitute by the point data of 4 some P, Q, R, S as shown in figure 10 according to the figure 10 in the historical grade 1 of the 1st distortion.Data as 4 some P, Q, R, S write down point data P1, Q1, R1, the S1 of new establishment respectively in the case.Promptly, in a P, Q, R, S point data 10a separately, write down P1, Q1, each the point data 10b of R1, S1 that is created.

In the point data 10b of the above-mentioned some P1 that creates, Q1, R1, S1, write down the distortion time numerical value 10c that is deformed into which time distortion of presentation graphic then.Here owing to be so that " 1 " is being write down in the 1st distortion respectively.

In addition in the drawings, in the point data 10b of the some P1 that is created, Q1, R1, S1, be changed to NULL and represent that a P1, Q1, R1, S1 create as the initial data of a P, Q, R, S, will before it, not have the distortion such situation relevant to get up as information stores with this point.

Secondly the figure 20 shown in Fig. 9 (b) is newly to append to have created some T between the some P of the figure 10 of Fig. 9 (a) and Q, by its above-mentioned figure that causes to be deformed into the 2nd historical grade be 2.The new in the case point of creating is T, is a P and Q because of the establishment of a T produces what change on the content of point data.

The new some T1 that creates of data as a T in Figure 11 is recorded, and writes down the point data 20b of the some T1 that is created in the data 20a of same point T.The distortion of record presentation graphic is the distortion time numerical value 20c of which time distortion in point data 20b that created, above-mentioned T1 then.So here " 2 " are being write down in the 2nd distortion.

Put the point data of P and Q in addition, the relation of abutment points is changed because of a T is created.Therefore in the point data 20a of a P and Q record as the point data 10b of P1, the Q1 of before changing point with as P2, the point data 20b of Q2 of after changing point, and the inferior numerical value 20c of change that creates by the 2nd distortion of record expression.Here distortion time numerical value is " 2 ".

Like this in the point data 20a of a P and Q, though create new some P2, Q2 because of the change of the relation of abutment points is new, because of point move or the situation of the distortion that the change of attribute causes under like this too.

Then shown in Fig. 9 (c), according to the figure 30 in the historical grade 3 of the 3rd distortion, the some S of the figure 20 of deletion Fig. 9 (b) constitutes with putting the some R that is disposed between the Q.The point of being deleted in the case is R, and that change is arranged because of the deletion of a R in point data is a Q and some S.Whenever a R is deleted, the data of some R2 just are created, as shown in Figure 12 the point data 10b of the some R1 of record before deleted and the point data 30b of the some R2 after the deletion in the point data 30a of same point R.

This deletion of record expression is to be out of shape the distortion time numerical value 30c that carries out as which time of figure in the point data 30b of deleted some R2 then.So here owing to be the 3rd distortion record " 3 ", because this distortion is the distortion of having carried out deletion, so here additional representation is the mark "-" of the distortion that causes because of deletion.

The point data 20b of point data 10b, Q2 of record point Q1 before changing and the point data 30b of some Q3 after changing in the point data 30a of a Q in addition, the point data 10b of record point S1 before changing and the point data 30b of some S2 after changing in the point data 30a of a S represent that the distortion time numerical value 30c that creates because of 3 distortion is recorded together then.Time numerical value of the distortion here is " 3 ".

According to graph data that data structure of the present invention write down whenever being out of shape because of the moving of point, deletion, newly-generated, the change of attribute or the change of abutment points, the distortion number of times is made as 1 to be kept after will being out of shape the number of times addition record in turn on the change record data 40 of this object figure, and can manage changing history shown in Figure 10～12 like that.Even and if the time point arbitrarily that also can turn back to the change process under the situation before returning distortion before arbitrary number of level by the numerical value of specifying the distortion record data is edited.

Above-mentioned change record data 40 notify the figure of each point data present stage to be in which of change process under the situation of having carried out return in stage.

For example, then in change record data 40, write down 30 if establishing distortion has been carried out 30 times.And under the situation of the return of the change process before having carried out skipping for 5 stages, change record data 40 write down 25 afterwards.

That is, the numerical value that is write down in above-mentioned change record data 40 is the figure of present stage, and each point data is expressed figure with the up-to-date information of distortion number of times below 25.That is, each point data with the numerical value of change record data 40 discern according to 26,27,28,29,30 times the distortion information be not the information relevant with the figure of present stage.

As described above, the good information relevant of record on the data of being had a few that constitute figure with the distortion of figure, and record changes time numerical value on the data of each point, and then to the good change record data 40 of object graphic recording, thus for example under the situation of the behavior that cancellation was carried out just now, exploration gets final product the corresponding information that subtracts after 1 of historical grade, in addition because the change which time writing down current figure in just editing in change record data 40 be, so even if the present invention just provides the increase of a kind of distortion number of times also not have the staggered of point data, which history management can be got without any confusion, no matter be the higher graph data of operability that repeatedly time can both freely return to stage.

The program of accepting the input and output of data structure of the present invention can write recording mediums such as CD-ROM, semiconductor or IC and realize.

This program by each stage write stories such as newly-built, the deletion of each point data of figure, changes to become above-mentioned data structure, or read according to the distinctive rule of notebook data structure according to purpose, the application program that comprises this program is the epoch-making program that can handle simply the planes of 2 dimensions, 3 dimensions and figure that curved surface mixes.

Figure 13 represents the process flow diagram of data structure according to the present invention with the program of the point data of the some P of figure and attribute information write store.

Figure 14 represents data structure according to the present invention, with the point data deletion of the some P of figure, from the process flow diagram of the program of the abutment points Pi deletion information relevant with putting P.

Figure 15 represents data structure according to the present invention, with the some P of figure _ABe made as a P _BAbutment points, will put P _BBe made as a P _AThe process flow diagram of program of abutment points.

Figure 16 represents data structure according to the present invention, from the some P of figure _APoint data deletion abutment points P _BInformation, from a P _BPoint data deletion abutment points P _AThe process flow diagram of program of information.

Figure 17 represents data structure according to the present invention, from the some P of figure _ATo a P _B, the process flow diagram of the program of taking out abutment points to turn clockwise.Wherein, the K among the figure is a positive integer, takes out during K=1 near right adjacent point, takes out next right adjacent some during K=2.

Figure 18 represents data structure according to the present invention, from the some P of figure _ATo a P _B, take out the process flow diagram of the program of abutment points with the inhour rotation.Wherein, the K among the figure is a positive integer, takes out during K=1 near the adjacent point in a left side, takes out the adjacent point in next left side during K=2.

Figure 19 represents data structure according to the present invention, at the some P of figure _AWith abutment points P _BBetween generate new some P _CPoint data, and write a P _A, P _B, P _CThe process flow diagram of program of adjacency information.

Figure 20 represents data structure according to the present invention, with the some P that constitutes from figure _ATo a P _BThe point of the face in the left side of line rotates the process flow diagram of the program of taking out with inhour.

Figure 21 represents data structure according to the present invention, with the some P that constitutes from figure _ATo a P _BThe point of face on right side of line with the process flow diagram of the program of taking out that turns clockwise.

[embodiment 1]

Elaborate embodiment below according to data structure of the present invention.

Figure 22 is expression according to the explanation of the embodiment of data structure of the present invention with 2 figure that tie up figures.1 is 2 dimension figures among the figure, and some V0, V1, V2, V3, V4, V5, V6, V7, V8, V9, V10, V11, V12, V13, V14 are the points that constitutes 2 dimension figures 1.

Being used for this graphic recording in data structure in memory, is the set that constitutes a plurality of point data of this figure, and each point data is keeping the expression information necessary of figure respectively.

In Figure 22, at first because the abutment points of V0 be with V0 with some V1, V3, V6, V7 that line was linking, so in the point data of a V0, make the left-handed order of abutment points write down address date V1, V3, V6, the V7 of each point in turn by a V1, V3, V6, V7.Each abutment points V1, V3, V6, V7 also carry out record with same form in addition, and among each abutment points, which numerical value that writes down of address date of expression point V0 is recorded in the point data of V0.Though (Counter Clockwise: counter clockwise rotation) Gui Ze order is carried out record, also can be according to dextrorotation (Clockwise: clockwise revolution) rule by left-handed to establish abutment points here.

Figure 23 represents the some V0 of above-mentioned figure has been write down the tables of data of point data.2 is addresses of V0 among the figure, the 3rd, and the address date of abutment points, the 4th, the address date of tables of data mid point V0 that is illustrated in each abutment points is by the numerical value of which record, and the 5th, the order of address of record abutment points.Abutment points is carried out record according to the rule ordering that is determined in advance in addition, and narration is according to said left-handed rule in front, and the address date 3 of abutment points carries out record by left-handed with the order shown in 5 here.

Figure 24 shows the point data of being had a few about above-mentioned figure with complete list.

Method from the data structure extraction of Figure 24 regional A shown in Figure 22 describes with that.Zone A is surrounded via the line that V3, V5, V9, V6 turn back to V0 by starting point with the V0 that sets up an office.

At first in Figure 24, in the point data table of a V0, the address date V3 of some V3 is the 2nd, and the address date that is illustrated in the tables of data mid point V0 of above-mentioned V3 is 3 by which numerical value that writes down (below be referred to as to dispose numerical value).

Just be 2 then, so the 2nd quilt of the tables of data of some V3 derived owing to the configuration numerical value 3 from above-mentioned V3 deducts 1.If watch the 2nd the address date V5 that a V5 is just arranged as can be known of the tables of data of a V3, the configuration numerical value of V5 is 1.

Configuration numerical value 1 from above-mentioned V5 deducts 1 then.Owing to deduct 1 with regard to being 0 and the point data table, do not have 0 place, so the last numerical value of the point data table of reference point V5 from configuration numerical value 1.Writing down the address date V9 that puts V9 so just have, configuration numerical value is 1.

So same just is the last numerical value of the tables of data of 0 reference point V9 owing to the configuration numerical value 1 from V9 deducts 1.So the address date V6 of V6 is just arranged, configuration numerical value is 2.

Same because to deduct 1 from configuration numerical value 2 just is 1, so the 1st of the point data table of reference point V6.So the address date V0 of V0 is just derived.

That is, around 1 week, regional A is extracted out along regional A.

Deduct 1 operation from configuration numerical value in the narration in the above and mean the zone and explore, if carrying out on configuration numerical value, adding that 1 operation gets final product under the situation about exploring with dextrorotation with left-handed.

In addition below, the action of using mark E will be transferred to the address of the some Vm that is write among j of abutment points table of a Vi is written as

Vm＝E[Vi(j)]。

Here Vi (j) is the address date of the some Vn that write among the j of point data table of a Vi, and E represents that actual transfer arrives the action of Vm.If use this mark E, if the number of the configuration numeric field of the some Vm that is write among the j of Pj for the point data table of some Vi, the number of abutment points of Vi of setting up an office is K, establishes XmodK and is the remainder after X is divided by with K, then puts the operation that the inhour of Vi, Vm shifts and just is represented as

Vn＝E[Vm(((Pj-1+K-1)modK)+1)]。

In project described later decision for " when add 1 or when subtracting 1 on the numerical value in configuration; on the configuration numerical value of reference point data table, do not add 1 or subtract under the situation of the numerical value after 1; for example; configuration numerical value be 3 must carry out the 4th of comparable data table by add-one operation with reference to but in this tables of data, do not have just to make it to turn back to the 1st under the 4th the situation; at configuration numerical value is 1 to be just with reference to last numerical value under 0 the situation by subtracting that 1 computing makes with reference to numerical value ", but in above-mentioned formula, can it not considered yet.

In aforesaid Figure 22, because regional A is by 5 angular domain that V0, V3, V5, V9, V6 constituted, so the area of regional A just can easily be found the solution as following.

At first, collocation point O in position calculates the area of △ OV0V3.This moment come from an O watching focus from V0 to the direction of a V3 this area is made as during for the inhour rotation+, when turning clockwise, be made as-.

The same area that calculates △ OV3V5, △ OV5V9, △ OV9V6, △ OV6V0 is if make it all carry out the area that regional A is then tried to achieve in addition.As long as even if link under the situation that line between the abutment points is a curve can zoning OV0V3, OV3V5, the area of OV5V9, OV9V6, OV6V0, the just area of zoning A fully similarly.In addition, even if become complicated and be difficult to try to achieve under the such situation of area accurately in its calculating of above-mentioned curve, the area calculating that just can be similar to according to above-mentioned way.

Figure 25 in above-mentioned graph data as attribute record elevation information.Be presented at the bottom of each point data as the elevation information of the attribute of each point.

Find the solution level line in order to following method approx from point data table shown in Figure 25 here.For example in the local time of wanting to seek height 100m, be that 0 point is adjacent height a little than height.That is, under the difference of height 0 and the height of abutment points is situation more than the 100m, the point of 100m is just arranged therebetween.So because the height that some V0 and V3 are respectively 0m and 500m is made as the highly point of 100m with 1/5th some P100 just linking with straight line under this situation of two 2 from the some V0 of the line of point of contact V0 and V3.

Carry out same calculating, the some Q100 between a V0 and the V6 is made as the height of 100m.And then, then can obtain the point range of height 100m if a V1, V2...V7 are carried out same calculating.By these points being linked up the approximate level line that just can mark height 100m.Highly all changing point-blank, and the line that links abutment points is just to obtain level line accurately under the situation of straight line.

If obtain level line like this then can also show the crest line on mountain or valley line etc., can also predict in addition when rainfall, where will become the most rapid etc.By making up with weather map, just automatically obtain in local heavy rain where dangerous, or the information that where waits and so on of safe part.

Be under the situation of road at the line that links abutment points in addition,, the volume of traffic on this aspect stored as attribute, then also can easily obtain transport information if each point is made as the point of crossing.Total prolongation distance or other variety of information relevant with road of road also can obtain.

By making up the data of above-mentioned figure, and then make up other graph data, just can try to achieve necessary various information with regard to our life with detailed map.

Data structure of the present invention like this so its purposes amplitude is wide, is the data structure of applied range owing to can make the point separately that constitutes figure hold necessary many attributes from various angles.And because figure be the formation of point data only, each point data itself also is to constitute with simple numerical value or pointer etc., so computer processing speed is also fast less for data volume.

[embodiment 2]

Then elaborate the embodiment in the 3 dimension figures of the present invention.

Figure 26 represents 3 dimension figures, and some V0, V1, V2, V3, V4, V5, V6, V7 are the points that constitutes this figure 7.

In data structure of the present invention, the premises is carried out record as the point data that is keeping respectively expressing the figure information necessary.

In the figure 7 of Figure 26, at first because the abutment points of V0 is some V1, V3, the V4 that is linking with straight line with V0, so in the point data of a V0, make the left-handed order of abutment points write down address date V1, V3, the V4 of each point in turn by a V1, V3, V4.Each abutment points V1, V3, V4 also carry out record with same form in addition, and among each abutment points, which numerical value that writes down of address date of expression point V0 is recorded in the point data of V0.

Carry out record though establish abutment points here by the order of left-handed (Counter Clockwise) rule, also can be according to dextrorotation (Clockwise) rule.

The data structures of record 3 dimension figures 7 are also used with the same tables of data of illustrated mistake in the embodiment of aforesaid 2 dimension figures and are constituted.

Figure 27 is the figure of the data structure of expression 3 dimension figures 7, represents to constitute each point data of figure 7 with the form of tables of data.

The method that the face arbitrarily of 3 dimension figures 7 is described is described based on Figure 27.

Point V0 has a V1, V3, these 3 abutment points of V4.Be located within the above-mentioned abutment points figure of for example deriving to be described with the relation of abutment points V3.

Among the tables of data of a V0, abutment points V3 carries out record as the 2nd abutment points.So the address date of above-mentioned abutment points V3 is V3 as can be known, configuration numerical value is 1.Therefore, on the configuration numerical value 1 of V3, add 1 or subtract 1.That is, light from the adjacency of V0 under the rotating to the right situation at configuration numerical value add+1, on configuration numerical value, add-1 left under the rotating situation.

In the present embodiment, so owing to be 2 to guide to the 2nd abutment points in the point data of V3 if select dextrorotation on the allocation position 1 of V3, to add 1.In the point data of V3, be in the 2nd be V2.So the configuration numerical value of V2 is 1.

If adding 1 on the configuration numerical value 1 of V2 is 2, be directed into the 2nd V1 that is write down in the point data of V2, its configuration numerical value is 1.

Therefore if so adding 1 thereon is 2 if watch the 2nd of point data table of a V1 then to be a some V0, so because this is that starting point can derive V0V3V2V1.

In addition, can also with the same operation in summit that take out to constitute polyhedral crest line or face, the reference mark of taking out curved surface.Though here be not described in detail but as a result of be exactly that the data of the figure that mixes of polyhedron or curved surface can be carried out record with identical structure.

Even if in the figures of 3 dimensions, the action that also can use mark E will be transferred to the address of the some Vm that is write among the j of abutment points table of a Vi is written as

Vm＝E[Vi(j)]。

Here Vi (j) is the address date of the some Vn that write among the j of point data table of a Vi, and E represents that actual transfer arrives the action of Vm.If use this mark E, if the number of the configuration numeric field of the some Vm that is write among the j of Pj for the point data table of some Vi, the number of abutment points of Vi of setting up an office is K, if XmodK is the remainder after X is divided by with K, then the operation of deriving some Vn with the inhour rotation with respect to the face in the left side of the line of point of contact Vi, Vm just is represented as

Vn＝E[Vm(((Pj-1+K-1)modK)+1)](51-1)。Deriving the operation of a Vn with respect to the face on right side to turn clockwise in addition just is represented as

Vn＝E[Vm(((Pj+1+K-1)modK)+1)](51-2)。

When add 1 or when subtracting 1 on the numerical value in configuration, on the configuration numerical value of reference point data table, do not add 1 or subtract under the situation of the numerical value after 1, for example, configuration numerical value be 3 must carry out the 4th of comparable data table by add-one operation with reference to but in this tables of data, do not have just to make it to turn back to the 1st under the 4th the situation.Be 1 to be just with reference to last numerical value under 0 the situation at configuration numerical value in addition by subtracting that 1 computing makes with reference to numerical value.

Owing to express with E as described above 1 abutment points explored 1 time to derive the operation on new summit, so data structure of the present invention just becomes the crest lines of the face that will use with operation left-handed or that dextrorotation is extracted in the polyhedrons of 3 dimension figures are handled more, carry out 1 operation respectively and get final product and do not need numerous and diverse data structure operable.

Figure 28 has 3 dimension figure 7a of closed region and does not hold the total point of the figure 7b V1 of closed region, the example of so-called non-manifold figure.At the processing of the point data beyond the some V1 of figure 7a with above-mentioned equally.But, because figure 7b does not have closed region.So just can not regard as from the outside as turning clockwise or the counter-clockwise order that decides abutment points like this of rotating, the order of therefore putting the abutment points among the V1 for example determines to be V10, V12, V14.It also can be the order of V10, V14, V12.

Be V10, V12, V14 if will put the order decision of the abutment points of V1, then, when the formation summit of face F1 is taken out with the inhour rotation, just can utilize above-mentioned formula (51-1) at face F1 from the direction figure 8 of arrow.Wherein, establish the number that the several K that occur in the formula of formula (51-1) are the formation summit of face F1.

The point data of the point V1 of the figure 7a of Figure 28 and 7b constitutes as shown in Figure 29.The point data of a V1 is divided into the abutment points data of figure 7a and the abutment points data of figure 7b, and the abutment points data storage that makes figure 7a is above table, and the abutment points data storage that makes figure 7b is below table.If will be for the abutment points of the figure 7b of a V1 with V10, V12, V14 additional sequence, then from the face F1 of direction Figure 28 of arrow the time, (with the inhour rotation) that next of V1, V10 of taking out face F1 constitutes some V11 be calculated and just is represented as

V11＝E[V10(((Pj-1+K2-1)modK2)+K1+1)]......(54-1)。Wherein, K1 is the number of abutment points that belongs to the figure 7a of a V1, and K2 is the number that belongs to the abutment points of figure 7b.In addition, P1 is the configuration numerical value for the abutment points V10 of a V1.From the direction face F1 of arrow the time, when the formation point of face F1 was taken out with the inhour rotation, as long as all carry out and the same calculating of formula (54-1), the order of the abutment points of some V11, the V12... of Figure 28 is decision automatically just.

Figure 30 is with representing that the key diagram of other embodiment illustrates the point range of a C0～C11.

Be that starting point adds 2 or subtract 2 computings when C4, C7, C10 are taken out in turn on the configuration numerical value of point data table shown in Figure 31 for example establishing C1.In addition when carried out adding 2 or when subtracting 2 computings on the numerical value in configuration, under the situation of the order that does not have this numerical value that has carried out additive operation on the point data table, for example dispose numerical value and be 3 must the reference point data table by adding 2 computings the 5th but in the point data table, have only by under Next the 4th data conditions and turn back to the 1st with regard to replacing the 5th, be 4 must the point data table by adding 2 computing the 6th at configuration numerical value in addition, but in the point data table as long as by just replacing the 6th and turn back to the 2nd under the 4th following two data conditions.And be last with reference to the abutment points table under 0 the situation deducting numerical value after 2, becoming under-1 the situation just from the 2nd of last reference.

On longitudinal direction or transverse direction, explore be point range that the such clathrate of Figure 30 given take out in turn point range operate in the generation of curved surface the time often carry out.

Figure 32 represents the object lesson that data structure according to the present invention is launched to 3 dimension figures from 2 dimension figures.

Figure 32 (a) is 2 dimension figures of making the paper mold (pattern) under the clothes situation, and 1,1 ' is the predecessor among the figure, and 2,2 ' is the back body, and Figure 32 (b) has carried out stitching, has been through the figure (3 dimension figure) under the situation on the human body above-mentioned paper mold.

Though in the present invention since 2 dimension figures still 3 tie up figures and all constitute with same data structure, institute is so that each point A～J holds attribute information, for example only the situation of A1 and A1 ', B1 and B2, C1 and C2... and so on is specified and sew up necessary place (point), just can carry out the expansion shown in Figure 24 (b) to solid.

Then in data structure of the present invention, just form the method representation one example of curved surface.

Here the figure that the curved surface that utilizes the sectionalization method and plane are mixed generates.

The sectionalization method is meant that the part that corner angle are arranged with figure little by little rounds the sliding method that finally obtains the shape of level and smooth curve and curved surface.

Adopt in the present embodiment by Catmull﹠amp; The way of the sectionalization of Clark institute motion.

In data structure of the present invention, hold attribute by the data that make the each point that constitutes figure and carry out sectionalization.

The attribute that each point is held can list: 1. being polyhedral summits, 2. being polyhedral summits and being the reference mark of curved surface, 3. is borderline reference mark of plane and curved surface, 4. is reference mark of curved surface etc.

In data structure of the present invention, constitute the data of point and keep the structure of avatars information necessary to constitute respectively because the data of figure are it, so can be by the data of curved surface only or only difference, the above-mentioned Catmull﹠amp of the special data and so on of curve as each point; The sectionalization way of Clark easily connects the point on the curved surface and the sectionalization of borderline point.

Sectionalization utilizes the process shown in Figure 33 (a)～(f) of generation method of curved surface of sectionalization to carry out with expression in addition, to generate curved surface.(a) is the 3 dimension figures that do not carry out sectionalization among the figure, (b) is the 1st time sectionalization figure, (c) is the 2nd time sectionalization figure, (d) is the 3rd time sectionalization figure, (e) is the sectionalization figure of the 4th, (f) is the sectionalization figure of the 5th.

In data structure of the present invention, expression generates the method for 3 dimension figure A with barrel surface shown in Figure 34.Processing about the point of the figure A beyond a V1, V2, V5, the V6 is suitable for said method.The part of the data structure relevant with a V1, V2 is shown in Figure 35.In order to describe the line of point of contact V1 and V2, at first, see in the point data zone of a V1 with the property value P of the right-hand member on the hurdle of the address date of a V2, with reference to the data of in the P of address, being stored.If the property value of address P then is circular arc as can be known.

In addition, circular arc is on the ax+vy+cz=d of plane as can be known, and the center is that (z0), radius is that the starting point of f, circular arc is that angle 0 degree, terminal point are angle 30 degree for x0, y0.

In the such figure of representing with mathematical expression of the circle of not holding abutment points or ball, if P is put in decision arbitrarily on figure, as long as the point data of this P will be pointed to the pointer in the place of storing mathematical expression and record and narrate as attribute, and need not to record and narrate especially the information relevant with abutment points.

Here carry out expressing the data volume under polyhedral situation and representing the half of data structure of technology to express the comparison of the data volume under polyhedral situation by conduct in the past by the present invention.

Calculate with necessary minimal memory capacity in theory below in addition.In fact in the stage of creation procedure, owing to hold various redundances mostly, so for the comparison of the data volume of reality, and need relatively the data volume of the solid created by 2 kinds of data structures.

Consider with regard to necessary kind and size in the half of data structure at first.

1. in the half of data structure Figure 36 (a) being cut apart shown in Figure 36 (b) like that for 1 crest line e with crest line e, make it in 6 kinds of one-sided storages (pccw, pcw, pf, pv, nv, e ') information.So 12 kinds of information are stored as data owing to also storing identical data volume total at opposition side.So, store the needed memory span Ne of whole crest lines just to be owing to they all are that per 1 pointer of pointer that points to the address of writing down dot information needs 4 bytes of memory devices

Ne＝4×12ne＝48ne。Here ne is the number that constitutes polyhedral crest line.

2. the needed memory capacity of vertex data

The 3 dimension coordinate values on summit are expressed with the combination of (x, y, z).In addition because these coordinate figures are floating numbers, so need 4 bytes respectively.If establish polyhedral formation number of vertex is that the then needed memory span Nv of nv is just available

Nv=4 * 3 * nv=12nv represents.

Though usually its pointer of holding sensing face and crest line is programmed like this beyond handling above-mentioned data, so ignore them owing to consider minimal storer here.

3. the needed memory capacity of face data

Owing to need constitute 1 pointer in the crest line with reference to it by face, so essential memory span Nf is

Nf＝4×nf。

Here nf constitutes polyhedral number.

If comprehensive above-mentioned 1.2.3 is then just available in order to store the needed whole memory capacity Nh of polyhedron

Nh=48ne+12nv+4nf represents.

Yet, known below between the number of the polyhedral summit that does not have the hole, crest line, face relation set up (Euler characteristic).

nv+nf-ne＝2

Because if polyhedral, the number on crest line, summit become many, then the constant 2 that compares the right of back following formula with them just can be regarded the pettiness amount that can ignore degree as, so the approximate establishment of following formula.

ne＝nv+nf......(1)

Because the relation of number of vertex and face number can't be obtained with resolving, thus can't record and narrate exactly, if hypothesis

Press nf=1.5nv

Estimate that then needed data volume just is

Nh＝48ne+12nv+4×1.5nv＝48ne+18nv。If utilize formula (1) just to obtain

Nh＝48ne+7.2ne＝55.2ne......(2)。

Just as can be known in order there not to be the minimum 55.2ne byte that yet needs of the necessary memory span of polyhedron in hole with the half of data structure storage.

Consider with regard to using the situation of not holding attribute information according to data structure of the present invention.

The memory span of coordinate figure that is used to store the summit is identical with half of data structure.Just, for the necessary capacity Nv of the coordinate figure of storing the summit be

Nv=12nv...... (3) byte.

Just being used for the needed storer of point data table investigates.

Because the number of abutment points only is just in time 2 times of the crest line number, establishing each key element in addition needs 4 bytes of memory devices, thus be used for the necessary storer Nn of point data table,

Because the data of putting down in writing in the abutment points table only are just in time 2 times of total crest line number, each data area of establishing table in addition needs 4 bytes of memory devices, so be used for the necessary storer Nn of point data table is

Nn=2ne * 4=8ne...... (4) byte.Under the number on the summit of adjacency on the summit is situation below 256,, be so be used for this memory storing Np that disposes numerical value just enough with 1 bytes of memory device with the storage of the corresponding configuration numerical value of pointer of the address of pointing to each abutment points

Np=2ne...... (5) byte just can solve.

If then needed as can be known memory capacity Nc is gathered in formula (3), (4), (5) be

Nc=12nv+8ne+2ne=14.8ne... (6) byte just can solve.

If the memory span of data structure needs that comparison expression (2) and (6) are then related to the present invention as can be known and half of data structure compare into its a little less than 27%.

Under the situation that connects the point more than 256 on 1 point, for example 65, so under the situation below 536 owing to need 2 bytes if the Np of formula (5) just calculated again be in the storage of the configurable number of point data table,

The Np=4ne byte.Be about 33% of half of data structure just in the case.

Owing to can not generate usually in abutting connection with such polyhedron more than 65,536 on 1 summit, the calculating of the memory capacity under the situation of more summits adjacency is just omitted.

Above-mentioned estimates the memory span of minimum more in theory, actually because the both holds redundance to a certain degree, so also be necessary to carry out on computers the comparison of the situation of installation.Half of data structure and data structure related to the present invention are installed respectively on computers through after relatively, and the data volume under the situation of solid having been carried out recording and narrating with data structure related to the present invention and the situation of half of data structure compare and are about 1/3.

Then at utilizing according to data structure of the present invention, which kind of degree is memory capacity increase under the situation of will the historical information relevant with the distortion of figure all storing, and the history that the actual creation program is created 3 dimension figures shown in Figure 37 are stored and checked necessary storer.

Figure 37 is an example of having carried out 3 dimension figures of storage with data structure of the present invention, and Figure 38 represents the process that this figure is created.Illustrate with each process be divided into the operation grade 1～9, on the way carry out return enter subsequent processing and so on a series of operating process.

3 dimension figure A shown in Figure 37 create with following such operation.

At first, generate 2 dimension figures (operation grade 1) shown in Figure 38, this face is scanned to generate 3 dimension figures (operation grade 2).And then, generate projection (projection) (operation grade 3) in the above.

Then cancellation operation grade 3 turns back to the recess (operation class 4) that operation grade 2 generates the bottom surface.Next carry out the generation of recess and the formation in hole (operation class 5) then in the above.And then superincumbent other parts are carried out the generation of recess and the formation in hole (operation class 6).

Form other hole (operation grade 7).Then, the formation in the hole of cancellation operation grade 7, the return class 6 generates recess (operation grade 8) in the above.

Carry out the formation (operation grade 9) in hole then at last,, and create 3 dimension figure A the part curved surfaceization of the recess on top.

From the operation of aforesaid operations grade 1 to 9, begin to be out of shape like this by operation grade 2, operation grade 3... from the figure of operating grade 1.

Promptly, as Figure 38 of flow process that grade is respectively operated in expression, by＜1〉→＜2 →＜3 carried out distortion after, cancellation＜3〉turn back to＜2, by＜2〉→＜4 →＜5 →＜6 →＜7 be out of shape cancellation＜7 this time turn back to＜6 by＜6 →＜8 →＜9 be out of shape.

In the distortion of from then on operating grade 1 to 9, the back result is write down in the passing of the memory capacity under whole situations of storing its change historical information in Figure 39, represent.

In chart shown in Figure 39, transverse axis has represented to carry out the number of times (will operate grade 1～9 be made as historical grade 1～9 express) of distortion, and the longitudinal axis represents that reality used the memory capacity of storer and the number of vertex of figure A.In the above-mentioned chart ▲ variation of the number of vertex of a presentation graphic A.

In addition in above-mentioned chart, bar charts a represents to be stored in the needed memory capacity of figure that is generated in each stage of operation grade, bar charts b represents to store the desired memory capacity of whole deformation history (all change is historical) till operating figure that grade was generated with it, bar charts c represents to store the total of respectively operating the needed memory capacity of whole figures in the grade (for example, each historical grade till historical grade 1～5 under the situation at historical class 5) till the stage of its operation grade.

Store the necessary memory space of whole deformation history (bar charts b) as can be known necessary storer of figure of storage (bar charts roughly passing between 1.3～1.5 a) according to chart shown in Figure 39.Be exactly when after figure generates, having carried out the operation cancellation when multiplying power uprises.

For relatively, carry out estimation in addition by the necessary memory capacity of figure monomer shown in the operation grade 9 of half of data structure storage Figure 38.By its result as can be known the necessary memory space of figure monomer shown in the storage operation grade 9 use data structure storage of the present invention all operate grade the historical necessary memory space of change at double more than.

For the relation to the use amount of and storer historical according to the change of figure of the present invention compares in more detail, figure B shown in Figure 40 is carried out and above-mentioned same investigation.

Its result is exactly the chart that the relation of historical and consume memory amount is changed in expression shown in Figure 41 for 100 times.

In this example, so because the distortion number of times of figure is that 100 instrumentations carry out with per 10 times.Become complicated along with shape and increase though store a necessary amount of memory of figure as can be known, keep that all the historical necessary amount of memory of change is relatively low.

In above-mentioned chart, bar charts A has represented to carry out whole amount of memory that figure is essential of each operation back storage, and bar charts B represents to store the needed amount of memory of whole deformation history so far.The △ mark of chart represents to store the passing of a necessary amount of memory of figure and the ratio of the desired amount of memory of the whole deformation history of storage.

Even if as can be known the change history of figure all is stored in the data according to above-mentioned investigation, its memory space is also little, and the situation of the figure of creating with half of data structure with storage compares, and the storer use amount significantly tails off and well.That is, below according to the essential amount of memory of a graph data of half of data structure, just can create the graph data of holding whole change history with data structure of the present invention.

As gathering of above-mentioned record content, figure is being created the different of the situation of preservation and the situation of figure being created preservation with the half of data structure of prior art with data structure of the present invention shown in the comparison sheet of Figure 42.

Claims (20)

1. data structure that makes Computer Storage 2 peacekeepings 3 dimension figures, described data structure is the means that are used for 2 peacekeepings, the 3 dimension figures of being described by computing machine reproducibly are recorded in the storer of computing machine, can be only keep coming the composing images data to carry out the expression of this figure for the aggregate of the point data of expressing the figure information necessary with the each point that makes end points as the line of the geometry shape of expressing this figure constitute this figure, wherein said computing machine possesses store graphics data and to the device of its program of handling and the arithmetic unit that above-mentioned graph data is handled, described data structure is characterised in that:

To write down above-mentioned each constitute some point data separately the point data region allocation during intrinsic address, on the point data zone of the point that constitutes above-mentioned figure according to the rule that is determined in advance write down in turn with this point with address date a plurality of abutment points, that represent the address in point data zone that line linked.

2. data structure according to claim 1 is characterized in that:

The address date of representing the point data zone of this point be recorded in this point with the order of the each point data area of the abutment points that line linked be respectively which numerical value be recorded in the point data zone of this point.

3. data structure according to claim 1 is characterized in that:

The rule that is determined is meant dextrorotation or left-handed in 2 dimension figures in advance, is meant that watching the summit from the outside of figure is dextrorotation or left-handed in 3 dimension figures.

4. data structure according to claim 1 is characterized in that:

Above-mentioned point data maintains attribute information.

5. data structure according to claim 4 is characterized in that:

The attribute information of above-mentioned point data is the pointer of address that is writing down the zone of coordinate figure from the coordinate figure of this point or sensing, the numerical value that is determined in advance or the character data of the kind of expression point, the numerical value that is determined in advance or the character data of the color of expression point, the numerical value that is determined in advance or the character data of the kind of the processing that expression is relevant with point, the pointer of address in the zone of other graph datas is being write down in sensing, and expression is a SPL, the B-SPL, Bezier, nurbs curve, the sectionalization curve, perhaps B-SPL, Bezier, in the free curve beyond the nurbs curve which the numerical value that is determined in advance at reference mark or character data in 1 or 2 above attribute informations being selected.

6. data structure according to claim 4 is characterized in that:

The attribute information of above-mentioned point data be be adjacent a little at this point between the relevant attribute information of line drawn.

7. data structure according to claim 6 is characterized in that:

The above-mentioned attribute information relevant with line is numerical value that is determined in advance or the character data from the kind of expression line, the numerical value that is determined in advance or the character data of the color of expression line, the pointer of the address in the definition data of online situation lower curve for curve or the zone of the definition that curve is being stored in sensing, the pointer of the address in the zone that field of definition is being stored in the field of definition data of coefficient and variable or sensing, and expression is a SPL, the B-SPL, Bezier, nurbs curve, the sectionalization curve, perhaps B-SPL, Bezier, the attribute information of being selected in the numerical value that is determined in advance of which kind in the free curve beyond the nurbs curve or the character data more than 1 or 2.

8. data structure according to claim 1 is characterized in that:

Under the situation of being out of shape because of the change of the change of the establishment of the moving of one or more point of constituting this object figure, deletion, new point, attribute or abutment points, in the point data of the each point that above-mentioned change has been carried out, writing down expression as historical information is that point, attribute change or the abutment points that moves, deletes, newly creates changes the information of the point that has carried out and represent that this distortion is the distortion time numerical value of which time distortion of this object figure.

9. data structure according to claim 8 is characterized in that:

Under the situation of having carried out distortion, be that to establish the distortion number of times be 1 and will be out of shape number of times in turn and add up mutually and carry out record to each distortion as the distortion time numerical value of its historical information, distortion at figure is under the situation about causing because of the deletion of putting, and its distortion of additional representation is the mark that causes because of the deletion of putting on above-mentioned distortion time numerical value.

10. data structure according to claim 8 is characterized in that:

Taking place under the situation of figure deformation because of the moving of the point that constitutes this object figure, deletion, attribute change or abutment points change, before in each point data, writing down moving of this point, before the deletion as historical information, attribute before changing or abutment points before changing point data and move back, deletion back, attribute after changing or abutment points point data after changing.

11. data structure according to claim 8 is characterized in that:

Under the situation that this object figure is out of shape because of the establishment of the new point that constitutes this figure, the point data of this point just be used as hold its distortion distortion constantly time numerical value as the new point data of historical information create, record.

12. data structure according to claim 8 is characterized in that:

Carrying out under the situation of distortion because of the moving of point, deletion, newly-built, the change of attribute or the change of abutment points, the data of this object figure and each point data phase region keep not at every turn establishing that to be out of shape number of times be the change record of this object figure behind 1 addition record.

13. program, when the 2 peacekeepings 3 dimension figures that will be described by computing machine reproducibly are recorded in the storer of computing machine, the point data that constitutes the above-mentioned point of this figure is write on storer or reads, keep constituting this view data to carry out the expression of this figure with the each point that makes end points as the line of the geometry shape of expressing this figure constitute this figure so that can be only for the aggregate of the point data of expressing this figure information necessary, wherein said computing machine possesses store graphics data and to the device of its program of handling and the arithmetic unit that above-mentioned graph data is handled, described program is characterised in that:

(1) distribute the zone that the data of the premises are recorded the address order and according to utilizing purpose to read the order of this address;

(2) will with the point that constitutes this image write in turn according to the rule that is determined in advance with the address date of the address a plurality of abutment points, that represent the each point data area that line linked this point the point data zone order and according to the order that utilizes purpose to read from the same area.

14. program according to claim 13 is characterized in that comprising:

The order that the address date of data area of this point of expression is recorded in the each point data area of a plurality of abutment points be respectively which numerical value write this point the point data zone order and according to the order that utilizes purpose to read from the same area.

15. program according to claim 13 is characterized in that:

The rule that is determined is meant dextrorotation or left-handed in 2 dimension figures in advance, is meant that watching the summit from the outside of figure is dextrorotation or left-handed in 3 dimension figures.

16. program according to claim 13 is characterized in that also comprising:

The described attribute information of claim 4 write the order in above-mentioned point data zone and according to the order that utilizes purpose to read from the same area.

17. program according to claim 13 is characterized in that also comprising:

The described historical information of claim 8 write the order in above-mentioned point data zone and according to the order that utilizes purpose to read from the same area.

18. a program is characterized in that:

The described program of available claim 13 is carried out the processing of the figure that 2 dimension graphics process, 3 dimension graphics process or 2 peacekeepings 3 dimension figures mix on computers.

19. recording medium that has write down the embodied on computer readable of the described computer program of claim 13.

20. a record carries out the recording medium of data base system and utilizable embodied on computer readable based on the graph data of the above-mentioned data structure of utilizing the described computer program of claim 13 to be created.

Images