Papers
Topics
Authors
Recent
Search
2000 character limit reached

A New Algorithm for Pyramidal Clipping of Line Segments in E3

Published 3 Jan 2022 in cs.CG and cs.GR | (2201.00587v1)

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

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Vaclav Skala 
  2. Duc Huy Bui 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up