Line Clipping in E3 with Expected Complexity O(1)

dc.contributor.author	Skala, Václav
dc.date.accessioned	2015-01-07T10:21:22Z
dc.date.available	2015-01-07T10:21:22Z
dc.date.issued	1996
dc.description.abstract	A new line clipping algorithm against convex polyhedron in E3 with an expected complexity O(1) is presented. The suggested approach is based on two orthogonal projections to E2 co-ordinate system and on pre-processing of the given polyhedron. The pre-processing enables to speed up solution significantly. The proposed method is convenient for those applications when many lines are clipped against constant convex polyhedron. Theoretical considerations and experimental results are also presented.	en
dc.format	12 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.citation	Machine Graphics and Vision. 1996, vol. 5, no. 4, p. 551-562.	en
dc.identifier.issn	1230-0535
dc.identifier.uri	http://hdl.handle.net/11025/11807
dc.language.iso	en	en
dc.publisher	Polska Akademia Nauk	en
dc.relation.ispartofseries	Machine Graphics and Vision	en
dc.rights.access	openAccess	en
dc.subject	ořezávání přímek	cs
dc.subject	konvexní mnohostěn	cs
dc.subject	počítačová grafika	cs
dc.subject	složitost algoritmů	cs
dc.subject.translated	line clipping	en
dc.subject.translated	convex tetrahedron	en
dc.subject.translated	computer graphics	en
dc.subject.translated	algorithm complexity	en
dc.title	Line Clipping in E3 with Expected Complexity O(1)	en
dc.type	preprint	cs
dc.type	preprint	en
dc.type.status	Peer-reviewed	en
dc.type.version	draft	en

Files

Showing 1 - 1 out of 1 results

Showing 1 - 1 out of 1 results