Full metadata record
DC FieldValueLanguage
dc.contributor.authorSkala, Václav
dc.date.accessioned2015-01-07T10:36:08Z-
dc.date.available2015-01-07T10:36:08Z-
dc.date.issued1996
dc.identifier.citationCompugraphics '96: Fifth International Conference on Computational Graphics and Visualization Techniques: Proceedings, p. 281-287.cs
dc.identifier.isbn972-8342-01-2
dc.identifier.urihttp://hdl.handle.net/11025/11808
dc.description.abstractA comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing complexity and the Cyrus-Beck algorithm is presented. The algorithm is based on the dual space representation and a space subdivision technique. The algorithm demonstrates that preprocessing can be used to speed up line clipping significantly. Theoretical analysis and detailed experimental results are also presented.en
dc.format7 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.relation.ispartofseriesCompugraphics '96en
dc.subjectořezávání přímkycs
dc.subjectkonvexní polygoncs
dc.subjectpočítačová grafikacs
dc.subjectgeometrické algoritmycs
dc.titleA Comparison of a New O(1) and the Cyrus-Beck Line Clipping Algorithms in E2en
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.subject.translatedline clippingen
dc.subject.translatedconvex polygonen
dc.subject.translatedcomputer graphicsen
dc.subject.translatedgeometric algorithmsen
dc.type.statusPeer-revieweden
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1996_Comparison_PGR96-O_1_.pdfPlný text386,04 kBAdobe PDFView/Open    Request a copy


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

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