O(lg N) line clipping algorithm in E2

dc.contributor.author	Skala, Václav
dc.contributor.editor	Skala, Václav
dc.date.accessioned	2015-09-30T11:50:30Z
dc.date.available	2015-09-30T11:50:30Z
dc.date.issued	1994
dc.description.abstract-translated	A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.	en
dc.format	9 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Journal of WSCG. 1994, vol. 2, no. 1-2, p. 174-191.	en
dc.identifier.issn	1213-6972 (print)
dc.identifier.issn	1213-6980 (CD-ROM)
dc.identifier.issn	1213-6964 (online)
dc.identifier.uri	http://wscg.zcu.cz/wscg1994/wscg94.htm
dc.identifier.uri	http://hdl.handle.net/11025/16077
dc.language.iso	en	en
dc.publisher	Václav Skala - UNION Agency	cs
dc.relation.ispartofseries	Journal of WSCG	en
dc.rights	© Václav Skala - UNION Agency	cs
dc.rights.access	openAccess	en
dc.subject	počítačová grafika	cs
dc.subject	složitost algoritmu	cs
dc.subject	konvexní polygon	cs
dc.subject.translated	computer graphics	en
dc.subject.translated	algorithm complexity	en
dc.subject.translated	convex polygon	en
dc.title	O(lg N) line clipping algorithm in E2	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