Method and apparatus for generation of consistent parameterizations for a set of meshes
    1.
    发明授权
    Method and apparatus for generation of consistent parameterizations for a set of meshes 有权
    用于生成一组网格的一致参数化的方法和装置

    公开(公告)号:US06831638B2

    公开(公告)日:2004-12-14

    申请号:US10075793

    申请日:2002-02-14

    IPC分类号: G06T1700

    CPC分类号: G06T17/20

    摘要: Techniques are disclosed for generating consistent parameterizations for a set of meshes each of which includes data points representative of a corresponding surface. The consistent parameterizations preferably share the same base domain, and are generated using a net tracing algorithm. The net tracing algorithm involves determining for each of the meshes a net of paths having a connectivity substantially the same as that of the base domain. In an illustrative embodiment, the net tracing algorithm as applied to a given one of the meshes includes determining, for each edge in the base domain, a tentative path for use in the net of paths corresponding to the mesh. The tentative paths are then prioritized based on length, and selected ones of the tentative paths are used to construct a spanning tree of the base domain. One or more swirl detection operations are preferably performed as part of the spanning tree construction, with the results of the swirl detection operations being utilized in selecting particular ones of the tentative paths for use in the spanning tree. The net of paths is completed by adding one or more additional paths to the spanning tree, followed by applying a straightening operation to one or more of the paths in the net. The consistent parameterizations can be utilized to generate same-connectivity remeshes of the original meshes, which considerably facilitates subsequent digital geometry processing (DGP) operations.

    摘要翻译: 公开了用于为一组网格生成一致的参数化的技术,每个网格包括表示相应表面的数据点。 一致的参数化优选地共享相同的基本域,并且使用网络跟踪算法生成。 网络跟踪算法涉及为每个网格确定具有与基本域基本相同的连接的路径网。 在说明性实施例中,应用于给定的一个网格的网络跟踪算法包括针对基本域中的每个边缘确定用于在与网格对应的路径的网络中的临时路径。 然后,基于长度优先考虑临时路径,并且使用所选择的尝试路径来构建基本域的生成树。 优选地,一个或多个涡流检测操作被执行作为生成树构造的一部分,其中涡流检测操作的结果被用于选择在生成树中使用的特定路径。 通过将一个或多个附加路径添加到生成树,然后对网络中的一个或多个路径应用校正操作来完成路径的网络。 可以使用一致的参数化来生成原始网格的相同连接重建,这大大有助于后续的数字几何处理(DGP)操作。

    Compression of 3D surfaces using progressive geometry
    2.
    发明授权
    Compression of 3D surfaces using progressive geometry 失效
    使用渐进几何压缩3D曲面

    公开(公告)号:US06995761B1

    公开(公告)日:2006-02-07

    申请号:US09658214

    申请日:2000-09-08

    IPC分类号: G06T15/00

    CPC分类号: G06T9/005

    摘要: A new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. Meshes may have three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the reduction of error in a compression setting. Using semi-regular meshes, parameter and connectivity information can be virtually eliminated. The semiregular meshes may be used with semi-regular wavelet transforms, zerotree coding, and subdivision based reconstruction.

    摘要翻译: 用于任意拓扑的新的渐进式压缩方案,由几何扫描产生的高度详细和密集采样的网格。 网格可能有三个不同的组件:几何,参数和连接信息。 后两者对压缩设置中的误差的减少没有贡献。 使用半规则网格,可以实际消除参数和连接信息。 半规格网格可以与半规则小波变换,零树编码和基于细分的重建一起使用。

    Liquid interferon-beta formulations
    4.
    发明授权
    Liquid interferon-beta formulations 有权
    液体干扰素-β制剂

    公开(公告)号:US08337826B2

    公开(公告)日:2012-12-25

    申请号:US11102723

    申请日:2005-04-11

    IPC分类号: A61K38/21 A61K38/00 C07K17/00

    CPC分类号: A61K38/215

    摘要: The present invention relates to liquid formulations of human interferon-β. The formulations are characterized in that they have a buffer with a pH in the weakly acidic to neutral range of between 5 and 8, preferably between over 5.5 and 8, and that they exhibit high stability of the interferon-β in solution while retaining the molecular integrity.

    摘要翻译: 本发明涉及人类干扰素的液体制剂。 制剂的特征在于它们具有pH在5至8之间,优选在5.5至8之间的弱酸性至中性范围内的缓冲液,并且它们表现出高度稳定的干扰素-bgr; 同时保持分子完整性。

    Connectivity encoding and decoding of polygon meshes
    5.
    发明授权
    Connectivity encoding and decoding of polygon meshes 有权
    多边形网格的连接编码和解码

    公开(公告)号:US07098916B1

    公开(公告)日:2006-08-29

    申请号:US10252019

    申请日:2002-09-19

    CPC分类号: G06T9/001

    摘要: Methods of connectivity encoding polygonal mesh representations of objects are described, along with methods of decoding encoded connectivity information for polygonal mesh representations of objects. In the encoding process, an active vertex queue is initialized with one or more vertices incident to a seed face. A vertex is selected from the queue, and the ring of the vertex traversed. If an unprocessed face is encountered during the traversal, the degree of the face, and the valences of any unprocessed vertices incident to the face are output. Any such unprocessed vertices are also entered into the queue. The method iterates until no more vertices remain on the active queue. In one implementation, an encoded data stream is output, which comprises two logical streams, one for face-degree information and the other for vertex-valence information. In the decoding process, the encoded data stream is received, and the connectivity of the mesh regenerated.

    摘要翻译: 描述了对象的多边形网格表示的连接性编码方法,以及对对象的多边形网格表示的编码的连接信息进行解码的方法。 在编码过程中,使用一个或多个入射到种子面的顶点来初始化活动顶点队列。 从队列中选择顶点,并且顶点的环遍历。 如果在遍历期间遇到未处理的面部,则输出面部的程度以及任何未处理顶点的入射到面部的价态。 任何这样的未处理顶点也被输入到队列中。 该方法迭代直到在活动队列上不再有顶点。 在一个实现中,输出编码数据流,其包括两个逻辑流,一个用于面部度信息,另一个用于顶点价数信息。 在解码过程中,接收编码数据流,并重新生成网格的连通性。

    Object surface representation and related methods and systems
    6.
    发明授权
    Object surface representation and related methods and systems 有权
    对象表面表示及相关方法和系统

    公开(公告)号:US07023435B1

    公开(公告)日:2006-04-04

    申请号:US09833268

    申请日:2001-04-11

    IPC分类号: G06T17/00

    CPC分类号: G06T17/20 G06T17/205

    摘要: A method of subdividing a representation of an object surface comprising a tessellated mesh of polygons is provided. The surface may be bounded by one or more boundary curves. One or more polygons in the mesh may be each subdivided into child polygons, each having one or more vertices. The result is a second mesh representation which may have a finer level of resolution than the original mesh. The locations or parameters of the vertices of the child polygons in the second mesh may be determined using suitable weightings of the locations or parameters of adjacent vertices in the original mesh. The locations of the vertices in the second mesh may be further refined through application of detail vectors. The locations of boundary vertices are always constrained to lie on one of the boundary curves bounding the surface in question. The method may continue iterating until the surface as represented by the subdivided surface representation is fine enough for the intended application.

    摘要翻译: 提供了一种分割包括多边形的镶嵌网格的对象表面的表示的方法。 表面可以由一个或多个边界曲线界定。 网格中的一个或多个多边形可以每个细分为子多边形,每个具有一个或多个顶点。 结果是第二网格表示,其可以具有比原始网格更精细的分辨率水平。 可以使用原始网格中相邻顶点的位置或参数的适当加权来确定第二网格中的子多边形的顶点的位置或参数。 可以通过应用细节向量进一步改进第二网格中的顶点的位置。 边界顶点的位置总是被限制在位于所讨论的表面上的边界曲线之一上。 该方法可以继续迭代,直到由细分表面表示表示的表面对于预期应用来说足够好。

    Three dimensional surface drawing controlled by hand motion
    8.
    发明授权
    Three dimensional surface drawing controlled by hand motion 有权
    通过手动控制的三维表面绘图

    公开(公告)号:US07212197B1

    公开(公告)日:2007-05-01

    申请号:US09496137

    申请日:2000-02-01

    IPC分类号: G06T15/00

    摘要: Surface drawing is described as a medium which provides direct control over the creation of a wide range of intricate shapes. Surfaces are created by moving a hand, instrumented with a special glove, through space in a semi-immersive 3D display and interaction environment. Intricate forms can be created using intuitive motions. The design space can be freely explored during the modeling process without the need to plan the construction of the final shape. In particular it supports unconstrained erasing and buildup of new geometry. An incremental Cookie Cutter algorithm, a construction method for triangulated meshes is described which allows the user to freely grow, join, and erase surfaces based on hand motions.

    摘要翻译: 表面绘图被描述为可以直接控制创建各种复杂形状的介质。 表面是通过在半沉浸式3D显示和交互环境中移动通过特殊手套测量的手,通过空间创建的。 可以使用直觉运动创建复杂的表单。 可以在建模过程中自由探索设计空间,而无需规划最终形状的构造。 特别是它支持无约束的擦除和新的几何体的建立。 描述了增量Cookie切割机算法,一种用于三角网格的构造方法,其允许用户基于手动运动自由地生长,连接和擦除表面。