专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明公开

EP1589488A2 Method, computer program product and data structure for representing two- or three-dimensional object 审中-公开
标题翻译：一种方法，计算机程序产品和数据结构用于映射的二维或三维对象
公开(公告)号：EP1589488A2
公开(公告)日：2005-10-26
申请号：EP05008996.0
申请日：2005-04-25
申请人： Nihon Soar Co., Ltd. , Susumu Furukawa
发明人： Furukawa, Susumu , Shimizu, Seiji , Mukai, Shinji , Hara, Yutaka , Monma, Hroko , Fukushima, Mamoru
IPC分类号： G06T17/20
CPC分类号： G06T17/20
摘要： A method for two- or three-dimensional object modelling is disclosed. A data structure for a graph, which is composed by points and line segments connecting adjacent pairs of the points, respectively, of a two- or three-dimensional object comprises a set of point data of the individual points, each of the point data of the points consists of a clockwise or counter clockwise circular ordered adjacency list written in storage areas of a storage medium individually allocated to the point. The adjacency list describes a plurality of adjacent points associated with the point sequentially according to a circular adjacency order as viewed from outside of the graph with address pointers to the storage areas allocated to the adjacent points, respectively, and location pointers associated with the address pointers, respectively, to storage locations of adjacency lists of the adjacent points, respectively, where an address pointer of the point is written.
摘要翻译：一种用于二维或三维物体建模方法是游离缺失盘。这是由点和线段连接相邻的一对点，分别二维或三维物体的构成的数据结构的图，在所有包括一组各个点的点数据，每个数据点的 besteht顺时针或逆时针圆形的点有序写在分别分配给点的存储介质的存储区域邻接表。邻接表描述了与点按顺序雅丁于圆形邻接订单相关联的相邻的点上的多个从图的外侧与该地址指针相关联的地址指针，以分别分配给相邻的点，存储区，和位置指针观看分别与相邻的点的邻接表的存储位置，分别，其中，以解决该点的指针被写入。

2. 发明公开

EP1589488A3 Method, computer program product and data structure for representing two- or three-dimensional object 审中-公开
标题翻译：一种方法，计算机程序产品和数据结构用于映射的二维或三维对象
公开(公告)号：EP1589488A3
公开(公告)日：2008-02-20
申请号：EP05008996.0
申请日：2005-04-25
申请人： Nihon Soar Co., Ltd. , Susumu Furukawa
发明人： Furukawa, Susumu , Shimizu, Seiji , Mukai, Shinji , Hara, Yutaka , Monma, Hroko , Fukushima, Mamoru
IPC分类号： G06T17/20
CPC分类号： G06T17/20
摘要： A method for two- or three-dimensional object modelling is disclosed. A data structure for a graph, which is composed by points and line segments connecting adjacent pairs of the points, respectively, of a two- or three-dimensional object comprises a set of point data of the individual points, each of the point data of the points consists of a clockwise or counter clockwise circular ordered adjacency list written in storage areas of a storage medium individually allocated to the point. The adjacency list describes a plurality of adjacent points associated with the point sequentially according to a circular adjacency order as viewed from outside of the graph with address pointers to the storage areas allocated to the adjacent points, respectively, and location pointers associated with the address pointers, respectively, to storage locations of adjacency lists of the adjacent points, respectively, where an address pointer of the point is written.

3. 发明专利

JP2006114007A Data structure, program, and recording medium for recording data on two- and three-dimensional graphs in computer memory 审中-公开
标题翻译：用于在计算机存储器中记录两维和三维图形数据的数据结构，程序和记录介质
公开(公告)号：JP2006114007A
公开(公告)日：2006-04-27
申请号：JP2005119946
申请日：2005-04-18
申请人： Susumu Furukawa , Meiko:Kk , Nihon Soar Co Ltd , 進古川 , 日本ソアー株式会社 , 株式会社メイコー
发明人： FURUKAWA SUSUMU , SHIMIZU SEIJI , MUKAI SHINJI , HARA YUTAKA , MONMA HIROKO , FUKUSHIMA MAMORU
IPC分类号： G06F17/50
摘要： PROBLEM TO BE SOLVED: To provide a data structure which records data on a two- or three-dimensional graph unifiedly, has a small amount of data, and excellent processing efficiency and a program for reading and writing the data structure. SOLUTION: The data structure can express the graph by constituting graph data with a collection of point data only holding information necessary for expressing a graph at each point which consists the graph as an end point of a geometrical line expressing the graph. The point data at each point constituting the graph comprise addresses of point data areas of a plurality of adjacent points connected with the points and line segments recorded in order according to a prescribed rule in the data area and numerical values for showing in what order the address at each point is recorded in each point data area of the adjacent points according to the prescribed rule. The point data can have a variety of attributes and history information. The program for realizing this comprises programs (functions) for inputting and outputting the respective point data according to the specific rule. COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供统一地记录二维或三维图上数据的数据结构，具有少量数据和优异的处理效率以及用于读取和写入数据结构的程序。解决方案：数据结构可以通过构成图形数据来形成图形数据，其中仅包含点数据的集合，其中保存了将图形作为表示图形的几何线的终点的每个点处表达图形所必需的信息。构成曲线图的每个点处的点数据包括与根据数据区域中的规定规则按顺序记录的点和线段连接的多个相邻点的点数据区域的地址和用于以什么顺序显示地址的数值根据规定的规则，在各点记录在相邻点的各点数据区域。点数据可以具有各种属性和历史信息。用于实现这一点的程序包括用于根据特定规则输入和输出各个点数据的程序（功能）。版权所有（C）2006，JPO＆NCIPI

4. 发明专利

JP2006167001A Footprint analyzing apparatus 有权
标题翻译： FOOTPRINT分析仪器
公开(公告)号：JP2006167001A
公开(公告)日：2006-06-29
申请号：JP2004360534
申请日：2004-12-13
申请人： Susumu Furukawa , Nihon Soar Co Ltd , Hisashi Sato , 久佐藤 , 進古川 , 日本ソアー株式会社
发明人： FURUKAWA SUSUMU , MIYAO KAZUHISA , FUJITA RIE , SATO HISASHI , HATANO YOSHIAKI
IPC分类号： A61B5/11 , A61H1/02
摘要： PROBLEM TO BE SOLVED: To provide a footprint analyzing apparatus capable of analyzing image data obtained by directly picking up the image of the footprints of two or more steps. SOLUTION: The footprint analyzing apparatus comprises: long-length footprint recording paper spread on a floor for recording the footprints of a walker; an image read means for reading the footprints recorded on the recording paper; a recording paper carrying means mounted on the image read means for carrying the recording paper in a prescribed direction and at a prescribed speed; and an image analysis means for accumulating image data outputted from the image read means, making them into a data base and analyzing them. COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供一种能够分析通过直接拾取两个或多个步骤的脚印的图像而获得的图像数据的足迹分析装置。解决方案：足迹分析装置包括：长度足迹记录纸铺展在地板上，用于记录步行者的脚印; 用于读取记录在记录纸上的印迹的图像读取装置; 记录纸承载装置，安装在图像读取装置上，用于沿预定方向和规定速度运送记录纸; 以及图像分析装置，用于累积从图像读取装置输出的图像数据，使其成为数据库并进行分析。版权所有（C）2006，JPO＆NCIPI

5. 发明授权

US07557803B2 Method, computer program product and data structure for representing two- or three-dimensional object modeling 失效
标题翻译：方法，用于表示二维或三维对象建模的计算机程序产品和数据结构
公开(公告)号：US07557803B2
公开(公告)日：2009-07-07
申请号：US11113130
申请日：2005-04-25
申请人： Susumu Furukawa , Seiji Shimizu , Shinji Mukai , Yutaka Hara , Hroko Monma , Mamoru Fukushima
发明人： Susumu Furukawa , Seiji Shimizu , Shinji Mukai , Yutaka Hara , Hroko Monma , Mamoru Fukushima
IPC分类号： G06F17/00 , G06T1/00 , G06T15/00 , G06T17/00
CPC分类号： G06T17/20
摘要： A data structure for a graph, which is composed by points and line segments connecting adjacent pairs of the points, respectively, of a two- or three-dimensional object comprises a set of point data of the individual points, each of the point data of the points consists of a clockwise or counter clockwise circular ordered adjacency list written in storage areas of a storage medium individually allocated to the point. The adjacency list describes a plurality of adjacent points associated with the point sequentially according to a circular adjacency order as viewed from outside of the graph with address pointers to the storage areas allocated to the adjacent points, respectively, and location pointers associated with the address pointers, respectively, to storage locations of adjacency lists of the adjacent points, respectively, where an address pointer of the point is written.
摘要翻译：图形的数据结构由分别连接相邻的两点或三维对象对的点和线段组成，包括各个点的点数据集合，每个点数据的点数据这些点由顺序或逆时针圆形的顺序相邻列表组成，写入到分配给该点的存储介质的存储区域中。相邻列表分别根据从图的外部依次循环相邻顺序与点对应的多个相邻点，分别具有分配给相邻点的存储区域的地址指针，以及与地址指针相关联的位置指针分别分别到写入点的地址指针的相邻点的相邻列表的存储位置。

6. 发明授权

US5366978A Treatment for Kawasaki disease 失效
标题翻译：治疗川崎病
公开(公告)号：US5366978A
公开(公告)日：1994-11-22
申请号：US145137
申请日：1993-11-03
申请人： Susumu Furukawa , Tomoyo Matsubara
发明人： Susumu Furukawa , Tomoyo Matsubara
IPC分类号： A61K31/52
CPC分类号： A61K31/52
摘要： Disclosed herein is a treatment for Kawasaki disease, which comprises administering a xanthine derivative represented by the general formula (1): ##STR1## wherein at least one of R.sup.1, R.sup.2 and R.sup.3 means a group expressed by CH.sub.3 CO(CH.sub.2).sub.n --, in which n stands for a number of 1-5, and the remaining groups denote individually an alkyl group having 1-6 carbon atoms. The treatment can prevent the development of coronary lesions, which is the greatest problem of Kawasaki disease.
摘要翻译：本文公开了川崎病的治疗方法，其包括给予由通式（1）表示的黄嘌呤衍生物：其中R 1，R 2和R 3中的至少一个表示由CH 3 CO（CH 2）n表示的基团 - ，其中n代表1-5，其余的基团分别表示具有1-6个碳原子的烷基。治疗可以预防冠状动脉病变的发展，这是川崎病的最大问题。

7. 发明申请

US20060010141A1 Method, computer program product and data structure for representing two- or three-dimensional object modeling 失效
公开(公告)号：US20060010141A1
公开(公告)日：2006-01-12
申请号：US11113130
申请日：2005-04-25
申请人： Susumu Furukawa , Seiji Shimizu , Shinji Mukai , Yutaka Hara , Hiroko Monma , Mamoru Fukushima
发明人： Susumu Furukawa , Seiji Shimizu , Shinji Mukai , Yutaka Hara , Hiroko Monma , Mamoru Fukushima
IPC分类号： G06F17/00
CPC分类号： G06T17/20
摘要： A data structure for a graph, which is composed by points and line segments connecting adjacent pairs of the points, respectively, of a two- or three-dimensional object comprises a set of point data of the individual points, each of the point data of the points consists of a clockwise or counter clockwise circular ordered adjacency list written in storage areas of a storage medium individually allocated to the point. The adjacency list describes a plurality of adjacent points associated with the point sequentially according to a circular adjacency order as viewed from outside of the graph with address pointers to the storage areas allocated to the adjacent points, respectively, and location pointers associated with the address pointers, respectively, to storage locations of adjacency lists of the adjacent points, respectively, where an address pointer of the point is written.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式