A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

01/01/2018
by   Vaclav Skala, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/01/2018

O(lgN) Line Clipping Algorithm in E2

A new O(lg N) line clipping algorithm in E2 against a convex window is p...
research
08/17/2020

Algorithm for SIS and MultiSIS problems

SIS problem has numerous applications in cryptography. Known algorithms ...
research
01/03/2022

Line Clipping in E3 with Expected Complexity O(1)

A new line clipping algorithm against convex polyhedron in E3 with an ex...
research
09/04/2022

Algorithm for Finding an Exact Maximum Distance in E2 with Oexp(N) Complexity: Analysis and Experimental Results

This paper describes a novel and fast, simple and robust algorithm with ...
research
07/30/2020

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...
research
11/15/2021

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...
research
08/07/2022

Fast O_expected(N) Algorithm for Finding Exact Maximum Distance in E^2 Instead of O(N^2) or O(N lg N)

This paper describes novel and fast, simple and robust algorithm with O(...

Please sign up or login with your details

Forgot password? Click here to reset