Cases of clip a line segment-pq, Computer Graphics

Cases of clip a line segment-pq

Case 1: As we determine a new value of tE that is value of parameter t for any potentially entering (PE) point we select tmax as:  tmax = max {tmax, tE}. The initial value of tmax = 0 is considered.

Case 2: As we find a new value of tL that is value of parameter t for any potentially leaving (PL) point then tmax value is updated by tmin = min {tmin, tL}. The initial value of tmin = 1 is considered.

At last when value of t for all edges are determined and if tmax < tmin then line is visible else not. As well as line is visible from

P + tmax (Q - P)        to   P + tmin (Q - P) that is

P + t (Q - P) hence tmax   ≤ t ≤ tmin

tmax < tmin       (draw line)

tmax < tmin       (reject line)

Posted Date: 4/3/2013 3:31:35 AM | Location : United States







Related Discussions:- Cases of clip a line segment-pq, Assignment Help, Ask Question on Cases of clip a line segment-pq, Get Answer, Expert's Help, Cases of clip a line segment-pq Discussions

Write discussion on Cases of clip a line segment-pq
Your posts are moderated
Related Questions
Question 1: (a) Once a selection is made, what area of the image can be edited? (b) What is the purpose of saving selections? (c) How can you move a selection while you a

Digital audio technologies DAB (Digital Audio Broadcasting) Digital Audio Tape (DAT) DVD DVD-A Digital audio player Compact disc (CD) Minidisc (obsolete

QUESTION (a) Explain the steps involved in performing Image based processing. (b) Propose a mask using a 3X3 matrix, which would help in discovering discontinuities, and hen

State whether the following statements are true or false. Give reasons/examples to justify your answer.  a)  Cavalier projection is a parallel projection. b)  Angles are not

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping


Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

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

What is cubic spline?  Cubic splines are a straight forward extension of the methods underlying parabolic spline. The total curve in this case is a sequence of arcs of cubic ra

Graphic Interchange Format (GIF): The Graphic Interchange Format is an efficient implies to transmit images across data networks. In the early 1990 year the original designers of