|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
The 20 th Eurographics UK Conference
Containment Test for olygons Containing Circular Arcs
De Montfort University, Leicester, UK
June 11-June 13
ISBN: 0-7695-1518-5
| ASCII Text | x | ||
| Matej Gombosi, "Containment Test for olygons Containing Circular Arcs," Eurographics UK Conference, Annual, pp. 112, The 20 th Eurographics UK Conference, 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/EGUK.2002.1011280, author = {Matej Gombosi}, title = {Containment Test for olygons Containing Circular Arcs}, journal ={Eurographics UK Conference, Annual}, volume = {0}, year = {2002}, isbn = {0-7695-1518-5}, pages = {112}, doi = {http://doi.ieeecomputersociety.org/10.1109/EGUK.2002.1011280}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Eurographics UK Conference, Annual TI - Containment Test for olygons Containing Circular Arcs SN - 0-7695-1518-5 SP EP A1 - Matej Gombosi, PY - 2002 KW - null VL - 0 JA - Eurographics UK Conference, Annual ER - | |||
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.
Citation:
Matej Gombosi, "Containment Test for olygons Containing Circular Arcs," eguk, pp.112, The 20 th Eurographics UK Conference, 2002
Usage of this product signifies your acceptance of the Terms of Use.