Clip a line segment - cyrus beck line clipping algorithm, Computer Graphics

How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex?

Solution: see the following figure 13, now the window is non-convex in shape and PQ is a line segment passing via this window. At this time two the condition of visibility of the line is tmax < tmin and the line is visible from P + tmax (Q - P) to P + tmin (Q - P), if tmax ? tmin then refuse the line segment. Then, applying this rule to the following figure, we get that when PQ line segment passes via the non convex window, it cuts the edges of the window at 4 points. 1→ PE; 2 → PL; 3 → PE; 4 → PL. In this illustration, utilizing the algorithm we refuse the line segment PQ but it is not the accurate result.

2388_Clip a Line Segment - Cyrus Beck line Clipping Algorithm.png

Figure: Example Cyrus Beck Clipping

State of visibility is satisfied in region 1-2 and 3-4 only when the line exists there although in region 2-3 the state is violated hence the line does not exists.

Posted Date: 4/3/2013 3:33:59 AM | Location : United States







Related Discussions:- Clip a line segment - cyrus beck line clipping algorithm, Assignment Help, Ask Question on Clip a line segment - cyrus beck line clipping algorithm, Get Answer, Expert's Help, Clip a line segment - cyrus beck line clipping algorithm Discussions

Write discussion on Clip a line segment - cyrus beck line clipping algorithm
Your posts are moderated
Related Questions
Methods of Animation - Computer Animation First method: in this, artist makes a succession of cartoon frames that are then combined in a film. Second method: in this,

Write a C-code which generates a font interactively.This means after every n mouse clicks, a Bezier curve is generated and then the terminal point of the last drawn Bezier curve is

In this programming assignment, you will animate and pose 3D articulated characters by implementing forward and inverse kinematic methods. You should be able to animate character j

Explain the different input modes used in interactive computer graphics.

computational algorithm for simulating the behavior of different physical and mathematical systems Monte Carlo methods are an extensively utilized class of computational algor

Summary of Graphic Primitives In this all section, we have illustrated the basic graphic primitives that are line, point and circle; we have also illustrated both practical an

#BLA for slope greater and equal to 1

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

1.   Do we have need of to generate the full circumference of the circle utilizing the algorithm or  can we can produces it in a quadrant or octant only and after that utilization

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a