期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Point-In-Polyhedra Test with Direct Handling of Degeneracies 被引量:1
1
作者 CUI Shulin ZHANG Shuqing +3 位作者 CHEN Xuanxi pang zhenping FU Xiaoyang ZHANG Xu 《Geo-Spatial Information Science》 2011年第2期91-97,共7页
The Point-In-Polyhedron problem is to check whether a point is inside or outside of a given polyhedron.When a degenerate case is detected,the traditional ray-crossing algorithms avoid the case by selecting a different... The Point-In-Polyhedron problem is to check whether a point is inside or outside of a given polyhedron.When a degenerate case is detected,the traditional ray-crossing algorithms avoid the case by selecting a different ray or erase the case by perturbing input data.This paper introduces a Threshold-Based Ray-Crossing (TBRC) algorithm for solving the Point-In-Polyhedron problem.The TBRC algorithm copes directly with degenerate cases by checking whether to count the face intersecting with the ray.It is worth mentioning that the TBRC algorithm can handle all degeneracies without extra computation and storage.Moreover,we analyze the basic algorithm and examine how to accelerate it.The experimental results show that TBRC algorithm is highly efficient and robust for the Point-In-Polyhedron problem,compared to a classical tetrahedron-based algorithm without pre-processing. 展开更多
关键词 TBRC the edge-face problem Point-In-Polyhedron
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部