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
Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

Ellipse generating algorithm: Algorithm is similar to circle algorithm. We divide the ellipse on the positive quadrant into two regions. Region 1 where the slope > -1, and Reg

What is resolution? Ans. The maximum number of points that can be shown without an overlap on a CRT is known as resolution.

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Phong shading OR Normal Vector Interpolation Shading In Gouraud shading we were doing direct interpolation of intensities although a more exact method for rendering a polygon

what is dda

Write a C-code that plots an object on the window and on the user's click of mouse on the window, the object starts rotating continuously until the user presses the mouse again.

Question: List five different areas of applications of computer graphics Answer: Five major areas of applications of computer graphics are:  i) Study of molecular structures.

Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo