首页> 外文会议>Computational topology in image context. >Triangle Mesh Compression and Homological Spanning Forests
【24h】

Triangle Mesh Compression and Homological Spanning Forests

机译:三角形网格压缩与同质跨越森林

获取原文
获取原文并翻译 | 示例

摘要

Triangle three-dimensional meshes have been widely used to represent 3D objects in several applications. These meshes are usually surfaces that require a huge amount of resources when they are stored, processed or transmitted. Therefore, many algorithms proposing an efficient compression of these meshes have been developed since the early 1990s. In this paper we propose a lossless method that compresses the connectivity of the mesh by using a valence-driven approach. Our algorithm introduces an improvement over the currently available valence-driven methods, being able to deal with triangular surfaces of arbitrary topology and encoding, at the same time, the topological information of the mesh by using Homological Spanning Forests. We plan to develop in the future (geo-topological) image analysis and processing algorithms, that directly work with the compressed data.
机译:三角形三维网格已在多种应用中广泛用于表示3D对象。这些网格通常是在存储,处理或传输时需要大量资源的表面。因此,自1990年代初以来,已经提出了许多建议对这些网格进行有效压缩的算法。在本文中,我们提出了一种无价方法,该方法通过使用价驱动方法来压缩网格的连通性。我们的算法引入了对当前可用的价驱动方法的改进,该方法能够处理任意拓扑的三角形表面并同时使用同构跨越森林对网格的拓扑信息进行编码。我们计划在将来开发可直接与压缩数据配合使用的(地理拓扑)图像分析和处理算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号