Title: Algorithms Complexity and Line Clipping Problem Solutions
Authors: Skala, Václav
Citation: Edugraphics'97 Compugraphics'97, p. 30-34.
Issue Date: 1997
Publisher: GRASP
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/11732
ISBN: 972-8342-02-0
Keywords: složitost algoritmu;počítačová grafika;optimální algoritmus
Keywords in different language: algorithm complexity;computer graphics;optimal algorithm
Abstract: Algorithm complexity is very often used for comparison of different algorithms in order to assess theirs properties. Nevertheless there are some other factors like actual speed for the expected applications, memory needed and others that might influence the final behaviour of the proposed algorithm. The aim of this contribution is to demonstrate some thoughts and connection between algorithm complexity, speed and discuss the influence of possible pre-processing to the final algorithm complexity. It will be also shown how some precise formulations could lead to better and faster algorithms to decrease algorithm complexity. The influence of pre-processing will be analysed according to the algorithm complexity change.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
1997_Alg-Compl-Final-1_97.pdfPlný text317,56 kBAdobe PDFView/Open    Request a copy

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

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