Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Skala, Václav | |
dc.date.accessioned | 2015-01-20T08:34:43Z | |
dc.date.available | 2015-01-20T08:34:43Z | |
dc.date.issued | 1994 | |
dc.identifier.uri | http://hdl.handle.net/11025/11833 | |
dc.description.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. | en |
dc.format | 15 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.subject | struktura dat | cs |
dc.subject | mnohostěny | cs |
dc.subject | složitost algoritmů | cs |
dc.subject | geometrie | cs |
dc.title | Point in Polygon Algorithm with O(1) Complexity | en |
dc.type | preprint | cs |
dc.type | preprint | en |
dc.rights.access | openAccess | en |
dc.type.version | draft | en |
dc.subject.translated | data structure | en |
dc.subject.translated | polygons | en |
dc.subject.translated | algorithm complexity | en |
dc.subject.translated | geometry | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Preprinty / Preprints (KIV) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Skala_1994_Clip-SQRT-TR.pdf | Plný text | 534,33 kB | Adobe PDF | Zobrazit/otevřít Vyžádat kopii |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11833
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.