How many times will vertex appear in the intersection points, Computer Graphics

Assignment Help:

1. For the polygon shown in Figure on the next page, how many times will the vertex V₁ appear in the set of intersection points for the scan line passing through that point? How many times will you count it when you form the pairs of intersection points? Justify your answer.

Answer: The vertex V₁ = V₄ will be counted once only since it is neither a maximum nor a minimum for y coordinates of the pairs of edges {V₀V₁,V₁V₂}and {V₃ V₄ , V₄ V₅} .

Related Discussions:- How many times will vertex appear in the intersection points

Line drawing - points and lines, Line Drawing - Points and lines Line ...

Line Drawing - Points and lines Line drawing is accomplished through computing the intermediate point coordinates along the line path between two given end points. Since, scre

What is a video transition, QUESTION 1. Describe two methods for conver...

QUESTION 1. Describe two methods for converting 16x9 widescreen movie to 4x3. 2. Explain clearly the difference between File Format and Codec. 3. What is a video transiti

Computer arthcther, How many 128 x 8 RAM chips are needed to provide a memo...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

Character Generation, Explain Various techniques of Character Generation Al...

Explain Various techniques of Character Generation Algorithm?

Basic graphics and mouse events, For this assignment, you will program a ga...

For this assignment, you will program a game called Pig. Pig is a two-player game where players compete to be the first to reach (or surpass) 100 points. Pig usually involves playe

Objectives of 2-d viewing and clipping, Objectives of 2-D Viewing and Clipp...

Objectives of 2-D Viewing and Clipping After going through this section, you should be capable to: 1. Describe the concept of clipping, 2. Observe how line clipping is p

Homogeneous coordinate systems - 2-d and 3-d transformations, Homogeneous C...

Homogeneous Coordinate Systems - 2-d and 3-d transformations Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a poin

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

3d primitive and composite transformations, 3D Primitive and Composite Tran...

3D Primitive and Composite Transformations Previously you have studied and implemented 2D geometric transformations for object definitions in two dimensions. These transformati

B-spline curves - uniform b-splines and de boor algorithm, B-spline curves ...

B-spline curves are piecewise smooth polynomial curves. B-spline curves are defined over an interval which has been partitioned into sub-intervals. On each subinterval B-sp

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages