World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
No Access

ORIENTATION AND POINT INCLUSION TESTS FOR SIMPLE POLYGONS

    https://doi.org/10.1142/S1465876304002617Cited by:0 (Source: Crossref)
    Previous
    Next

    Abstract

    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.