Line Clipping in E3 with Expected Complexity O(1)

by   Vaclav Skala, et al.

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.



page 11


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...

A Fast Algorithm for Line Clipping by Convex Polyhedron in E3

A new algorithm for line clipping against convex polyhedron is given. Th...

O(lgN) Line Clipping Algorithm in E2

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

Improved approximate near neighbor search without false negatives for l_2

We present a new algorithm for the c--approximate nearest neighbor searc...

Pre-processing of Domain Ontology Graph Generation System in Punjabi

This paper describes pre-processing phase of ontology graph generation s...

Design a Persian Automated Plagiarism Detector (AMZPPD)

Currently there are lots of plagiarism detection approaches. But few of ...

An improved helmet detection method for YOLOv3 on an unbalanced dataset

The YOLOv3 target detection algorithm is widely used in industry due to ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.