Full metadata record
DC FieldValueLanguage
dc.contributor.authorSkala, Václav
dc.date.accessioned2015-01-07T09:34:35Z-
dc.date.available2015-01-07T09:34:35Z-
dc.date.issued1996
dc.identifier.citationComputers and Graphics. 1996, vol. 20, is. 4, p. 523-530.en
dc.identifier.issn0097-8493
dc.identifier.urihttp://dx.doi.org/10.1016/0097-8493(96)00024-6
dc.identifier.urihttp://hdl.handle.net/11025/11805
dc.description.abstractA new algorithm for line clipping by convex polygon with O(1) processing complexity is presented. It is based on dual space representation and space subdivision technique. The suggested algorithm also demonstrates that pre-processing can be used in order to speed up solution of some problems in computer graphics applications significantly. Theoretical considerations and experimental results are also presented.en
dc.format10 s.
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesComputers and Graphicsen
dc.rightsOriginal article published under copyright licence: © 1997, Elsevier. Citation of an original article: Skala,Václav. Line Clipping in E2 with O(1) Processing Complexity. Computers & Graphics. 1997, vol. 20, is. 4, p. 523-530. doi: http://dx.doi.org/10.1016/0097-8493(96)00024-6.en
dc.subjectořezávání přímekcs
dc.subjectkonvexní polygoncs
dc.subjectpočítačová grafikacs
dc.subjectsložitost algoritmůcs
dc.subjectgeometrické algoritmycs
dc.titleLine Clipping in E2 with O(1) Processing Complexityen
dc.typepreprintcs
dc.typepreprinten
dc.rights.accessopenAccessen
dc.type.versiondraften
dc.subject.translatedline clippingen
dc.subject.translatedconvex polygonen
dc.subject.translatedcomputer graphicsen
dc.subject.translatedalgorithm complexityen
dc.subject.translatedgeometric algorithmsen
dc.type.statusPeer-revieweden
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1996_CLIP95-1.pdfPlný text560,54 kBAdobe PDFView/Open


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

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