Cart (Loading....) | Create Account
Close category search window
 

Containment test for polygons containing circular arcs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gombosi, M. ; Lab. for Geometric Modeling & Multimedia Algorithms, Maribor Univ., Slovenia

The paper describes an extended algorithm for solving the point-in-polygon problem. The polygon in this case consists of straight edges and also from circular arcs. The algorithm uses the classical ray intersection method. The difference is that we now have two types of geometric objects to test for intersections. Processing is done with simple and efficient tests, which quickly answer our question. By the use of appropriate data structure, this task can be done safely and easily. Despite the extension of the classical ray intersection method, the algorithm still runs in linear time complexity.

Published in:

Eurographics UK Conference, 2002. Proceedings. The 20th

Date of Conference:

2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.