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

dc.contributor.authorSkala, Václav
dc.date.accessioned2015-01-19T12:13:37Z
dc.date.available2015-01-19T12:13:37Z
dc.date.issued1995
dc.description.abstractNew 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.en
dc.format6 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationInternational Conference Algorithms’95, Nizke Tatry, Slovak Republik, p. 221-226en
dc.identifier.urihttp://hdl.handle.net/11025/11827
dc.language.isoenen
dc.relation.ispartofseriesAlgorithms’95en
dc.rightsPlný text není přístupný.cs
dc.rights.accessclosedAccessen
dc.subjectpočítačová grafikacs
dc.subjectořezávání přímkycs
dc.subjectsložitost algoritmůcs
dc.subjectparalelní programovánícs
dc.subject.translatedcomputer graphicsen
dc.subject.translatedline clippingen
dc.subject.translatedalgorithm complexityen
dc.subject.translatedparallel processingen
dc.titleAlgoritmy se strukturální složitostí menší než optimální aneb K čemu je programováníen
dc.typepreprintcs
dc.typepreprinten
dc.type.statusPeer-revieweden
dc.type.versiondraften

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
Skala_1995_Alg-struct-slozitost.pdf
Size:
631.27 KB
Format:
Adobe Portable Document Format
Description:
Plný text
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections

OPEN License Selector