A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

by   Vaclav Skala, et al.

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 in the worst N case and expected O(sqrt(N))) 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 imagination how the proposed algorithm could be used effectively.


page 1

page 2

page 3

page 4


O(lgN) Line Clipping Algorithm in E2

A new O(lg N) line clipping algorithm in E2 against a convex window is p...

Algorithm for SIS and MultiSIS problems

SIS problem has numerous applications in cryptography. Known algorithms ...

A Novel Point Inclusion Test for Convex Polygons Based on Voronoi Tessellations

The point inclusion tests for polygons, in other words the point-in-poly...

Line Clipping in E3 with Expected Complexity O(1)

A new line clipping algorithm against convex polyhedron in E3 with an ex...

A Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3

A comparison of a new algorithm for line clipping in E2 and E3 by convex...

Does My Representation Capture X? Probe-Ably

Probing (or diagnostic classification) has become a popular strategy for...

Fast Verification of Convexity of Piecewise-linear Surfaces

We show that a realization of a closed connected PL-manifold of dimensio...