New Fast Line Clipping Algorithm in E2 With O(IgN) Complexity

dc.contributor.author	Huy, Bui Duc
dc.contributor.author	Skala, Václav
dc.date.accessioned	2014-09-16T08:15:47Z
dc.date.available	2014-09-16T08:15:47Z
dc.date.issued	1999
dc.description.abstract	New faster line clipping algorithm in E2 against a convex polygon with O(lgN) complexity 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	8 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Spring Conference on Computer Graphics SCCG 1999: Conference Proceedings, p. 221-228.	en
dc.identifier.isbn	80-223-1357-2
dc.identifier.uri	http://hdl.handle.net/11025/11729
dc.language.iso	en	en
dc.publisher	Univerzita Komenského	cs
dc.relation.ispartofseries	Spring Conference on Computer Graphics SCCG 1999	en
dc.rights.access	openAccess	en
dc.subject	algoritmy	cs
dc.subject	počítačová grafika	cs
dc.subject	komplexita algoritmů	cs
dc.subject	konvexní polygon	cs
dc.subject.translated	algorithms	en
dc.subject.translated	computer graphics	en
dc.subject.translated	algoritms complexity	en
dc.subject.translated	convex polygon	en
dc.title	New Fast Line Clipping Algorithm in E2 With O(IgN) Complexity	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