Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph
Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.
Q. What is the need of using asymptotic notation in the study of algorithm? Describe the commonly used asymptotic notations and also give their significance.
a. Explain the sum of subset problem. Apply backtracking to solve the following instance of sum of subset problem: w= (3, 4, 5, 6} and d = 13. Briefly define the method using a sta
Question 1. How can you find out the end of a String? Write an algorithm to find out the substring of a string. 2. Explain the insertion and deletion operation of linked lis
Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using
Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but
A connected graph is a graph wherein path exists among every pair of vertices. A strongly connected graph is a directed graph wherein every pair of distinct vertices is connecte
Djikstra's algorithm (named after it is discovered by Dutch computer scientist E.W. Dijkstra) resolves the problem of finding the shortest path through a point in a graph (the sour
Explain about greedy technique The greedy method suggests constructing a solution to an optimization problem by a sequence of steps, every expanding a partially c
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd