几何压缩，快速传输

Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI:10.1109/ITCC.2001.918840

L. Gewali, C. Sun

{"title":"几何压缩，快速传输","authors":"L. Gewali, C. Sun","doi":"10.1109/ITCC.2001.918840","DOIUrl":null,"url":null,"abstract":"A compact representation of a two dimensional mesh can significantly reduce transmission of mesh data over the Internet. Compact representation of the mesh is also desirable for saving storage space. The compressibility of a mesh can be elegantly captured in term of Hamiltonian graphs. In this paper we present an algorithm to partition a convex polygon into a triangular mesh that admits Hamiltonian paths.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Geometric compression for fast transmission\",\"authors\":\"L. Gewali, C. Sun\",\"doi\":\"10.1109/ITCC.2001.918840\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A compact representation of a two dimensional mesh can significantly reduce transmission of mesh data over the Internet. Compact representation of the mesh is also desirable for saving storage space. The compressibility of a mesh can be elegantly captured in term of Hamiltonian graphs. In this paper we present an algorithm to partition a convex polygon into a triangular mesh that admits Hamiltonian paths.\",\"PeriodicalId\":318295,\"journal\":{\"name\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2001.918840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2001.918840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

二维网格的紧凑表示可以显著减少网格数据在互联网上的传输。网格的紧凑表示也有利于节省存储空间。网格的可压缩性可以很好地用哈密顿图表示。本文提出了一种将凸多边形划分为允许哈密顿路径的三角形网格的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Geometric compression for fast transmission

A compact representation of a two dimensional mesh can significantly reduce transmission of mesh data over the Internet. Compact representation of the mesh is also desirable for saving storage space. The compressibility of a mesh can be elegantly captured in term of Hamiltonian graphs. In this paper we present an algorithm to partition a convex polygon into a triangular mesh that admits Hamiltonian paths.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings International Conference on Information Technology: Coding and Computing

自引率

0.00%

发文量