• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Shen Xukun, Zhao Xuewei, and Zhao Qinping. Feature-Preserved Progressive Texture-Mesh in Digital Museum[J]. Journal of Computer Research and Development, 2007, 44(7): 1097-1104.
Citation: Shen Xukun, Zhao Xuewei, and Zhao Qinping. Feature-Preserved Progressive Texture-Mesh in Digital Museum[J]. Journal of Computer Research and Development, 2007, 44(7): 1097-1104.

Feature-Preserved Progressive Texture-Mesh in Digital Museum

More Information
  • Published Date: July 14, 2007
  • In practice, feature information such as colors, textures, surface normals, etc. is necessary to represent 3D models besides geometry and topology information of triangle meshes. However, with the rapid improvement of 3D capture equipments, the accuracy of 3D models increases and results in the large volume of 3D data. Most traditional methods could not deal with the feature of mesh models such as boundary edges and textures during simplification. So, in order to decrease the data volume of 3D textured models in digital museum and retain significant feature synchronously, a new algorithm of texture-mesh based on triangle collapse is presented. By the concept of geometry and texture boundary, the original meshes are divided to boundary, corner, interior or colory triangles according to different boundary conditions. In this way, the quadric and error criterion is improved, and constraint strategies are adopted to preserve the feature of geometry boundaries and texture attributes during the simplification process. In addition, a method combining octree-based compression with progressive meshes is given to provide a continuous multi-resolution representation of 3D models. The proposed method is successfully applied to progressive transmission and presentation system of 3D models over the Internet.
  • Related Articles

    [1]Wang Hanzhi, Yi Lu, Wei Zhewei, Gan Junhao, Yuan Ye, Wen Jirong, Du Xiaoyong. Random-Walk Probability Computation on Dynamic Weighted Graphs[J]. Journal of Computer Research and Development, 2024, 61(8): 1865-1881. DOI: 10.7544/issn1000-1239.202440148
    [2]Chen Ji, Liu Haikun, Wang Xiaoyuan, Zhang Yu, Liao Xiaofei, Jin Hai. Largepages Supported Hierarchical DRAMNVM Hybrid Memory Systems[J]. Journal of Computer Research and Development, 2018, 55(9): 2050-2065. DOI: 10.7544/issn1000-1239.2018.20180269
    [3]Gao Peng, Wang Dongsheng, Wang Haixia. Increasing PCM Lifetime by Using Pipelined Pseudo-Random Encoding Algorithm[J]. Journal of Computer Research and Development, 2017, 54(6): 1357-1366. DOI: 10.7544/issn1000-1239.2017.20170065
    [4]Wang Dong, Li Zhenyu, Xie Gaogang. Unbiased Sampling Technologies on Online Social Network[J]. Journal of Computer Research and Development, 2016, 53(5): 949-967. DOI: 10.7544/issn1000-1239.2016.20148387
    [5]Li Wenming, Ye Xiaochun, Wang Da, Zheng Fang, Li Hongliang, Lin Han, Fan Dongrui, Sun Ninghui. MACT: Discrete Memory Access Requests Batch Processing Mechanism for High-Throughput Many-Core Processor[J]. Journal of Computer Research and Development, 2015, 52(6): 1254-1265. DOI: 10.7544/issn1000-1239.2015.20150154
    [6]Wu Weining, Liu Yang, Guo Maozu, and Liu Xiaoyan. Advances in Active Learning Algorithms Based on Sampling Strategy[J]. Journal of Computer Research and Development, 2012, 49(6): 1162-1173.
    [7]Ha Minghu, Tian Jingfeng, Zhang Zhiming. Structural Risk Minimization Principle Based on Complex Random Samples[J]. Journal of Computer Research and Development, 2009, 46(11): 1907-1916.
    [8]Wang Dan, Xie Gaogang, Yang Jianhua, Zhang Guangxing, Li Zhenyu. An Improved Adaptive Sampling Method for Traffic Measurement[J]. Journal of Computer Research and Development, 2007, 44(8): 1339-1347.
    [9]Yang Jianhua, Xie Gaogang, and Li Zhongcheng. A Best-Effort Adaptive Sampling Method for Flow-Based Traffic Monitoring[J]. Journal of Computer Research and Development, 2006, 43(3): 402-409.
    [10]Shi Rui and Yang Xiaozong. Research on the Node Spatial Probabilistic Distribution of the Random Waypoint Mobility Model for Ad Hoc Network[J]. Journal of Computer Research and Development, 2005, 42(12): 2056-2062.

Catalog

    Article views (763) PDF downloads (712) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return