Explain about franklin algorithm, Data Structure & Algorithms

Assignment Help:

Explain about Franklin Algorithm

We mentioned how the number of possible comparisons of polygons grows as the square of the number of polygons in the scene. Many of the hidden-surface algorithms exhibit this behaviour and have serious performance problems on complex scenes. Franklin developed an approach which gives linear time behaviour for most scenes. This is done by overlaying a grid of cells on the scene (similar to Warnocks approach, only these cells Visual Realism are not subdivided). The size of the cells is on the order of the size of an edge in the scene. At each cell the algorithm looks for a covering face and determines which edges are in front of this face. It then computes the intersections of these edges and determines their visibility. The idea is that as objects are added to the scene and the number of polygons increases, the new objects will either be hidden by objects already in the scene or will hide other objects in the scene. While the number of objects increases, the complexity of the final scene (after hidden portions are removed) does not increase. By considering only the edges in front of the covering face for a cell, the algorithm considers only the edges likely to be in the final image. Although the total number of edges may increase, this increase occurs, for the most part, behind the covering faces, and the number of edges in front will remain small.

 


Related Discussions:- Explain about franklin algorithm

Queue, 1. Show the effect of each of the following operations on queue q. A...

1. Show the effect of each of the following operations on queue q. Assume that y (type Character) contains the character ‘&’. What are the final values of x and success (type boole

Determine the stereo vision, Determine the stereo vision There is still...

Determine the stereo vision There is still one more major item missing, before we can look at a computer display or plot and perceive it just as we see a real object, namely th

Sequential files, Data records are stored in some particular sequence e.g.,...

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th

Determine the area subdivision method, Area Subdivision Method In this ...

Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo

Programs, Develop a program that accepts the car registration( hint: LEA 43...

Develop a program that accepts the car registration( hint: LEA 43242010)

Prefix and Postfix Expressions, Q.   Draw the expression tree of the infix ...

Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

Tower of hanoi problem., Write an algorithm for getting solution to the Tow...

Write an algorithm for getting solution to the Tower's of Hanoi problem. Explain the working of your algorithm (with 4 disks) with appropriate diagrams. Ans: void Hanoi(int

Advantages of first in first out method, Advantages of First in First out (...

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Collision resolution techniques, complete information about collision resol...

complete information about collision resolution techniques

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