首页> 外文会议>International Conference on Virtual Reality and Visualization >View-Dependent Simplification for Web3D Triangular Mesh Based on Voxelization and Saliency
【24h】

View-Dependent Simplification for Web3D Triangular Mesh Based on Voxelization and Saliency

机译:基于体素化和显着性的Web3D三角网格的视图依赖简化

获取原文

摘要

View-dependent simplification method can preserve the mesh contour feature, and be low computation, low time consuming in handling dense mesh. Besides, it totally realize simplification operation in webpage. In this paper, a framework for a simplification method based on saliency and viewpoint-based voxelization is presented. Moreover, by computing the related mesh principal curvatures, the edges that under some condition we met are simplified. Besides, we make use of voxelization for models, by computing the relationship between viewpoints and bounding box of voxelization, in order to judge which parts of the mesh is seen. Moreover, we use new data structures, the Orthogonal List and max heap, which are different from others. The Orthogonal List mainly stores the edge-point index of mesh, and the max heap does the simplification operation and sort, by computing the weight of surface, in order to ensure the complex triangle mesh always firstly being simplified. Finally, the proposed algorithms is implemented to test robustness and efficiency of our approach. The result shows that proposed methods are higher running efficiency than others.
机译:依赖视图的简化方法可以保留网格轮廓特征,并且计算量少,处理密集网格时耗时少。此外,它完全实现了网页中的简化操作。本文提出了一种基于显着性和基于视点的体素化的简化方法的框架。此外,通过计算相关的网格主曲率,可以简化在某些条件下满足的边线。此外,我们通过将体素化用于模型,通过计算视点与体素化的边界框之间的关系来判断看到网格的哪些部分。此外,我们使用新的数据结构,即正交列表和最大堆,这与其他结构不同。正交表主要存储网格的边点索引,最大堆通过计算曲面的权重来进行简化操作和排序,以确保始终首先简化复杂的三角形网格。最后,所提出的算法被实施以测试我们方法的鲁棒性和效率。结果表明,所提出的方法具有比其他方法更高的运行效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号