An Algorithm for Line Clipping by Convex Polyhedron in E3 with O(N1/2) Complexity

dc.contributor.author	Skala, Václav
dc.date.accessioned	2015-01-20T07:30:49Z
dc.date.available	2015-01-20T07:30:49Z
dc.date.issued	1994
dc.description.abstract	A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N). The suggested algorithm has O(N) complexity. The suggested algorithm has O(N) complexity in worst case and expected O(N1/2) complexity. The speed up is achieved because of "known order" of triangles. Some principal results of comparisons of selected algorithms are presented and give some idea how the proposed algorithm could be used effectively.	en
dc.format	13 s.	cs
dc.format.mimetype	application/pdf
dc.identifier.uri	http://hdl.handle.net/11025/11832
dc.language.iso	en	en
dc.rights	Plný text není přístupný.	cs
dc.rights.access	closedAccess	en
dc.subject	ořezávání přímek	cs
dc.subject	konvexní polyhedron	cs
dc.subject	počítačová grafika	cs
dc.subject	složitost algoritmů	cs
dc.subject	geometrciké algoritmy	cs
dc.subject.translated	line clipping	en
dc.subject.translated	convex polyhedron	en
dc.subject.translated	computer graphics	en
dc.subject.translated	algorithm complexity	en
dc.subject.translated	geometric algorithms	en
dc.title	An Algorithm for Line Clipping by Convex Polyhedron in E3 with O(N1/2) Complexity	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