Cases of clip a line segment-pq, Computer Graphics

Assignment Help:

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)


Related Discussions:- Cases of clip a line segment-pq

Graphic interchange format (gif), Graphic Interchange Format (GIF): The Gr...

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

Phong shading algorithm, Q. Describe briefly phong shading algorithm.   ...

Q. Describe briefly phong shading algorithm.   OR                Write short note on phong shading.    Phong shading   Phong shading or normal vector interpo

Anti aliasing - modeling and rendering, Anti Aliasing - Modeling and Render...

Anti Aliasing - Modeling and Rendering It is a method for enhancing the realism of an image through eliminating the jagged edges from it. Such jagged edges or "jaggies", appe

Explain bresenham''s circle drawing algorithm, Question 1 Explain Bresenha...

Question 1 Explain Bresenham's Circle Drawing Algorithm Question 2 Derive the matrix for inverse transformation Question 3 Discuss the following Raster Graphic Algorithm

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Education, Education, Training, Entertainment and Computer Aided Design ...

Education, Training, Entertainment and Computer Aided Design CAD or CADD is an acronym which depending upon who you ask, can stand for: I. Computer Assisted Design. II.

Bresenham rasterisation algorithm, 2. Describe how the Bresenham rasterisat...

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Explain any ten types of artistic filters, Question 1 Explain any ten type...

Question 1 Explain any ten types of artistic filters Question 2 What is Freehand Tool? Explain the procedure of drawing lines and curves with freehand tool Question 3 Ho

How to identify window area - raster graphics and clipping, A convex polygo...

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd