专利快速检索-快速检索全球专利，免费商用专利数据库-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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式