会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Method and program for generating volume data from boundary representation data
    • 用于从边界表示数据生成卷数据的方法和程序
    • US07372460B2
    • 2008-05-13
    • US10595047
    • 2004-07-14
    • Shugo UsamiKiwamu KaseYu-ichiro TeradaHiroshi Yagi
    • Shugo UsamiKiwamu KaseYu-ichiro TeradaHiroshi Yagi
    • G06T17/00
    • G06T17/20G06F17/5018Y02T10/82
    • A data input means inputs boundary data of an object to a computer, a data converting means converts the boundary data into a triangle patch having a phase, an associating means divides a space into rectangular parallelepiped cells having boundary planes intersecting perpendicularly and associates the cell with a triangle to be included in the cell, a dividing/arranging means divides a triangle patch having a phase and floating in the space at cell faces and keeps all triangles arranged within and on the boundaries of cells, a ridge line integrating means integrates ridges that do not alter the phase, a cell assigning means assigns each triangle and its vertex to a cell with reference to index data of the vertex, and a labeling means sets an attribute value of each cell.
    • 数据输入装置将对象的边界数据输入到计算机,数据转换装置将边界数据转换为具有相位的三角形块,关联装置将空间分成具有垂直相交的边界平面的长方体,并将该单元与 要包括在单元格中的三角形,分割/排列装置将具有相位的三角形补片分隔成在单元面处的空间中,并且将所有三角形排列在单元的边界内和边界上,脊线积分装置将脊 不改变相位,单元分配装置参考顶点的索引数据将每个三角形及其顶点分配给单元,并且标记装置设置每个单元的属性值。
    • 12. 发明授权
    • Method and program for determing intersection point of triangle with line segment
    • 用于确定三角形与线段交点的方法和程序
    • US07187390B2
    • 2007-03-06
    • US10537160
    • 2003-12-05
    • Shugo UsamiKiwamu Kase
    • Shugo UsamiKiwamu Kase
    • G09G5/00
    • G06T19/00G06T15/06G06T2210/21
    • A coordinate system R is set in which P0 is a coordinate origin, P0P1 conforms to a first U axis to have a unit length, P0P2 conforms to a second V axis to have a unit length, and P0P1×P0P2 is a unit vector conforming to a third N axis. A transforming matrix M that transforms an ordinary coordinate system into the coordinate system R and the u-, v- and n-coordinate values of the both ends of the line segment are calculated. It is determined whether or not the line segment intersects with the triangle, on the basis of the u-, v- and n-coordinate values. The u-, and v-coordinate values of the intersection point are calculated. It is determined whether or not the intersection point is positioned inside the triangle, on the basis of the u-, and v-coordinate values of the intersection point.
    • 设置坐标系R,其中P 0 是坐标原点,P <0> P <1> 符合第一U轴以具有单位 长度,P 2 2 符合第二V轴以具有单位长度,并且P <0> P 1 x 2 P <2>是符合第三个N轴的单位向量。 计算将普通坐标系变换为坐标系R的变换矩阵M,并且计算线段的两端的u,v和n坐标值。 根据u-,v-和n-坐标值,确定线段是否与三角形相交。 计算交点的u坐标值和v坐标值。 基于交点的u坐标值和v坐标值,确定交点是否位于三角形内。
    • 13. 发明申请
    • METHOD AND PROGRAM FOR GENERATING BOUNDARY SURFACE INFORMATION
    • 用于生成边界表面信息的方法和程序
    • US20090040217A1
    • 2009-02-12
    • US11817176
    • 2006-03-02
    • Kiwamu KaseYoshinori TeshimaYutaka Otake
    • Kiwamu KaseYoshinori TeshimaYutaka Otake
    • G06T17/00
    • G06F17/5018G06T17/10
    • A method includes: an input step of inputting boundary surface information 11 on an object to a computer using the computer; a grid sampling step of determining cutting points 13 where the boundary surface cuts across edges of a predetermined rectangular parallelepiped grid 12 and normal vectors 14 of the boundary surface at the cutting points, and storing them in a storage unit as primary data 15; a D-polyhedron data generation step of connecting adjacent cutting points with a line segment to form a triangle one by one for generating D-polyhedron data 16 constituted of triangles only; and a V-polyhedron data generation step of generating V-polyhedron data 17 constituted of intersections of a plurality of infinite planes passing through the cutting points and whose normals coincide with the normal vectors. Any one of the D-polyhedron data and the V-polyhedron data is generated from the primary data 15, and the other is generated as a dual.
    • 一种方法包括:输入步骤,使用所述计算机将物体上的边界面信息11输入到计算机; 确定切割点13的网格采样步骤,其中边界表面切割预定长方体网格12的边缘和切割点处边界表面的法向矢量14,并将它们存储在作为主数据15的存储单元中; 将相邻切割点与线段连接形成三角形的D多面体数据生成步骤,用于生成仅由三角形构成的D多面体数据16; 以及V多面体数据生成步骤,生成由穿过切割点的多个无限平面的交点构成的V多面体数据17,其法线与法线矢量一致。 从主数据15生成D多面体数据和V多面体数据中的任何一个,另一个生成为双重数据。
    • 14. 发明授权
    • Method and program for generating boundary surface information
    • 生成边界面信息的方法和程序
    • US08013855B2
    • 2011-09-06
    • US11817176
    • 2006-03-02
    • Kiwamu KaseYoshinori TeshimaYutaka Otake
    • Kiwamu KaseYoshinori TeshimaYutaka Otake
    • G06T15/30
    • G06F17/5018G06T17/10
    • A method includes: an input step of inputting boundary surface information 11 on an object to a computer using the computer; a grid sampling step of determining cutting points 13 where the boundary surface cuts across edges of a predetermined rectangular parallelepiped grid 12 and normal vectors 14 of the boundary surface at the cutting points, and storing them in a storage unit as primary data 15; a D-polyhedron data generation step of connecting adjacent cutting points with a line segment to form a triangle one by one for generating D-polyhedron data 16 constituted of triangles only; and a V-polyhedron data generation step of generating V-polyhedron data 17 constituted of intersections of a plurality of infinite planes passing through the cutting points and whose normals coincide with the normal vectors. Any one of the D-polyhedron data and the V-polyhedron data is generated from the primary data 15, and the other is generated as a dual.
    • 一种方法包括:输入步骤,使用所述计算机将物体上的边界面信息11输入到计算机; 确定切割点13的网格采样步骤,其中边界表面切割预定长方体网格12的边缘和切割点处边界表面的法向矢量14,并将它们存储在作为主数据15的存储单元中; 将相邻切割点与线段连接形成三角形的D多面体数据生成步骤,用于生成仅由三角形构成的D多面体数据16; 以及V多面体数据生成步骤,生成由穿过切割点的多个无限平面的交点构成的V多面体数据17,其法线与法线矢量一致。 从主数据15生成D多面体数据和V多面体数据中的任何一个,另一个生成为双重数据。
    • 16. 发明申请
    • Method and program for labeling multi material data
    • 多材料数据标签的方法和程序
    • US20060267974A1
    • 2006-11-30
    • US10553602
    • 2004-05-10
    • Masaya KatoKiwamu KaseTomonori Yamada
    • Masaya KatoKiwamu KaseTomonori Yamada
    • G06T15/00
    • G06F17/5018
    • The present invention includes an external data acquisition step (S1), an external data input step (A), a cell division step (B), a cell classification step (C), a space classification step (D), a simulation step (S3), and an output step (S4). The cell classification step (C) includes a step of further classifying each of the boundary cells (13a) into a first type cell and a second type cell. The first type cell has a cutting point at which an edge line or vertex is cut by the boundary data. The second type cell has a cutting point that lies on a boundary with another cell of different hierarchy, and is larger than the another cell. The cell classification step (C) further includes a step of assigning a material number to each cell vertex.
    • 本发明包括外部数据获取步骤(S1),外部数据输入步骤(A),单元划分步骤(B),单元分类步骤(C),空间分类步骤(D),模拟步骤 (S 3)和输出步骤(S 4)。 细胞分类步骤(C)包括将每个边界细胞(13a)进一步分类为第一类型细胞和第二类型细胞的步骤。 第一类型单元具有边界线或顶点被边界数据切割的切割点。 第二类型单元具有位于与不同层次的另一单元格的边界上的切割点,并且大于另一单元格。 细胞分类步骤(C)还包括向每个细胞顶点分配材料编号的步骤。
    • 18. 发明授权
    • Method and program for labeling multi material data
    • 多材料数据标签的方法和程序
    • US07620528B2
    • 2009-11-17
    • US10553602
    • 2004-05-10
    • Masaya KatoKiwamu KaseTomonori Yamada
    • Masaya KatoKiwamu KaseTomonori Yamada
    • G06F7/60G06F17/00G06G7/48G06T15/00
    • G06F17/5018
    • The present invention includes an external data acquisition step (S1), an external data input step (A), a cell division step (B), a cell classification step (C), a space classification step (D), a simulation step (S3), and an output step (S4). The cell classification step (C) includes a step of further classifying each of the boundary cells (13a) into a first type cell and a second type cell. The first type cell has a cutting point at which an edge line or vertex is cut by the boundary data. The second type cell has a cutting point that lies on a boundary with another cell of different hierarchy, and is larger than the another cell. The cell classification step (C) further includes a step of assigning a material number to each cell vertex.
    • 本发明包括外部数据获取步骤(S1),外部数据输入步骤(A),单元划分步骤(B),单元分类步骤(C),空间分类步骤(D),模拟步骤 S3)和输出步骤(S4)。 细胞分类步骤(C)包括将每个边界细胞(13a)进一步分类为第一类型细胞和第二类型细胞的步骤。 第一类型单元具有边界线或顶点被边界数据切割的切割点。 第二类型单元具有位于与不同层级的另一单元格的边界上的切割点,并且大于另一单元格。 细胞分类步骤(C)还包括向每个细胞顶点分配材料编号的步骤。
    • 19. 发明授权
    • Process for producing colored shaped article from curable resin, colored shaped article produced from curable resin, and shaping apparatus
    • 由固化树脂制造着色成形制品的方法,由可固化树脂制成的着色成形制品和成型装置
    • US07074354B2
    • 2006-07-11
    • US10089327
    • 2001-07-26
    • Katsuyuki WatanabeKoji NakajimaKenji YamazawaMasahiro AnzaiKiwamu Kase
    • Katsuyuki WatanabeKoji NakajimaKenji YamazawaMasahiro AnzaiKiwamu Kase
    • B29C41/22
    • B29C64/135B29K2995/0073Y10T428/24901
    • In coloration of a shaped article composed of a curable resin, the addition operation can be reliably conducted and a reliable coloration effect can be obtained in both the single-color addition and in the multicolor addition. A liquid-phase, non-colored photo-curable resin is cured by irradiation with laser light and a lowermost layer 5n is formed. A liquid-phase, photo-curable resin is applied on the upper surface thereof and a colored layer 5n-1 comprising a cured non-colored region and a liquid-phase pool region is formed. A color ink is drop-wise added to the liquid-phase pool region. The pool region is irradiated with laser light and cured to the same hardness as that of the non-colored region. A block-like coating film having the prescribed thickness if formed from the surface coating film produced by the color ink covering the pool region. As a result, the formation of the next layer (colored layer 5n-2) on the upper surface of colored layer 5n-1 can be conducted without obstacles. Colored layer 5n-2 through colored layer 53 are formed by repeating this process, a colored layer 52 is formed on the upper surface of colored layer 53, and then the uppermost layer 51 is formed on the colored layer 52.
    • 在由可固化树脂组成的成形制品的着色中,可以可靠地进行添加操作,并且在单色添加和多色添加两者中都可以获得可靠的着色效果。 通过照射激光使液相,无色光固化树脂固化,形成最下层5。 在其上表面上涂布液相光固化树脂,形成包含固化的无色区域和液相池区域的着色层5 N-1。 彩色油墨逐滴加入液相池区域。 池区域用激光照射并固化至与非着色区域相同的硬度。 如果由覆盖池区域的彩色油墨制成的表面涂膜形成具有规定厚度的块状涂膜。 结果,可以在没有障碍物的情况下,在着色层5的上表面上形成下一层(着色层5N-2-N)。 通过重复该方法形成着色层5 通过着色层5 3 <3>,在上表面上形成着色层5&lt; 2&lt; 的着色层5 3上,然后在着色层5上形成最上层5&lt; 1&gt; 1&lt; 1&gt;。
    • 20. 发明授权
    • Method for evaluating error in shape of free curved surface
    • 评估自由曲面形状误差的方法
    • US06711530B1
    • 2004-03-23
    • US09529663
    • 2000-04-18
    • Kiwamu Kase
    • Kiwamu Kase
    • G06F1750
    • G01B21/20G06T17/30
    • An original curved surface S is divided into up to six curved surface units by combinations of signs (+, 0, −) of a principal curvature (k1, k2) in each point on the curved surface. A distorted curved surface S′ is associated with the original curved surface S and divided into curved surface units having the same boundary. An average normal vector is obtained for each curved surface unit with respect to the original curved surface and the distorted curved surface. “A bent component” and “a twisted component” in all the combinations of pairs of different curved surface units are obtained with respect to the original curved surface and the distorted curved surface. A difference between “the bent component” and “the twisted component” in each combination in the original curved surface and “the bent component” and “the twisted component” in each identical combination in the distorted curved surface is calculated.
    • 原曲面S通过弯曲表面各点的主曲率(k1,k2)的符号(+,0, - )的组合分成多达六个曲面单位。 弯曲曲面S'与原始曲面S相关联,并被划分成具有相同边界的曲面单元。 对于每个弯曲表面单元相对于原始曲面和失真曲面获得平均法向量。 相对于原始弯曲表面和扭曲曲面获得了不同曲面单元对的所有组合中的“弯曲部件”和“扭曲部件”。 计算出原曲面各组合中的“弯曲成分”和“扭曲成分”与失真曲面中的每个相同组合中的“弯曲成分”和“扭曲成分”的差别。