A New Algorithm for Pyramidal Clipping of Line Segments in E3

01/03/2022
by   Vaclav Skala, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2012

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...
research
09/02/2020

A new heuristic algorithm for fast k-segmentation

The k-segmentation of a video stream is used to partition it into k piec...
research
01/09/2023

Line-Torus Intersection for Ray Tracing: Alternative Formulations

Intersection algorithms are very important in computation of geometrical...
research
01/21/2022

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...
research
01/06/2020

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

Traditional approaches to line segment detection typically involve perce...
research
01/03/2022

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...
research
04/29/2023

A Comprehensive Review of Image Line Segment Detection and Description: Taxonomies, Comparisons, and Challenges

Detection and description of line segments lay the basis for numerous vi...

Please sign up or login with your details

Forgot password? Click here to reset