JPH0973559A - Morphing editing device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily execute the morphing of even shapes different in the numbers of faces and vertexes from each other by providing a coordinating means, a morphing means and a generating means which are respectively specified. SOLUTION: An original shape reading means 1 reads plural shapes (original shapes) which become originals for morphing display. Next, a mesh shape reading means 2 reads the shape matched with the original shape from among a planar mesh shape, a curved mesh shape and a 3-dimensional mesh shape. Then the coordinating means 3 respectively coordinates the same mesh shape to the plural original shapes and the morphing means 4 generates respective morphing-applied mesh shapes obtained by morphing the grid point of the mesh shape to the coordinate value of a point coordinated with the original shape. Furthermore an animation means 5 executes arithmetic between these plural morphing-applied mesh shapes being the same number of faces and grid points to generate one new shape. Thus, a single new shape (the morphing-applied shape) is generated at high speed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a morphing editing apparatus that transforms a plurality of shapes into one shape.

With the increase in speed and functionality of hardware,
3D CG animation can be displayed in real time. CG animation is drawing attention as an important technology among multimedia technologies, and the market is expanding rapidly. Deformation display between multiple CG objects is
It is generally called morphing, and it is an important technology in CG animation because it can give a viewer a sense of surrealism by performing a modified display that is impossible in reality. In many cases, shape transformation display is realized by interpolating between two-dimensional images. However, in the deformation of the three-dimensional shape, the change in shape can be seen while changing the viewpoint at various angles, which is advantageous in that a high sense of realism can be expressed. The three-dimensional shape deformation is required to enable conversion between various CG objects.

[0003]

2. Description of the Related Art A conventional three-dimensional shape deformation animation is a desired three-dimensional shape that is deformed by performing shape deformation calculation between a surface and two shapes having the same number of vertices on each surface by the procedure shown in FIG. Was trying to get.

FIG. 19 shows an explanatory view of the prior art. FIG.
In 9, S1 reads the shape. This reads a shape with the same number of faces and the same number of vertices before and after deformation.

In step S2, the surfaces of the two shapes read in step S1 are associated with each other. In S3, the vertices in the surface are associated with the surfaces associated in S2.

S4 is 1 for each face and vertex.
A new shape is calculated by interpolating the coordinates of the shapes for the two shapes associated with each other. With the above procedure, for two shapes with the same number of faces and the same number of vertices, 1
An animation calculation (for example, an interpolation calculation) is performed while being associated with the pair 1, and the deformation display between the CG objects described above is performed.

[0007]

As described above, in the conventional three-dimensional shape deformation animation, shapes having the same number of faces and the same number of vertices are deformed to obtain a desired shape. There is a problem that the shape cannot be deformed between shapes having different numbers of faces and vertices, and the target shape is significantly limited.

The present invention solves these problems by
The object of the present invention is to make it possible to easily perform shape deformation even between shapes having different numbers of faces and vertices.

[0009]

Means for solving the problem will be described with reference to FIGS. 1 and 2. 1 and 2, the associating unit 3 associates the same mesh shape with each of a plurality of original shapes.

The deforming means 4 is for generating a deformed mesh shape by deforming the grid points of the mesh shape into the coordinate values of the points associated with the original shape. The animation means 5 is
The calculation is performed between a plurality of deformed mesh shapes having the same number of faces and the same number of grid points to generate one new shape.

Next, the operation will be described. The associating unit 3 associates the same mesh shape with each of the plurality of original shapes, and the deforming unit 4 transforms the mesh points after deformation into the coordinate values of the points associated with the original shape. Each of them is generated, and the animation means 5 performs a calculation between a plurality of deformed mesh shapes having the same number of faces and the same number of grid points to generate one new shape.

At this time, the associating unit 3 interactively associates the mesh-shaped lattice points with the original-shaped feature points. Further, the associating unit 3 interactively associates the mesh-shaped grid points with the original shape feature points, and interpolates and associates the grid points that have not been mapped based on the grid points that have been mapped. I have to.

Further, the associating means 3 and the deforming means 4 connect the mesh-shaped grid points and the base points in the original shape with a line segment, obtain the coordinate value of the intersection point where this line segment intersects with the original shape, and form the grid. The coordinate values of the points are used to generate the deformed mesh shape.

Further, the mesh shape is a plane mesh,
A curved surface mesh or a three-dimensional mesh is used. In addition, a plurality of mesh shapes are prepared in advance and selected according to the original shape.

Further, the mesh shape is divided when the distance on the original shape when the mesh shape is designated or the grid points of the mesh shape are associated with the original shape is equal to or more than a threshold value.

Further, a density sphere is placed at a mesh-shaped grid point, and the density sphere moved to the deformed mesh-shaped grid point is calculated between adjacent density spheres. Therefore, it becomes possible to easily perform shape deformation even between shapes having different numbers of faces and vertices.

[0017]

BEST MODE FOR CARRYING OUT THE INVENTION Next, embodiments and operations of the present invention will be sequentially described in detail with reference to FIGS.

FIG. 1 shows an explanatory view of an embodiment of the present invention. FIG. 1A shows a block diagram. FIG. 1 (a)
In the above, the original shape reading means 1 reads a plurality of original shapes (original shapes) to be transformed and displayed. For example, the shapes 1 and 2 represented by the thick lines, which are the original shapes of FIGS. 2A and 2A described later, are read.

The mesh shape reading means 2 reads the mesh shape. For example, FIGS. 3 and 4 described later.
Also, a plane mesh shape, a curved surface mesh shape, or a three-dimensional mesh shape shown in FIG. 5 that matches the original shape is read.

The associating means 3 associates the read mesh-shaped lattice points with the original shape. The transforming means 4 obtains the coordinate values of the points of the original shape with respect to the mesh-shaped grid points associated by the associating means 3, and transforms these coordinate values into the coordinate values of the grid points.

The animation means 5 is for generating one deformed shape by calculating the deformed meshes having the same number of planes and the same number of grid points for a plurality of original shapes. Next, according to the order shown in the flowchart of FIG. 1B, the operation of the embodiment of FIG.
This will be specifically described with reference to FIG.

In FIG. 1B, S1 reads the original shape. This is shown in FIG.
The thick line shape 1 in (A) and the thick line shape 2 in FIG. 2A are read as original shapes.

In step S2, the mesh shape is selected and read. This has the same number of planes and the same grid points,
For example, the shape of the dotted plane mesh of FIG. 2A is for shape 1, and the shape of the dotted plane mesh of FIG.
Read each for.

In step S3, it is determined whether there is a feature point to be associated. In the case of YES, the process proceeds to S4. On the other hand, in the case of NO, the coordinates of the points on the mesh that are not associated in S7 are calculated and acquired from the coordinates of the associated points, and the position is moved (thus, among the grid points of the mesh , Grid points not associated with the original shape will be interpolated and associated based on the coordinate values of neighboring grid points associated with each other).

In S4, since it is determined that the original shape has a characteristic point in YES in S3, the characteristic point is interactively designated. S5
Specifies a point on the corresponding mesh shape.

In step S6, the position of the designated point on the mesh shape is moved to the coordinate of the corresponding feature point. As a result, the coordinate values of the specified feature points on the original shape are set as the coordinate values of the grid points on the specified mesh shape,
This means that the grid points on the mesh have moved to the feature points on the original shape. Then, returning to S3, the coordinate values of the grid points on the mesh shape are repeatedly obtained. Here, for the coordinate values of the grid points that have not been obtained, interpolation is performed based on the coordinate values of the grid points associated in S7 as described above, and the coordinate values are obtained for all grid points. As a result, as shown in FIGS. 2B and 2B to be described later, the coordinate values of the grid points of the dotted mesh shape have coordinate values that match the original shapes 1 and 2, and Becomes 2 and FIG. 2 in which the number of faces and the number of grid points are equal.
With respect to the deformed mesh shape of (b), it is possible to interpolate the coordinate values of each lattice point and obtain one deformed shape as shown in (C) of FIG.

As described above, the coordinate values of mesh points having the same number of faces and the same number of grid points of a plurality of original shapes are associated with the original shapes, and their coordinate values are interpolated to obtain coordinate values to obtain the deformed mesh shape. Respectively, and by performing interpolation calculation between the coordinate values of the grid points of the deformed mesh shape to generate one deformed shape, one shape (C) of FIG. The shape after morphing) can be generated at high speed.

FIG. 2 is a diagram illustrating a specific example of the present invention. FIG. 2A shows an example of the original shape 1 and the mesh shape. Here, the thick line is the original shape 1, and the dotted line is the mesh.

FIG. 2A shows an enlarged view of the upper left quarter portion on the mesh of FIG. 2A. FIG. 2B shows a deformed mesh shape after the mesh shape is deformed to the original shape 1. Here, for example, for a total of 12 grid points such as ●, ○, and ◎ on the mesh shown in (A-1) of FIG. 2, feature points on the original shape 1 are interactively specified, or a mesh-shaped grid is used. By connecting the point and the base point inside the shape 1 with a line segment, the coordinate values of the intersections where this line segment intersects the shape 1 are obtained, and the coordinate values of the corresponding shape 1 are given to the grid points on these meshes. The shape follows the shape 1 (when the coordinate value of the shape 1 is not found at the grid point, it is found by interpolation based on the found coordinate value).

FIG. 2B-1 shows the corresponding grid points of the deformed mesh shape of FIG. 2A-1.
Here, the coordinates of the lattice point of shape 1 are (M, N).
Similarly, for shape 2, (a), (a-1),
It is generated as shown in (b) and (b-1).

FIG. 2C interpolates the coordinate values of each grid point of the deformed mesh shape of shape 1 of FIG. 2B and the deformed mesh shape of shape 2 of FIG. 2B. The generated shape after morphing is shown. Here, in the morphing (deformation display), as shown in the figure, the coordinate value of the grid point of the deformed mesh shape of the shape 1 of FIG.
N) and the coordinate values of the lattice points of the deformed mesh shape of the shape 2 in FIG. 2B are (m, n), (M * t + m * (1-t), N * t + n * (1 −t)) (Equation 1) is obtained.

Here, t represents an interpolation rate. As described above, after the deformed mesh shapes are generated using the mesh shapes having the same number of faces and the same number of grid points for the shape 1 and the shape 2, each of the two transformed mesh shapes having the same number of faces and the same number of grid points is used. It is possible to easily generate one morphed shape by interpolating the coordinate values of the grid points. The details will be sequentially described below.

FIG. 3 is an explanatory view of a specific example of the present invention (part 1).
Is shown. This shows an example using a planar mesh shape.
FIG. 3A shows a planar mesh shape and a shape before association. Here, the dotted line represents the planar mesh shape, the solid line represents the shape, and the same symbols such as ◯, Δ, and × represent the corresponding points.

FIG. 3B shows the planar mesh shape after the association and deformation. This is the planar mesh shape after transforming the coordinate values of the symbols such as ◯, Δ, and × of the points on the shape of FIG. 3A into the coordinate values of the grid points of the same symbol on the planar mesh shape. is there.

FIG. 4 is a diagram for explaining a concrete example of the present invention (part 2).
Is shown. This shows an example using a curved mesh shape.
FIG. 4A shows the curved surface mesh shape and the shape before association. Here, the dotted line represents the curved mesh shape, and the solid line represents the shape.

FIG. 4B shows the curved surface mesh shape after association and deformation. This is the curved mesh shape after the coordinate values of the feature points on the shape of FIG. 4A are transformed into the coordinate values of the corresponding grid points on the curved mesh shape.

FIG. 5 is a diagram for explaining a specific example of the present invention (part 3).
Is shown. This shows an example using a three-dimensional mesh shape.
FIG. 5A shows the three-dimensional mesh shape and the shape before association. Here, the dotted line represents a spherical mesh shape that is a three-dimensional mesh shape, and the solid line represents a cylinder that is a shape.

FIG. 5B shows the spherical mesh shape that has been associated and deformed. This is the spherical mesh shape after transforming the coordinate values of the symbols ◯, Δ, ×, etc. of the points on the cylinder of FIG. 5A as the coordinate values of the grid points of the same symbol on the spherical mesh shape. is there.

FIG. 6 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 3, 4, and 5 are the same as those having the same numbers in FIG. In FIG. 6, the mesh shape selection means 21 selects a mesh shape having an appropriate shape that most closely matches the original shape from the mesh shapes prepared in advance. For mesh shape,
There are the above-mentioned plane mesh shape, curved surface mesh shape, three-dimensional mesh shape (rectangular mesh shape, spherical mesh shape, etc.). From these mesh shapes, the mesh shape closest to the original shape is selected. The selection method is
For example, the minimum value and the maximum value in the x-axis direction, the y-axis direction, and the z-axis direction are obtained, and the differences l, m, and n between these maximum values and the longest values
Is calculated, and any mesh shape is selected based on these l, m, and n. For example, when 1≈m≈n, a spherical mesh shape is selected as 1> m, when n is selected, a cylindrical mesh shape is selected, and when 1≈m≈0.5n, a cubic mesh shape is selected.

As described above, by selecting the mesh shape that most closely matches the original shape, it becomes possible to generate a deformed mesh shape that more accurately reflects the original shape.
FIG. 7 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 3, 4, and 5 are the same as those having the same numbers in FIG.

In FIG. 7, the mesh square shape selecting means 22
Is to select an appropriate polygonal mesh shape that most closely matches the original shape from the previously prepared polygonal mesh shapes. The mesh shape is a triangular mesh shape, 4
There is a square mesh shape ... etc. The polygonal mesh shape closest to the original shape is selected from these multiple types of polygonal mesh shapes. The selection method is selected according to the original polygon.

As described above, by selecting the polygonal mesh shape that most closely matches the original shape, it is possible to generate a deformed mesh shape that more accurately reflects the original shape.

FIG. 8 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 3, 4, and 5 are the same as those having the same numbers in FIG. In FIG. 8, the mesh dividing means 23 divides the mesh shape to be deformed into finer polygonal mesh shapes. This division finely divides the main part of the polygonal mesh shape, for example, the eyes and nose of a human face. In addition, the grid points of the mesh shape and the base point in the original shape are connected by a line segment, and the coordinate value of the intersection point where this line segment intersects the original shape is obtained,
The distance between these coordinate values is determined and the distance is divided when the distance is equal to or greater than a threshold value.

As described above, in the polygonal mesh shape, the part corresponding to the main part of the original shape is further finely divided so that the characteristics of the original shape are more accurately reflected in the deformed mesh shape, and further the predetermined shape is set on the original shape. It is possible to divide within the distance and accurately reflect the original shape to the deformed mesh shape.

FIG. 9 shows an explanatory view of another embodiment of the present invention. Here, the reference numerals 1, 2, 3, 4, and 5 are the same as those in FIG. 1, and the reference numeral 21 is the same as those in FIG.

In FIG. 9, the mesh converting means 24 is
When the polygonal mesh shape applied to the original shape is different, the polygonal mesh shape is divided into the same polygonal mesh shape. This means that when the polygon mesh shapes selected in FIGS. 6, 7, and 8 described above are different or partially divided, the same number of faces and the same number of grid points are used before the animation means 5 morphs. The one with the smaller number of divisions is divided so that

As described above, even when the number of faces and the number of grid points of the polygonal mesh shape applied to a plurality of shapes are different or even when they are partially divided and different, the same number of faces and the number of grid points are divided. After the deformation, the mesh shape can be obtained, and the arithmetic processing can be easily performed when the two shapes are morphed.

FIG. 10 is an explanatory view of the concentration sphere of the present invention.
These density spheres are placed at the mesh-shaped grid points described above, and are spheres (ellipsoidal spheres) that express the density of existence where the density at the center is high and the density becomes lighter toward the periphery as shown in the figure. That is what is called a metaball. When the adjacent density spheres overlap each other as shown in the figure, the respective densities are added, and only the portion where the densities are equal to or greater than a certain value (threshold value) is actually drawn as a model. The bottom of the figure shows the concentration distribution map, the middle shows the state of the concentration distribution when the concentration spheres are overlaid (the model in which the shaded area is actually displayed), and the top shows the concentration sphere. The density sphere can represent a smooth curved surface as compared with a model composed of polygons (polygonal surfaces).

FIG. 11 shows an explanatory view of another embodiment of the present invention. Here, the reference numerals 1, 3, 4, and 5 are the same as those in FIG. In FIG. 11, the mesh / density sphere shape reading unit 25 reads a mesh / density sphere shape in which predetermined density spheres are further added to the grid points to the mesh shape read by the mesh shape reading unit 2 described above. It is a thing.

The density sphere parameter setting means 26 sets and edits parameters (for example, radius, density attenuation rate from the center, etc.) for determining the density of the density sphere placed in advance on the mesh-shaped grid points. is there. Here, the mesh shape defines the arrangement of density spheres and specifies the center position thereof. What is actually drawn as a shape is a density sphere (overlap of density spheres).

As described above, the density sphere is placed on the mesh-shaped lattice points, and the radius of the density sphere and the density attenuation rate from the center are set as parameters to make the shape after morphing smoother. It becomes possible to express.

FIG. 12 shows a flowchart for explaining the operation of another embodiment of the present invention. This is for interpolating from the obtained coordinate values of the grid points when the coordinate values of the mesh-shaped grid points are not directly obtained.

In FIG. 12, in S11, it is determined whether or not there are lattice points associated with the surroundings. This is because among the mesh-shaped grid points, the grid points for which the corresponding coordinate values of the original shape have not been found have the grid points associated with the surroundings (the grid points for which the corresponding coordinate values of the original shape have been found). Determine whether. In the case of YES, the coordinate value of the associated grid point found in S13 is acquired, and the process proceeds to S14. on the other hand,
In the case of NO, the search range is further expanded in S12 and S
Repeat 11

In step S14, it is determined whether the number of acquired data is equal to or larger than the designated number or the search range is equal to or larger than the designated area. If YES, the process proceeds to S15. If NO, the process returns to S11 and is repeated.

In S15, the coordinate value of the grid point to be calculated and
The interpolation rate is calculated from the position (eg, distance) of the grid point of the acquired data. In S16, the coordinate values of all the acquired data are multiplied by the weight of the interpolation rate (the total of all the interpolation rates is normalized to 1 and reconverted), and the result is added to obtain a new coordinate value.

As described above, among the mesh-shaped lattice points whose coordinate values have not been determined, the coordinate values of the lattice points whose coordinate values have not been determined are interpolated from those whose peripheral coordinate values have been determined.

FIG. 13 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 4, and 5 are the same as those of the same numbers in FIG. In FIG. 13, the associating means (automatic) 3 automatically associates the mesh-shaped lattice points with the original shape,
As shown in FIG. 14, a grid point of the mesh shape and a center point (base point) in the original shape are connected by a line segment, the coordinate value of the intersection point where this line segment and the mesh shape intersect is obtained, and this coordinate value is meshed. It is used as the coordinate value of the grid point of the shape.

As described above, it becomes possible to automatically obtain the coordinate values of mesh-shaped lattice points. FIG. 14 shows an explanatory view of another embodiment of the present invention. Here, the dotted line represents the spherical mesh shape, and the solid line represents the shape (original shape) of the deformation target. This is for automatically calculating the coordinate value of the grid point of the mesh shape, and as shown in the figure, the coordinate of the grid point p0 of the spherical mesh is a vector (M → p0) from the center.
Is obtained by calculating the coordinate value of the intersection (Q) with the spherical mesh shape using. To put it plainly, the coordinate values of the lattice points of the spherical mesh shape and the center M of the original shape are connected by a line segment, and the coordinate value of the intersection point where this line segment intersects the original shape is obtained.
Let these coordinate values be the coordinate values of the grid points of the spherical mesh shape.

FIG. 15 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 4, and 5 are the same as those of the same numbers in FIG. In FIG. 15, the associating unit 27 automatically associates the mesh-shaped grid points with the original shape, and associates the mesh-shaped grid points with the center point (base point) in the original shape. It connects with a line segment, the coordinate value of the intersection of this line segment and the mesh shape is obtained, and this coordinate value is used as the coordinate value of the grid point of the mesh shape.

The associating instruction means 28 is the associating means 2
The coordinate values obtained by automatically associating the mesh-shaped grid points with the original-shaped points by 7 are corrected in accordance with the correction instruction from the user.

As described above, after the coordinate values of the mesh-shaped grid points are automatically obtained, the coordinate values of the mesh-shaped grid points are appropriately corrected / edited in response to the interactive correction instruction from the user. It becomes possible to do.

FIG. 16 shows an explanatory view of another embodiment of the present invention. Here, 1, 2, 3, 4, and 5 are the same as those having the same numbers in FIG. In FIG. 16, the grid-point associated moving means 29 additionally moves surrounding grid points that are not associated with each other when the associated mesh-shaped grid points are moved. At this time, an area range in which the grid points are additionally moved (for example, range setting by coordinate values, range specification by adjacent positions of grid points, etc.) is set in advance. It is also possible to specify whether or not the user will actually move with each time.

FIG. 17 shows an explanatory view of another embodiment of the present invention. Here, the uppercase letters indicate that they have been associated, and the lowercase letters indicate that they have not yet been associated. 17A shows the mesh shape before movement.

(B) in the example of FIG. 17 shows a state where the mesh-shaped lattice point A is moved. (C) in the example of FIG.
Shows a state in which the grid point b before association is equally divided between the grid point C and the grid point C that have been associated with each other in response to the movement of the grid point A in (B).

17B shows the mesh shape before movement. (B) in the example of FIG. 17 shows a state in which the mesh-shaped lattice point A is moved. In (c) of the example of FIG. 17, in correspondence with the movement of the grid point A in (b), the grid point b before associating is changed to the grid point C already associated.
It shows a state of being equally divided between and.

FIG. 18 shows another mesh shape example of the present invention. Here, the dotted line represents the planar mesh shape, and the solid line represents the original shape. This is a plane mesh shape that is close to the shape of the original shape and that accommodates the original shape. As described above, the mesh shape is not limited to the planar mesh shape of FIG. 3, the curved surface mesh shape of FIG. 4, and the three-dimensional mesh shape of FIG. 5 described above, and an approximate mesh shape including the original shape is generated. I am trying. Then, by obtaining the coordinate value of the corresponding original shape with respect to the mesh-shaped lattice point that is approximated to the original shape and setting it as the coordinate value of the lattice point, the number of faces and the number of lattice points that are extremely close to the original shape are obtained. It becomes possible to generate a mesh shape after conversion.

[0067]

As described above, according to the present invention,
Generate the deformed mesh shapes by deforming the grid points of the mesh shape to the coordinate values of the points associated with the original shape, and perform the operation between the deformed mesh shapes with the same number of faces and the same number of grid points. Since the configuration for generating one new shape is adopted, it becomes possible to easily perform shape deformation even between shapes having different numbers of faces and vertices (number of lattice points).

[Brief description of drawings]

FIG. 1 is an explanatory diagram of an embodiment of the present invention.

FIG. 2 is an explanatory view of a specific example of the present invention.

FIG. 3 is a diagram (Part 1) for explaining a specific example of the present invention.

FIG. 4 is a specific example explanatory view (No. 2) of the present invention.

FIG. 5 is a diagram (part 3) for explaining a specific example of the present invention.

FIG. 6 is an explanatory view of another embodiment of the present invention.

FIG. 7 is an explanatory diagram of another embodiment of the present invention.

FIG. 8 is an explanatory diagram of another embodiment of the present invention.

FIG. 9 is an explanatory diagram of another embodiment of the present invention.

FIG. 10 is an explanatory diagram of a concentration sphere of the present invention.

FIG. 11 is an explanatory diagram of another embodiment of the present invention.

FIG. 12 is a flowchart for explaining the operation of another embodiment of the present invention.

FIG. 13 is an explanatory diagram of another embodiment of the present invention.

FIG. 14 is an explanatory diagram of another embodiment of the present invention.

FIG. 15 is an explanatory diagram of another embodiment of the present invention.

FIG. 16 is an explanatory diagram of another embodiment of the present invention.

FIG. 17 is an explanatory diagram of another embodiment of the present invention.

FIG. 18 is another mesh shape example of the present invention.

FIG. 19 is an explanatory diagram of a conventional technique.

[Explanation of symbols]

 1: Original shape reading means 2: Mesh shape reading means 21: Mesh shape selecting means 22: Mesh square selecting means 23: Mesh dividing means 24: Mesh converting means 25: Mesh / density sphere shape reading means 26: Density sphere parameter setting means 27: associating means 28: associating instruction means 29: lattice point associated moving means 3: associating means 4: deforming means 5: animation means

Claims (10)

[Claims] 1. An associating unit for associating the same mesh shape with each of a plurality of original shapes, and a deformed mesh obtained by transforming grid points of the mesh shape into coordinate values of the associated points of the original shape. Morphing edit characterized by including a deforming means for generating each shape and a means for performing a calculation between a plurality of deformed mesh shapes having the same number of faces and the same number of grid points to generate one new shape. apparatus. 2. The morphing editing apparatus according to claim 1, wherein the associating means interactively associates the mesh-shaped lattice points with the feature points of the original shape. 3. The mesh points of the mesh shape and the feature points of the original shape are interactively associated with each other, and the grid points that have not been associated are interpolated based on the associated grid points. The morphing editing apparatus according to claim 1, wherein: 4. The associating means and the deforming means connect a grid point of the mesh shape and a base point in the original shape with a line segment, obtain a coordinate value of an intersection point where the line segment intersects with the original shape, and calculate the coordinate value. The morphing editing apparatus according to claim 1, wherein the coordinate values of the lattice points are used to generate the deformed mesh shape. 5. The morphing editing apparatus according to claim 1, wherein the mesh shape is a plane mesh shape. 6. The morphing editing apparatus according to claim 1, wherein the mesh shape is a curved mesh shape. 7. The morphing editing apparatus according to claim 1, wherein the mesh shape is a three-dimensional mesh shape. 8. The morphing editing apparatus according to claim 1, further comprising means for preparing a plurality of the mesh shapes in advance and selecting the mesh shapes in accordance with the shape of the original shape. 9. A means for dividing the mesh shape when the distance on the original shape when the mesh shape is designated or the lattice points of the mesh shape are associated with the original shape is equal to or more than a threshold value. 9. The morphing editing apparatus according to claim 1, wherein the morphing editing apparatus is a morphing editing apparatus. 10. A density sphere is placed at the mesh-shaped grid point, and the density sphere moved to the deformed mesh-shaped grid point is calculated with an adjacent density sphere. The morphing editing device according to any one of claims 1 to 9.