Full metadata record
DC FieldValueLanguage
dc.contributor.authorSkala, Václav
dc.date.accessioned2015-01-20T08:34:43Z
dc.date.available2015-01-20T08:34:43Z
dc.date.issued1994
dc.identifier.urihttp://hdl.handle.net/11025/11833
dc.description.abstractAlgorithms 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.format15 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.subjectstruktura datcs
dc.subjectmnohostěnycs
dc.subjectsložitost algoritmůcs
dc.subjectgeometriecs
dc.titlePoint in Polygon Algorithm with O(1) Complexityen
dc.typepreprintcs
dc.typepreprinten
dc.rights.accessopenAccessen
dc.type.versiondraften
dc.subject.translateddata structureen
dc.subject.translatedpolygonsen
dc.subject.translatedalgorithm complexityen
dc.subject.translatedgeometryen
dc.type.statusPeer-revieweden
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1994_Clip-SQRT-TR.pdfPlný text534,33 kBAdobe PDFView/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.