JP4005352B2 - 3D shape processing apparatus and curved surface interpolation program - Google Patents

3D shape processing apparatus and curved surface interpolation program Download PDF

Info

Publication number
JP4005352B2
JP4005352B2 JP2001382182A JP2001382182A JP4005352B2 JP 4005352 B2 JP4005352 B2 JP 4005352B2 JP 2001382182 A JP2001382182 A JP 2001382182A JP 2001382182 A JP2001382182 A JP 2001382182A JP 4005352 B2 JP4005352 B2 JP 4005352B2
Authority
JP
Japan
Prior art keywords
curved
boundary
gonal
curve
line segment
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
JP2001382182A
Other languages
Japanese (ja)
Other versions
JP2003186925A (en
Inventor
喜政 徳山
Original Assignee
株式会社リコー
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社リコー filed Critical 株式会社リコー
Priority to JP2001382182A priority Critical patent/JP4005352B2/en
Publication of JP2003186925A publication Critical patent/JP2003186925A/en
Application granted granted Critical
Publication of JP4005352B2 publication Critical patent/JP4005352B2/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a technique for interpolating a curved surface in an N-gonal area implemented in an information processing apparatus such as a dedicated three-dimensional shape processing apparatus or a personal computer, and in particular, generates a curved surface that can be neatly inserted into the N-gonal area It relates to a curved surface interpolation technique.
[0002]
[Prior art]
Conventionally, in a 3D shape processing apparatus such as a CAD / CAM device using a graphics display device and a computer, a 3D solid shape is generated, the generated 3D solid shape is deformed, and various other Processing is in progress. The three-dimensional solid shape refers to, for example, a shape generated as solid model data in a boundary representation format. The solid model in the boundary representation format is defined in a three-dimensional space by elements such as edges, vertices, and faces. It defines a closed area and expresses a solid solid.
The present invention relates to curved surface generation, which is one of the three-dimensional shape processing conventionally performed in such a three-dimensional shape processing apparatus, and more specifically, is configured using a plurality of B-spline curves. The present invention relates to an interpolation curved surface generation method for smoothly interpolating an interpolation curved surface generated by a curved curve mesh so that there is no overlap or gap between curved surfaces.
As a conventional technique in such a field, there is a free-form surface interpolation method using, for example, a Gregory patch. In this prior art, a cross-boundary derivative is specified, and the shape of the curved surface is deformed by using this, and the curved surfaces are connected to each other or the curved surface is interpolated. In addition, a method of generating a smooth curved surface shape using a rational boundary Gregory patch is also known.
For example, the free-form surface generation method disclosed in Japanese Patent Laid-Open No. 7-282117 is one of the conventional techniques as described above, and when generating two curved surfaces having a rational B-spline curve as a common boundary, the boundary is generated. Determine the continuity at the boundary from the curve and the curve connected to the boundary curve, obtain the connection condition at the boundary from the continuity, and generate the internal control points of the surface from the obtained connection condition, then free two adjacent sheets Connect curved shapes smoothly.
In the method of generating a curved surface using a curved mesh, for example, according to the technique described in “Hiroshi Toritani, Hiroaki Chiyokura, Basics and Applications of 3D CAD, 1991.”, N square regions are divided into N quadrilaterals. Interpolate at the face.
[0003]
[Problems to be solved by the invention]
However, the free curved surface generation method disclosed in Japanese Patent Laid-Open No. 7-282117 has a problem that a curved surface that cannot be used as an interpolation curved surface is generated in order to realize a smooth connection. In the method of generating a curved surface using the curved mesh described above, as shown in FIG. 14, when the lengths of a plurality of boundary curves (curve representing the boundary of the curved surface) of the N-gonal region A are extremely different, Since the curve C (referred to as an internal curve) other than the boundary curve of the N-shaped area of the interpolated surface tends to swell, the interpolated curved surfaces may swell or the curved surfaces may interfere with each other.
There is also a problem that an interpolation curved surface cannot be generated when there are no continuous vertices constituting the N-gonal region or when there is only one vertex. For example, a curved surface cannot be interpolated in a circular area.
An object of the present invention is to solve such a problem of the prior art. Specifically, by generating a single B-spline curved surface that covers the N-gonal region, it is possible to clean the N-gonal region. Another object of the present invention is to provide a curved surface interpolation method capable of generating a curved surface that can be interpolated into a curved surface.
[0004]
[Means for Solving the Problems]
In order to solve the above-mentioned problem, in the invention according to claim 1, in the three-dimensional shape processing apparatus capable of interpolating a curved surface in an N-gonal region, four boundary planes representing the range of the curved surface region to be interpolated A plane determining means for determining a line segment, a line segment generating means for generating a line segment drawn from a plurality of points on each boundary curve of the N-gonal region to the surrounding boundary plane, and the boundary plane belonging to the line segment. And a boundary curve generating means for generating a boundary curve of a curved surface to be interpolated into an N-gonal region from an intersection of the line segment and its boundary plane, and a curved surface to be interpolated from the boundary curve and each point on each of the line segments An interpolation curved surface generating means for generating is provided.
According to a second aspect of the present invention, in a curved surface interpolation program for interpolating a curved surface in an N-gonal region, four boundary planes representing the range of the curved surface region to be interpolated are determined, and each boundary of the N-gonal region is determined. A line segment drawn from a plurality of points on the curve to the surrounding boundary plane is generated, the boundary plane belonging to the line segment is determined, and interpolation is performed from the intersection of the line segment and the boundary plane to an N-gonal region A boundary curve of a curved surface is generated, and a curved surface that is interpolated from the boundary curve and each point on each line segment is generated.
Further, in the invention described in claim 3, in the invention described in claim 2, the configuration is such that the sides constituting the N-gonal region are on the curved surface generated within the allowable error range specified by the user. Features.
The invention according to claim 4 is characterized in that, in the invention according to claim 2, the range of the region determined by the four boundary planes is made wider than the N-gonal region.
The invention according to claim 5 is characterized in that, in the invention according to claim 2, the number of sides constituting the N-gonal region is not limited.
The invention described in claim 6 is characterized in that, in the invention described in claim 2, the number of vertices constituting the N square region is not limited.
The invention according to claim 7 is characterized in that the program according to any one of claims 2 to 6 is stored in a storage medium storing the program.
[0005]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
FIG. 1 is a configuration block diagram of a computer system showing an example of a system in which the present invention is implemented. As illustrated, the computer system of this embodiment includes an input unit 1, an output unit 2, a CPU 3, a memory (for example, RAM) 4, a storage unit (for example, a hard disk device) 5, a medium driving unit 6, and the like.
In the above description, the input unit 1 has an input device such as a mouse or a keyboard that accepts an N-gon area displayed on the display device constituting the output unit 2. Note that the N-gon area includes geometric data such as points and curves constituting these shapes, and phase data indicating the correlation between the geometric data.
The output unit 2 is an output unit that reads out and outputs the shape data stored in the storage unit 5 and includes a display device such as a display and an output device such as a printer. The storage unit 5 stores a plurality of shape data and programs indicating the shape of the design object, and the medium driving unit 6 drives a removable storage medium such as a CD-ROM or a floppy disk, for example. The related program is read from the recording medium. In this embodiment, the plane determining means, line segment generating means, boundary curve generating means, and interpolated curved surface generating means described in claim 1 are realized by the memory 4 storing the program and the CPU 3 operating according to the program. Is done.
With such a configuration, in this embodiment, according to the program, first, the CPU 3 displays the target three-dimensional shape model on the display device, causes the user to designate the N-gonal area, and sets the designated N-gonal area to the designated N-gonal area. The related data is acquired, and the data is stored in the storage unit 5. For example, in FIG. 2, the triangular area A generated by rounding the target ridgeline with different rounding radii is an N-gonal area (the curved surface generated by the rounding process has been subjected to the processing). It may not be in smooth contact with the original surface). The user designates such an N-shaped area and one side to be operated with a mouse or the like. When the N-gonal area and one side in FIG. 2 are selected by clicking with a mouse or the like, one boundary curve of the finally generated B-spline curved surface becomes substantially parallel to the designated side.
[0006]
FIG. 3 shows an operation flow of this embodiment. The operation of this embodiment will be described below with reference to FIG. 3 using the example shown in FIG.
In this embodiment, first, four boundary planes representing the range of the interpolated curved surface area corresponding to the designated N-gonal area are determined (S1). It determines the rough size of the surface you are trying to generate. Therefore, first, the center of the boundary curve row of the N-gonal region and the average normal vector are obtained. Note that the center of the boundary curve row is the coordinate value of the curve control point (a sequence of points between the two end points of the free curve, and the shape of the curve can be expressed by the plurality of control points and the two end points). Is the average value. The average normal vector is obtained by integrating the unit vector of a surface on a smooth arbitrary curved surface bounded by the boundary curve, and the vector obtained as a result of this area depends only on the boundary curve. . Such an average normal vector is calculated by a known method using a boundary curve.
Subsequently, one plane is generated using the center of the boundary curve row and the average normal vector. The origin and normal vector of the plane are the center of the boundary curve sequence and the average normal vector, respectively. Further, a boundary curve sequence is projected onto the plane to generate a projected boundary curve sequence, and a coordinate system is constructed on the plane. The direction of the Z axis of the coordinate system coincides with the direction of the normal vector of the plane. The direction of the X axis is the direction of a vector from the center (the origin) toward the center position of the projection curve on one side of the N-gonal area specified by the user first. The direction of the Y axis is the direction of the outer product vector of the Z axis and the X axis. In this way, a bounding box of the projection curve sequence (boundary box circumscribing the projection curve sequence) in such a coordinate system is obtained. The bounding box is a quadrilateral parallel to the X and Y axes. Note that the bounding box is slightly larger (for example, the length of one side is increased by about 5%). This is because the size of the bounding box affects the size of the finally generated curved surface, and by slightly increasing the size, it becomes easy to insert the curved surface neatly with a desired accuracy in the N-gonal region.
Subsequently, four boundary planes parallel to the Z axis are generated from the bounding box. This is because the four boundary planes are used later when defining the boundary of the B-spline curved surface to be interpolated. FIG. 4 shows the bounding box B when viewed from the Z-axis.
[0007]
Next, a line segment based on the boundary curve of the N-gon area is generated (S2). Therefore, first, a plurality of sampling points are generated on each boundary curve. Note that the number of sampling points is, for example, twice the order of the boundary curve. Then, a vector in a direction crossing the boundary curve at the sampling point is determined. The determination method is, for example, one of the following two methods.
One is a method that uses the boundary derivative of the adjacent surface in the boundary curve of the N-gonal region. According to this method, the connection between the generated interpolation surface and the adjacent surface becomes smoother. The other is a method using the tangent vector of the boundary curve of the N-gonal region, and uses a vector obtained by the outer product of the normal vector at the sampling point of the N-gonal region and the tangent vector of the boundary curve. Note that, at the common point of two boundary curves, the sum vector of unit tangent vectors for each boundary curve at the common point is used. Therefore, a vector can be specified even if two boundary curves are smoothly connected. Then, the intersection of the determined vector and the four boundary planes is obtained, and the line segment determined by the closest intersection and the point on the boundary curve is obtained. The boundary plane having the closest intersection is the boundary plane to which the line segment belongs. These line segments are used later when generating point clouds. FIG. 5 shows the generated line segment group.
[0008]
In the above, when the line segments of all sampling points on the boundary curve do not belong to the same boundary plane, the line segment group and the intersection group are divided into the boundary planes to which they belong, and further, which line segment of the two boundary planes It is necessary to determine the common line segment that also becomes. For example, in the example as shown in FIG. 11, it is necessary to divide the ridgeline (boundary curve).
Therefore, next, as described below, the boundary curve is divided to determine the boundary plane to which the line segment belongs, and the common line segment is obtained (S3).
First, a ruled surface is generated using the boundary curve and the line segment direction, and an intersection line where the ruled surface and two boundary planes intersect is obtained. Then, the boundary curve is divided using the unidirectional parameter (u or v) at the position where the intersecting boundary plane of the intersecting line on the ruled curved surface changes as a boundary curve dividing parameter. Further, an interference point between a straight line on which the line segment at the division point rides and an intersection line between the two boundary planes is obtained, and a line segment determined by the division point and the interference point is set as a common line segment of the two boundary planes. Note that the interference point is not limited to the intersection point, and even when two straight lines are in a twisted position, the point where the straight lines are closest to each other is calculated as the interference point. In this way, finally, the line segments of all sampling points on one boundary curve belong to the same boundary plane.
As apparent from the above description, one end point of each line segment generated in step S2 is a sampling point, and the other end point is a point on the boundary plane. A curve is generated from the end points using the least square method, and the curve is used as a boundary curve of the curved surface (see FIG. 6) (S4). When generating this boundary curve, the point sequence from which the boundary curve is generated must be aligned from the start point to the end point of the curve to be approximated. When there is no boundary curve belonging to a certain boundary plane, a straight line (approximate curve) is generated using the end points of the boundary curves generated on the boundary planes on both sides of the plane. At this time, if the boundary curve for making the end point of the approximate curve does not exist in the adjacent plane, the approximate curve is further extended to the adjacent boundary plane in a tangential direction in a straight line shape.
In the above, the end points of the four boundary curves of the curved surface to be interpolated do not always match. Then, it adjusts so that the position of end points may correspond next.
Finally, a curved surface to be interpolated is generated (S5). A curved surface is generated using the four boundary curves, which are the four boundary curves of the generated curved surface, as constraint conditions. Therefore, first, for each line segment described above, a point group composed of the other end point of the line segment and an intermediate sampling point is obtained. FIG. 7 shows a point group on the generated line segment. As the number of intermediate sampling points increases, the number of control points increases as the shape outside the N-side (N side) area of the curved surface approaches the shape of the surrounding surface, and the processing speed increases. descend. Therefore, in this embodiment, the number of intermediate sampling points is set to 3. However, if each side constituting the N-gonal area does not ride within the tolerance range specified by the user on the interpolation surface generated depending on the number of sampling points, the number of sampling points is Increase the number of control points.
[0009]
Next, a Coons surface of bilinear blend is defined from the four boundary curves. Further, the parameters of the points projected from the points on the curved surface to the boundary curve are set as the initial parameters of the points. Then, an approximate curved surface is generated as a B-spline curved surface by the least square method with the boundary curve as a boundary. FIG. 8 shows the generated curved surface control points (a plurality of points representing the curved surface, which exist substantially along the curved surface). FIG. 9 shows contour lines of a curved surface that is finally generated. Further, as an example of generating a curved surface to be interpolated, the N-gonal region is a triangular region in FIG. 10, a quadrangular region in FIG. 11, a pentagonal region in FIG. 12, and a hexagonal region. An example is shown in FIG. As described above, the curved surface interpolation to the N-gonal area according to the present invention has no limitation on the number of sides constituting the N-gonal area, and no limitation on the number of vertices constituting the N-gonal area.
Finally, the curved surface shape data generated in this way is written into the storage unit 5.
Although one embodiment of the present invention has been described above, a program programmed in accordance with the curved surface interpolation method into the N-gonal area as described above is stored in, for example, a removable storage medium, and the storage medium is used in the present invention so far. By mounting it on an information processing device such as a personal computer that could not perform curved surface interpolation to the N-gonal region, or by transferring such a program to such an information processing device via a network, Also in the information processing apparatus, curved surface interpolation into an N-gonal area according to the present invention can be performed.
[0010]
【The invention's effect】
As described above, according to the present invention, when the curved surface is interpolated into the N-gonal region, the four boundary planes representing the range of the curved surface region to be interpolated are provided. A line segment is generated from a plurality of points on each boundary curve of the N-gonal region to the surrounding boundary plane, a boundary plane belonging to the line segment is determined, and the line segment and the boundary plane are A boundary curve of a curved surface that is interpolated from the intersection point into the N-gonal area is generated, and a curved surface that is interpolated from the boundary curve and each point on each line segment is generated. -A spline curved surface can be generated, whereby the curved surface can be nicely interpolated into an N-gonal region.
Further, in the invention described in claim 3, in the invention described in claim 2, since the sides constituting the N-gonal region are on the curved surface generated within the tolerance range specified by the user, the curved surface is arranged in the N-gonal region. Can be interpolated neatly with the desired accuracy.
Further, in the invention described in claim 4, in the invention described in claim 2, since the range of the region determined by the four boundary planes is wider than the N-gonal region, the curved surface is neatly contained in the N-gonal region with the desired accuracy. It becomes easy to insert.
In the invention according to claim 5, in the invention according to claim 2, since the number of sides constituting the N-gonal area is not limited, the application range of the curved surface interpolation to the N-gonal area becomes wide.
Further, in the invention described in claim 6, in the invention described in claim 2, since the number of vertices constituting the N square area is not limited, similarly, the range of application of curved surface interpolation to the N square area is widened. .
Further, in the invention according to claim 7, since the program according to any one of claims 2 to 6 is stored in, for example, a removable storage medium, the storage medium has been described in claims 2 to 5 so far. When the information processing apparatus is attached to an information processing apparatus such as a personal computer that has not been able to perform curved surface interpolation into the N-gonal area according to any one of the items 6, the information processing apparatus also includes the information processing apparatus according to claim 2. The effect of the invention described in any one of 6 can be obtained.
[Brief description of the drawings]
FIG. 1 is a configuration block diagram of a computer system showing an example of a system in which the present invention is implemented.
FIG. 2 is an explanatory diagram showing an N-gonal region according to an embodiment of the present invention.
FIG. 3 is a flowchart of a curved surface interpolation program showing an embodiment of the present invention.
FIG. 4 is an explanatory diagram of a curved surface interpolation method according to an embodiment of the present invention.
FIG. 5 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 6 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 7 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 8 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 9 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 10 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 11 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 12 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 13 is another explanatory diagram of a curved surface interpolation method showing an embodiment of the present invention.
FIG. 14 is an explanatory diagram of a curved surface interpolation method according to the prior art and the present invention.
[Explanation of symbols]
1 Input unit 2 Output unit 3 CPU
4 Memory 5 Storage unit 6 Medium drive unit

Claims (7)

  1. In a three-dimensional shape processing apparatus capable of interpolating a curved surface in an N-gonal region,
    Plane determining means for determining four boundary planes representing the range of the area of the curved surface to be interpolated, and a line for generating a line segment descending from a plurality of points on each boundary curve of the N-gonal area to the surrounding boundary plane A minute generating means;
    A boundary curve generating means for determining the boundary plane belonging to the line segment and generating a boundary curve of a curved surface to be interpolated from the intersection of the line segment and the boundary plane into an N-gonal region;
    A three-dimensional shape processing apparatus, comprising: an interpolated curved surface generating means for generating a curved surface to be interpolated from the boundary curve and each point on each line segment.
  2. In a curved surface interpolation program for interpolating a curved surface in an N-gonal area, four boundary planes representing the range of the curved surface area to be interpolated are determined, and a plurality of points on each boundary curve of the N-gonal area are Generate a line segment down to the boundary plane, determine the boundary plane to which the line segment belongs, generate a boundary curve of the curved surface that is interpolated into the N-gonal area from the intersection of the line segment and the boundary plane, and A curved surface interpolation program for generating a curved surface to be interpolated from a curve and each point on each line segment.
  3. 3. The curved surface interpolation program according to claim 2, wherein the sides constituting the N-gonal region are on a curved surface generated within an allowable error range specified by the user.
  4. 3. The curved surface interpolation program according to claim 2, wherein the range of the region determined by the four boundary planes is made wider than the N-gonal region.
  5. 3. The curved surface interpolation program according to claim 2, wherein the number of sides constituting the N-gonal area is not limited.
  6. 3. The curved surface interpolation program according to claim 2, wherein the number of vertices constituting the N square region is not limited.
  7. A storage medium storing a program, wherein the program according to any one of claims 2 to 6 is stored.
JP2001382182A 2001-12-14 2001-12-14 3D shape processing apparatus and curved surface interpolation program Expired - Fee Related JP4005352B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2001382182A JP4005352B2 (en) 2001-12-14 2001-12-14 3D shape processing apparatus and curved surface interpolation program

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2001382182A JP4005352B2 (en) 2001-12-14 2001-12-14 3D shape processing apparatus and curved surface interpolation program

Publications (2)

Publication Number Publication Date
JP2003186925A JP2003186925A (en) 2003-07-04
JP4005352B2 true JP4005352B2 (en) 2007-11-07

Family

ID=27592635

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2001382182A Expired - Fee Related JP4005352B2 (en) 2001-12-14 2001-12-14 3D shape processing apparatus and curved surface interpolation program

Country Status (1)

Country Link
JP (1) JP4005352B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014002696A (en) * 2012-06-21 2014-01-09 Toyota Motor Corp Design data generation apparatus and method, and program

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008024869A2 (en) * 2006-08-23 2008-02-28 Mental Images Gmbh Computer graphics methods and systems for generating images with rounded corners

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014002696A (en) * 2012-06-21 2014-01-09 Toyota Motor Corp Design data generation apparatus and method, and program

Also Published As

Publication number Publication date
JP2003186925A (en) 2003-07-04

Similar Documents

Publication Publication Date Title
Ohtake et al. Multi-level partition of unity implicits
Von Herzen et al. Accurate triangulations of deformed, intersecting surfaces
US20200019651A1 (en) Surface patch techniques for computational geometry
Houghton et al. Implementation of a divide-and-conquer method for intersection of parametric surfaces
DE69924700T2 (en) Method for displaying graphic objects represented by surface elements
US6130673A (en) Editing a surface
JP5890105B2 (en) Designing parts modeled by parallel geodesic lines
EP0531157B1 (en) Three dimensional graphics processing
CA2517463C (en) System and method for defining t-spline and t-nurcc surfaces using local refinements
Edmunds et al. Surface-based flow visualization
Biermann et al. Sharp features on multiresolution subdivision surfaces
DE4124564B4 (en) Method and device for generating shaded images
US7034823B2 (en) 3D computer graphics processing apparatus and method
US6100893A (en) Constructing solid models using implicit functions defining connectivity relationships among layers of an object to be modeled
US6943790B2 (en) Dual mesh resampling
Loop et al. Approximating Catmull-Clark subdivision surfaces with bicubic patches
KR101285941B1 (en) Process for creating a parametric surface having a required geometrical continuity
US7236170B2 (en) Wrap deformation using subdivision surfaces
JP5361793B2 (en) A method for reconstructing the swept volume distance field at the sample point.
JP4991423B2 (en) A computer-implemented process for creating parametric surfaces
US7212205B2 (en) Curved surface image processing apparatus and curved surface image processing method
Jun et al. A new curve-based approach to polyhedral machining
DE60026197T2 (en) Detailed hierarchical distance fields in object modeling
JP4563554B2 (en) How to sculpt objects represented as models
US9836884B2 (en) Parameterizing a 3D modeled object for tessellation

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20041104

RD02 Notification of acceptance of power of attorney

Free format text: JAPANESE INTERMEDIATE CODE: A7422

Effective date: 20041109

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20070417

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20070814

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20070823

R150 Certificate of patent or registration of utility model

Free format text: JAPANESE INTERMEDIATE CODE: R150

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100831

Year of fee payment: 3

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100831

Year of fee payment: 3

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110831

Year of fee payment: 4

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110831

Year of fee payment: 4

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120831

Year of fee payment: 5

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120831

Year of fee payment: 5

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20130831

Year of fee payment: 6

LAPS Cancellation because of no payment of annual fees