Algoritmy se strukturální složitostí menší než optimální aneb K čemu je programování

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.