首页> 外国专利> SINGLE-RATE CONNECTIVITY CODEC FOR TRIANGLE MESHES

SINGLE-RATE CONNECTIVITY CODEC FOR TRIANGLE MESHES

机译:三角形网格的单速率连通性编解码器

摘要

3-D shapes as animation, virtual reality, games, simulation, medical imaging and new media in a variety of fields has emerged. Three-dimensional shapes are conventional sound (one-dimensional) image (two-dimensional), video (2D + time) with the geometric information and other data, and the size of the data is huge because. Sound (mpeg), image (jpg, gif), video (avi, mpeg) which was applied to a conventional compression method is expressed as the geometric information to be preserved at the same time efficient three-dimensional data processing required by the application system does not consider the spatial information hagieneun was not efficient. So he needs a new compression method for three-dimensional data characteristics, appeared three-dimensional data compression programs using a variety of techniques to do this over the past few years have been gradually improves the compression ratio. The present invention aims to facilitate the storage and transport of these huge 3D mesh data size was dramatically reduced. Connection information of three-dimensional shapes early compression was used as a method of treatment according to a set of surface form a shape sequence (Deterministic Traversal), and after that has been developed by the adaptive (Adaptive Traversal) techniques. The present invention was invented adaptive scheme for selecting the order of the access gate (Gate) form a triangle with the geometry of the three-dimensional shapes. The triangle is formed by connecting the three points. Have all the data points in the triangle mesh, how to connect the dots to compression encoding whether the relationship between the gate and the remaining one point to configure the triangle, and restore the connection between the release point and to have the same connectivity, triangle and circle It is the heart of the present invention. Defined as a gate to specify the direction to the line segment connecting the two points to it and make a list of all of the gate that is a member of the triangles to select one of the gates and compresses the connection between the three points that make up the one-side information. At that point, a selection of the gate selected in accordance with the angle value between the two gates consisting of a sequence according to a predetermined sequence, as it was so as to be accessible within the triangular surface mesh with adaptive. Always remaining in each of the select gate from the gate with the smallest list also shortens the processing time also increases the compression efficiency. This is because the smallest when selecting a gate with the gate list each be divided was the problem when compressed by the conventional fixed sequence access to bond or group significantly reduced. In addition, the conventional method, but the list of the divided and compressed by using a combination of two codes, the present invention will be compressed to a single code. Compressing the connection information in the present invention method can improve the efficiency of approximately 40% of the currently known connection information than a simple compression program that Touma-Gotsman out that the highest efficiency of compression techniques.
机译:现已出现了各种领域中的3-D形状,例如动画,虚拟现实,游戏,模拟,医学成像和新媒体。三维形状是具有几何信息和其他数据的常规声音(一维)图像(二维),视频(2D +时间),并且数据的大小很大。应用于常规压缩方法的声音(mpeg),图像(jpg,gif),视频(avi,mpeg)表示为要保留的几何信息,同时又需要应用系统所需的高效三维数据处理认为hagieneun的空间信息效率不高。因此他需要一种针对三维数据特征的新压缩方法,出现了使用多种技术对三维数据进行压缩的程序,这在过去几年中已逐渐提高了压缩率。本发明旨在促进这些巨大的3D网格数据的存储和运输的大小被大大减小。三维形状的早期压缩连接信息被用作根据一组形状序列(确定性遍历)进行处理的方法,然后通过自适应(Adaptive Traversal)技术得到发展。本发明是发明的自适应方案,用于选择具有三维形状的几何形状的三角形的访问门(Gate)的顺序。通过连接三个点形成三角形。将所有数据点都放在三角形网格中,如何将这些点连接到压缩编码,以确保门与其余一个点之间的关系是否构成三角形,并恢复释放点之间的连接并具有相同的连通性,三角形圈是本发明的核心。定义为门,以指定连接两点的线段的方向,并列出作为三角形成员的所有门的列表,以选择其中一个门并压缩三个点之间的连接一方面的信息。在这一点上,根据在两个门之间的角度值选择的门的选择,该角度值由根据预定序列的序列组成,以便可以在三角形表面网格内以自适应方式访问。从列表中最小的门开始总是保留在每个选择门中,这也缩短了处理时间,也提高了压缩效率。这是因为在选择每个门列表进行选择的门时,最小的问题是通过常规固定序列压缩后对键或基团的访问显着减少的问题。另外,在常规方法中,但是通过使用两个代码的组合来划分和压缩列表,本发明将被压缩为单个代码。与Touma-Gotsman认为压缩技术的效率最高的简单压缩程序相比,本发明方法中的压缩连接信息可以将当前已知的连接信息的效率提高大约40%。

著录项

  • 公开/公告号KR20060087647A

    专利类型

  • 公开/公告日2006-08-03

    原文格式PDF

  • 申请/专利权人 SUNNYGRAPHY;

    申请/专利号KR20050008418

  • 发明设计人 LEE HAE YOUNG;CHOI WEON JOON;

    申请日2005-01-31

  • 分类号G06T9/20;G06T17/00;

  • 国家 KR

  • 入库时间 2022-08-21 21:25:10

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号