Title: | Point in Polygon Algorithm with O(1) Complexity |
Authors: | Skala, Václav |
Issue Date: | 1994 |
Document type: | preprint preprint |
URI: | http://hdl.handle.net/11025/11833 |
Keywords: | struktura dat;mnohostěny;složitost algoritmů;geometrie |
Keywords in different language: | data structure;polygons;algorithm complexity;geometry |
Abstract: | Algorithms for point-in-polygon problem solution are very often used in computer graphics applications. The naive implementation has O(N) processing time complexity or O(lg N)complexity if a convex polygon is considered. A new algorithm of O(l) processing complexity was developed. The important feature of the algorithm is that preprocessing complexity is O(N) and memory requirements depend on geometrical properties of the given polygon. Usage of the algorithm is expected in applications where many points are tested whether resides in the given polygon or not. The presented approach can be considered as alternative to the parallel processing usage. Experimental results are includes, too. |
Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Skala_1994_Clip-SQRT-TR.pdf | Plný text | 534,33 kB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11833
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.