A New Algorithm for Pyramidal Clipping of Line Segments in E3

by   Vaclav Skala, et al.

A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms.


page 1

page 2

page 3

page 4


Computation of the Hausdorff distance between sets of line segments in parallel

We show that the Hausdorff distance for two sets of non-intersecting lin...

A new heuristic algorithm for fast k-segmentation

The k-segmentation of a video stream is used to partition it into k piec...

Approximating the discrete and continuous median line segments in d dimensions

Consider a set P of n points in ℝ^d. In the discrete median line segment...

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

Two New Algorithms for Line Clipping in E2 and Their Comparison

Many algorithms for clipping a line by a rectangular area or a convex po...

MCMLSD: A Probabilistic Algorithm and Evaluation Framework for Line Segment Detection

Traditional approaches to line segment detection typically involve perce...

From line segments to more organized Gestalts

In this paper, we reconsider the early computer vision bottom-up program...