A Comparison of a New O(1) and the Cyrus-Beck Line Clipping Algorithms in E2

dc.contributor.author	Skala, Václav
dc.date.accessioned	2015-01-07T10:36:08Z
dc.date.available	2015-01-07T10:36:08Z
dc.date.issued	1996
dc.description.abstract	A 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.format	7 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Compugraphics '96: Fifth International Conference on Computational Graphics and Visualization Techniques: Proceedings, p. 281-287.	cs
dc.identifier.isbn	972-8342-01-2
dc.identifier.uri	http://hdl.handle.net/11025/11808
dc.language.iso	en	en
dc.relation.ispartofseries	Compugraphics '96	en
dc.rights.access	openAccess	en
dc.subject	ořezávání přímky	cs
dc.subject	konvexní polygon	cs
dc.subject	počítačová grafika	cs
dc.subject	geometrické algoritmy	cs
dc.subject.translated	line clipping	en
dc.subject.translated	convex polygon	en
dc.subject.translated	computer graphics	en
dc.subject.translated	geometric algorithms	en
dc.title	A Comparison of a New O(1) and the Cyrus-Beck Line Clipping Algorithms in E2	en
dc.type	konferenční příspěvek	cs
dc.type	conferenceObject	en
dc.type.status	Peer-reviewed	en
dc.type.version	publishedVersion	en

Files

Showing 1 - 1 out of 1 results

Showing 1 - 1 out of 1 results