首页> 外文期刊>Computer-Aided Design >Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums
【24h】

Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums

机译:使用Minkowski和计算多面体边界上区域的全局可见性图

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

摘要

A global visibility map is a spherical image built to describe the complete set of global visible view directions for a surface. In this paper, we consider the computation of global visibility maps for regions on the boundary of a polyhedron. Both the self-occlusions introduced by a region and the global occlusions introduced by the rest of the surfaces on the boundary of the polyhedron are considered for computing a global visibility map. We show that the occluded view directions introduced between a pair of polyhedral surfaces can be computed from the spherical projection of the Minkowski sum of one surface and the reflection of the other. A suitable subset of the Minkowski sum, which shares the identical spherical projection with the complete Minkowski sum, is constructed to obtain the spherical images representing global occlusions. Our method has been successfully tested on many CAD models. It extends the previous methods for computing global visibility maps using convex decomposition, and it exhibits a better performance.
机译:全局可见性图是一个球形图像,用于描述表面的完整全局可见视图方向集。在本文中,我们考虑计算多面体边界上区域的全局可见性图。为了计算全局可见性图,要考虑由区域引入的自遮挡和由多面体边界上的其余表面引入的全局遮挡。我们表明,可以从一个表面的Minkowski总和的球面投影和另一个表面的反射中计算出在一对多面体表面之间引入的遮挡视图方向。构造与完整的Minkowski和共享相同的球形投影的Minkowski和的合适子集,以获得代表全局遮挡的球形图像。我们的方法已在许多CAD模型上成功测试。它扩展了以前使用凸分解来计算全局可见性图的方法,并且表现出更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号