A Comparison of 2D Line Clipping Algorithms

dc.contributor.author	Skala, Václav
dc.contributor.author	Kolingerová, Ivana
dc.contributor.author	Bláha, Petr
dc.date.accessioned	2015-01-19T12:45:47Z
dc.date.available	2015-01-19T12:45:47Z
dc.date.issued	1995
dc.description.abstract	A comparative study of new line clipping algorithms for 2D complex polygons is presented and the evaluation of algorithms' efficiency based on theoretical analysis and experimental results is given. Complexity of all compared algorithms is O(N).	cs
dc.format	9 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Machine Graphics and Vision. 1995, vol. 3, no. 4, p. 625-633.	en
dc.identifier.issn	1230-0535
dc.identifier.uri	http://hdl.handle.net/11025/11829
dc.language.iso	en	en
dc.relation.ispartofseries	Machine Graphics and Vision	cs
dc.rights.access	openAccess	en
dc.subject	ořezávání přímky	cs
dc.subject	konvexní polygon	cs
dc.subject	algoritmy duálního prostoru	cs
dc.subject	počítačová grafika	cs
dc.subject.translated	line clipping	en
dc.subject.translated	convex polygon	en
dc.subject.translated	dual space application	en
dc.subject.translated	computer graphics	en
dc.title	A Comparison of 2D Line Clipping Algorithms	cs
dc.type	článek	cs
dc.type	article	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