An algorithm for deciding whether a point set is inside a polygon is given on the basis of binary search method. This algorithm first splits the plane to generate an ordered set R of planar areas, and determines whether it is inside a given polygon L for each area in R . With those preprocessing steps, this algorithm then decides whether it is inside polygon L by binary search in R for each point in a given point set S . The time complexity of the algorithm in the worst case is ma...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
