Title: Algoritmy se strukturální složitostí menší než optimální aneb K čemu je programování
Authors: Skala, Václav
Citation: International Conference Algorithms’95, Nizke Tatry, Slovak Republik, p. 221-226
Issue Date: 1995
Document type: preprint
URI: http://hdl.handle.net/11025/11827
Keywords: počítačová grafika;ořezávání přímky;složitost algoritmů;paralelní programování
Keywords in different language: computer graphics;line clipping;algorithm complexity;parallel processing
Abstract: New algorithms Point-in-Polygon and line clipping algorithms are very often used especially in computer graphics applications. Algorithms usually have O(N) or O(lg N) complexities. New algorithms with O(l) expected complexity has been developed using pre-processing. The interesting feature of presented algorithms is that memory requirements depend on geometrical properties of polygons. The presented approach can be considered as an alternative method to parallel processing.
Rights: Plný text není přístupný.
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1995_Alg-struct-slozitost.pdfPlný text631,27 kBAdobe PDFView/Open    Request a copy

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11827

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.