利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

201 条记录 (耗时 0.042 秒)

    ADVANCED K-D TREE ENCODING FOR POINT CLOUDS BY MOST SIGNIFICANT AXIS SELECTION
    2.
    发明申请
    ADVANCED K-D TREE ENCODING FOR POINT CLOUDS BY MOST SIGNIFICANT AXIS SELECTION 审中-公开

    公开(公告)号：US20180137653A1

    公开(公告)日：2018-05-17

    申请号：US15354683

    申请日：2016-11-17

    申请人： Google Inc.

    发明人： Michael Hemmer ,  Frank Galligan ,  Ondrej Stava

    IPC分类号： G06T9/40 ,  G06T1/60

    CPC分类号： G06T9/40

    摘要： An encoder includes a processor, a buffer, and a memory. The memory includes code as instructions that cause the processor to perform a number of steps. The steps include partitioning a geometric construct within an axis of the geometric construct based on a point differential between two partitions, the geometric construct including geometric data, determining a number of points in the partition, storing a value indicating the number of points in the buffer, and entropy encoding the value stored in the buffer.

    Block-based bounding volume hierarchy
    5.
    发明授权
    Block-based bounding volume hierarchy 有权
    基于块的边界卷层次结构

    公开(公告)号：US09582607B2

    公开(公告)日：2017-02-28

    申请号：US14589904

    申请日：2015-01-05

    申请人： NVIDIA Corporation

    发明人： Samuli Matias Laine ,  Timo Oskari Aila ,  Tero Tapani Karras

    IPC分类号： G06T15/10 ,  G06T15/08 ,  G06F17/30 ,  G06T15/00 ,  G06T15/06 ,  G06T15/80 ,  H04N19/174 ,  H04N19/44 ,  G06T1/60 ,  G06T17/10

    CPC分类号： G06F17/30961 ,  G06F17/30327 ,  G06F17/30563 ,  G06T1/60 ,  G06T9/40 ,  G06T15/005 ,  G06T15/06 ,  G06T15/08 ,  G06T15/10 ,  G06T15/80 ,  G06T17/10 ,  H04N19/174 ,  H04N19/44

    摘要： A system, method, and computer program product for implementing a tree traversal operation for a tree data structure divided into compression blocks is disclosed. The method includes the steps of receiving at least a portion of a tree data structure that represents a tree having a plurality of nodes, pushing a root node of the tree data structure onto a traversal stack data structure associated with an outer loop of a tree traversal operation algorithm, and, for each iteration of an outer loop of a tree traversal operation algorithm, popping a top element from the traversal stack data structure and processing, via an inner loop of the tree traversal operation algorithm, the compression block data structure that corresponds with the top element. The tree data structure may be encoded as a plurality of compression block data structures that each include data associated with a subset of nodes of the tree.

    摘要翻译： 公开了一种用于实现分为压缩块的树数据结构的树遍历操作的系统，方法和计算机程序产品。 该方法包括以下步骤：接收表示具有多个节点的树的树数据结构的至少一部分，将树数据结构的根节点推送到与树遍历的外循环相关联的遍历栈数据结构 操作算法，并且对于树遍历操作算法的外循环的每次迭代，从遍历堆栈数据结构中弹出顶元素，并且经由树遍历操作算法的内循环处理与之对应的压缩块数据结构 与顶部元素。 树数据结构可以被编码为多个压缩块数据结构，每个压缩块数据结构包括与树的节点的子集相关联的数据。

    THREE DIMENSIONAL MODELING
    6.
    发明申请
    THREE DIMENSIONAL MODELING 审中-公开
    三维建模

    公开(公告)号：US20170039759A1

    公开(公告)日：2017-02-09

    申请号：US15303962

    申请日：2015-04-16

    申请人： 3D SLASH

    发明人： Sylvain HUET

    IPC分类号： G06T17/00 ,  G06T7/60 ,  G06T19/20 ,  B33Y50/02 ,  G06T7/40 ,  G06T7/00 ,  G05B19/4099 ,  B29C67/00 ,  G06T17/10 ,  H04N19/426

    CPC分类号： G06T17/005 ,  B29C64/386 ,  B33Y50/00 ,  B33Y50/02 ,  G05B19/4099 ,  G05B2219/35134 ,  G05B2219/49007 ,  G06T7/13 ,  G06T7/60 ,  G06T7/70 ,  G06T7/90 ,  G06T9/001 ,  G06T9/40 ,  G06T17/10 ,  G06T19/20 ,  H04N19/426

    摘要： Systems and methods of creating a 3 Dimensional (3D) model of an object suitable for 3D printing are described. A method comprises defining an initial cuboid of edge lengths Lx, Ly, Lz for creating the 3D model, wherein the initial cuboid implicitly includes inner cuboids such that starting from the initial cuboid each cuboid is recursively splitable into eight identical inner cuboids. Further, the method comprises iteratively, receiving an input specifying a size of an inner cuboid to be modified and a selection of a point on the screen. Based on the received user input, at least one inner cuboid which is to be modified is identified. Once the inner cube to be modified is identified, the inner cube may be modified by marking the at least one inner cuboid as filled or empty.

    摘要翻译： 描述了创建适用于3D打印的对象的3维（3D）模型的系统和方法。 一种方法包括定义用于创建3D模型的边缘长度Lx，Ly，Lz的初始长方体，其中初始长方体隐含地包括内立方体，使得从初始立方形开始，每个长方体可递归地分成八个相同的内立方体。 此外，该方法包括迭代地接收指定要修改的内立方体的大小的输入和屏幕上的点的选择。 基于接收到的用户输入，识别要修改的至少一个内部长方体。 一旦确定了要修改的内立方体，可以通过将至少一个内部长方体标记为已填充或空白来修改内部多维数据集。

    BLOCK-BASED BOUNDING VOLUME HIERARCHY
    7.
    发明申请
    BLOCK-BASED BOUNDING VOLUME HIERARCHY 有权
    基于块的边界体积分数

    公开(公告)号：US20160071312A1

    公开(公告)日：2016-03-10

    申请号：US14589904

    申请日：2015-01-05

    申请人： NVIDIA Corporation

    发明人： Samuli Matias Laine ,  Timo Oskari Aila ,  Tero Tapani Karras

    IPC分类号： G06T15/10 ,  G06T15/08

    CPC分类号： G06F17/30961 ,  G06F17/30327 ,  G06F17/30563 ,  G06T1/60 ,  G06T9/40 ,  G06T15/005 ,  G06T15/06 ,  G06T15/08 ,  G06T15/10 ,  G06T15/80 ,  G06T17/10 ,  H04N19/174 ,  H04N19/44

    摘要： A system, method, and computer program product for implementing a tree traversal operation for a tree data structure divided into compression blocks is disclosed. The method includes the steps of receiving at least a portion of a tree data structure that represents a tree having a plurality of nodes, pushing a root node of the tree data structure onto a traversal stack data structure associated with an outer loop of a tree traversal operation algorithm, and, for each iteration of an outer loop of a tree traversal operation algorithm, popping a top element from the traversal stack data structure and processing, via an inner loop of the tree traversal operation algorithm, the compression block data structure that corresponds with the top element. The tree data structure may be encoded as a plurality of compression block data structures that each include data associated with a subset of nodes of the tree.

    摘要翻译： 公开了一种用于实现分为压缩块的树数据结构的树遍历操作的系统，方法和计算机程序产品。 该方法包括以下步骤：接收表示具有多个节点的树的树数据结构的至少一部分，将树数据结构的根节点推送到与树遍历的外循环相关联的遍历栈数据结构 操作算法，并且对于树遍历操作算法的外循环的每次迭代，从遍历堆栈数据结构中弹出顶元素，并且经由树遍历操作算法的内循环处理与之对应的压缩块数据结构 与顶部元素。 树数据结构可以被编码为多个压缩块数据结构，每个压缩块数据结构包括与树的节点的子集相关联的数据。

    Accelerated three-dimensional intersection testing using compressed volumes
    8.
    发明授权
    Accelerated three-dimensional intersection testing using compressed volumes 有权
    使用压缩卷加速三维交点测试

    公开(公告)号：US09245383B2

    公开(公告)日：2016-01-26

    申请号：US13897553

    申请日：2013-05-20

    申请人： Google Inc.

    发明人： Christopher S. Co

    IPC分类号： G06T17/00 ,  G06T17/20 ,  G06T9/00 ,  G06T9/40

    CPC分类号： G06T17/20 ,  G06T9/001 ,  G06T9/40 ,  G06T17/005

    摘要： Aspects of the present disclosure relate to building volumetric data structures for intersection testing. For example, 3D data may be represented by points associated with triangles. The triangles may be rasterized to a 3D grid. Each cell of the grid may contain a set of triangles. The grid may be used to generate a new grid of larger grid cells, where each larger grid cell represents some portion of cells of the original grid. The triangle data from each new cell may then be encoded as a list of integers including the triangle data. The list of values may be run-length-encoded. The result is a single octree cube. This process may be repeated in order to generate additional octree cubes for the volumetric structure. The volumetric structure may then be used to identify triangles that intersect with a given ray.

    摘要翻译： 本公开的方面涉及建立用于交叉测试的体积数据结构。 例如，3D数据可以由与三角形相关联的点来表示。 三角形可以被光栅化到3D网格。 网格的每个单元格可能包含一组三角形。 网格可以用于生成较大网格单元的新网格，其中每个较大的网格单元表示原始网格的单元格的一部分。 然后可以将来自每个新单元的三角形数据编码为包括三角形数据的整数列表。 值列表可以被运行长度编码。 结果是单个八叉树立方体。 可以重复该过程，以便为体积结构生成附加的八叉树立方体。 然后可以使用体积结构来识别与给定射线相交的三角形。

    Method and apparatus for encoding a mesh model, encoded mesh model, and method and apparatus for decoding a mesh model
    9.
    发明授权
    Method and apparatus for encoding a mesh model, encoded mesh model, and method and apparatus for decoding a mesh model 有权
    用于编码网格模型，编码网格模型以及用于解码网格模型的方法和装置的方法和装置

    公开(公告)号：US08949092B2

    公开(公告)日：2015-02-03

    申请号：US13501662

    申请日：2009-10-15

    申请人： Kang Ying Cai ,  Yu Jin ,  Zhi Bo Chen

    发明人： Kang Ying Cai ,  Yu Jin ,  Zhi Bo Chen

    IPC分类号： G06G7/48 ,  H04W16/20 ,  G06F17/50 ,  G06T17/20 ,  G06F17/10 ,  H04W28/06 ,  H04W84/18 ,  H04W88/04

    CPC分类号： H04W16/20 ,  G06F17/10 ,  G06F17/5018 ,  G06T9/001 ,  G06T9/40 ,  G06T17/20 ,  H04W28/06 ,  H04W84/18 ,  H04W88/04

    摘要： For most large 3D engineering models, the instance positions of repeating instances of connected components show significant multiple spatial aggregation. The invention uses several KD-trees, each for one cluster of points which are spatially aggregated. The multiple KD-trees generate a relatively short data stream, and thus improve the total compression ratio. A method for encoding points of a 3D mesh model comprises steps of determining that the mesh model comprises repeating instances of a connected component, and determining for each repeating instance at least one reference point, clustering the reference points of the repeating instances into one or more clusters, and encoding the clustered reference points using KD-tree coding, wherein for each cluster a separate KD-tree is generated.

    摘要翻译： 对于大多数大型3D工程模型，连接组件的重复实例的实例位置显示出显着的多个空间聚合。 本发明使用几个KD树，每个KD树针对空间聚集的一个点簇。 多个KD树生成相对较短的数据流，从而提高总压缩比。 用于对3D网格模型的点进行编码的方法包括以下步骤：确定所述网格模型包括连续分量的重复实例，以及针对每个重复实例确定至少一个参考点，将所述重复实例的参考点聚类成一个或多个 群集，并使用KD树编码对聚类参考点进行编码，其中对于每个簇，生成单独的KD树。

    Method, medium and apparatus for encoding and decoding 3D data using adaptive octrees
    10.
    发明授权
    Method, medium and apparatus for encoding and decoding 3D data using adaptive octrees 失效
    使用自适应八叉树对3D数据进行编码和解码的方法，介质和装置

    公开(公告)号：US08558834B2

    公开(公告)日：2013-10-15

    申请号：US11059462

    申请日：2005-02-16

    申请人： Shinjun Lee

    发明人： Shinjun Lee

    IPC分类号： G06T17/00

    CPC分类号： G06T9/40 ,  G06T17/005 ,  H04N19/90 ,  H04N19/96

    摘要： A method, medium, and apparatus for encoding and decoding three-dimensional (3D) data. The method of encoding includes converting 3D data having at least of any one of PointTexture, voxel, and octree data into adaptive octree data where intermediate nodes are given labels, encoding nodes of the adaptive octree, and generating a bitstream from the encoded data. The method of decoding includes reading nodes making up a tree from a bitstream of the 3D data, decoding the read nodes, recovering an adaptive octree from the decoded nodes, and recovering at least any one of octree, voxel, and PointTexture data from the adaptive octree. It is possible to efficiently encode a huge amount of 3D data, and to recover the high-definition 3D data with a small amount of data since it is possible to efficiently encode the volume data with a certain resolution as well as a fixed resolution.

    摘要翻译： 一种用于对三维（3D）数据进行编码和解码的方法，介质和装置。 编码方法包括将具有至少任一个点纹理，体素和八叉树数据的3D数据转换成其中中间节点被给予标签的自适应八叉树数据，编码自适应八叉树的节点，以及从编码数据生成比特流。 解码方法包括从3D数据的比特流中读取构成树的节点，对读节点进行解码，从解码节点恢复自适应八叉树，以及从自适应中恢复八叉树，体元和点纹理数据中的至少一个 八卦 可以有效地编码大量的3D数据，并且可以用少量的数据来恢复高分辨率3D数据，因为可以以一定的分辨率和固定的分辨率有效地对体数据进行编码。