Determine the warnock algorithm, Data Structure & Algorithms

Assignment Help:

Warnock's Algorithm

A divide and conquer algorithm

Warnock (PolyList PL, ViewPort VP)

If (PL simple in VP)

then Draw PL in VP,

else

Split VP vertically and horizontally into VP1, VP2, VP3, VP4

Warnock (PL in VP1, VP1)

Warnock (PL in VP2, VP2)

Warnock (PL in VP3, VP3)

Warnock (PL in VP4, VP4)

End

What does "simple" mean?

No more than one polygon in viewport

Scan convert polygon clipped to viewport

Viewport only 1 pixel in size

Shade pixel based on closest polygon in the pixel

 

1085_data structure.png


Related Discussions:- Determine the warnock algorithm

Brute force, Determine the number of character comparisons made by the brut...

Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text

Searching techniques, Searching is the procedure of looking for something. ...

Searching is the procedure of looking for something. Searching a list containing 100000 elements is not the similar as searching a list containing 10 elements. We discussed two sea

Complexity of quick sort, Q. What do you mean by the best case complexity o...

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

Definition of algorithm, Definition of Algorithm Algorithm must have th...

Definition of Algorithm Algorithm must have the following five characteristic features: 1.      Input 2.      Output 3.      Definiteness 4.      Effectiveness 5

Binary search, Write the algorithm for Binary search. Also apply this algo...

Write the algorithm for Binary search. Also apply this algorithm on the following data. 22, 44, 11, 88, 33, 55, 77, 66

What is solid modeling, What is Solid modeling Solid modeling is the mo...

What is Solid modeling Solid modeling is the most powerful of the 3-D modeling technique. It provides the user with complete information about the model. Defining an object wit

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit...

Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

Graph search using iterative deepening, Prove that uniform cost search and ...

Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste

Queues, what is the difference between data type and abstract data type

what is the difference between data type and abstract data type

Recursion, differences between direct and indirect recursion

differences between direct and indirect recursion

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