Two New Algorithms for Line Clipping in E2 and Their Comparison

dc.contributor.author	Skala, Václav
dc.contributor.author	Bui, Duc Hui
dc.date.accessioned	2015-01-06T07:06:07Z
dc.date.available	2015-01-06T07:06:07Z
dc.date.issued	2000
dc.description.abstract	New efficient algorithms for the line clipping by the given rectangle in E2 are presented. The first algorithm is based on the line direction evaluation, the second one is based on a new coding technique of clipping rectangle’s vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too.	cs
dc.format	6 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Machine Graphics & Vision. 2000, vol. 9, no. 1/2, p. 297-306.	en
dc.identifier.issn	1230-0535
dc.identifier.uri	http://hdl.handle.net/11025/11803
dc.language.iso	en	en
dc.relation.ispartofseries	Machine Graphics & Vision	cs
dc.rights	© Warsaw University of Life Sciences	en
dc.rights.access	openAccess	en
dc.subject	ořezávání přímky	cs
dc.subject	počítačová grafika	cs
dc.subject	složitost algoritmů	cs
dc.subject	geometrické algoritmy	cs
dc.subject.translated	line clipping	en
dc.subject.translated	computer graphics	en
dc.subject.translated	algorithm complexity	en
dc.subject.translated	geometric algorithms	en
dc.title	Two New Algorithms for Line Clipping in E2 and Their Comparison	en
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