Fast Algorithms for Line Segment and Line Clipping in E2

dc.contributor.author	Bui, Duc Huy
dc.contributor.author	Skala, Václav
dc.date.accessioned	2014-09-16T13:07:29Z
dc.date.available	2014-09-16T13:07:29Z
dc.date.issued	1997
dc.description.abstract	New modifications of the Cohen-Sutherland algorithm for the line and line segment clipping in E2 are presented. The suggested algorithms are based on a new coding technique based on coding of the line direction together with coding of end-points of the clipped line segment. It allows to solve all cases more effectively. The proposed algorithms are convenient for line or line segment clipping by the rectangle. Theoretical considerations and experimental results are also presented.	en
dc.format	8 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	SSCG'97 International Conference, p. 1-8.	en
dc.identifier.uri	http://hdl.handle.net/11025/11733
dc.language.iso	en	en
dc.relation.ispartofseries	SSCG'97 International Conference	en
dc.rights.access	openAccess	en
dc.subject	počítačová grafika	cs
dc.subject	komplexita algoritmů	cs
dc.subject	geometrické algoritmy	cs
dc.subject.translated	computer graphics	en
dc.subject.translated	algorithm complexity	en
dc.subject.translated	geometric algorithms	en
dc.title	Fast Algorithms for Line Segment and Line Clipping 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