Please login to be able to save your searches and receive alerts for new content matching your search criteria.
This paper presents two robust algorithms for calculating the orientation and inclusion of simple polygons, respectively. By finding a maximum vertex of a simple polygon, a very fast convex vertex searching method is proposed and the orientation of the polygon can be uniquely determined. To decide the relationship between a point and a simple polygon, the concept of visible edge is put forward and an efficient visible edge searching algorithm is presented.