HIDDEN LINE REMOVAL

Dhaval patel(12mmcc20) Saddam sabugar(12mmcc26)

INTRODUCTION

VISIBILITY OF OBJECT VIEWS

VISIBILITY TECHNIQUES a) MINIMAX TEST b) CONTAINMENT TEST

c) SURFACE TEST

SORTING AND COHERENCE FORMULATION & IMPLEMENTATION SAMPLE HIDDEN-LINE ALGORITHMS -THE PRIORITY ALGORITHM

CONCLUSION

DETERMINATION OF HIDDEN EDGES & SURFACESCHALLENGING PROBLEM IN COMPUTER GRAPHICS REMOVAL ALGORITHM-BUILT INTO LOCAL HARDWARE PROCESSORS OF GRAPHIC DISPLAY TO SPEED UP THEIR EXECUTION REMOVAL ALGORITHM-TWO TYPES i.e. HIDDEN LINE & HIDDEN SURFACE FORMER SUPPORTS VECTOR DEVICES WHILE LATTER SUPPORTS RASTER DISPLAY

 VISIBILITY

RELY ON LOCATION OF VIEWING EYE,DIRECTION,PROJECTION TYPE & DEPTH LINE REMOVAL OF PERSPECTIVE VIEW IS DIIFICULT THAN ORTHOGRAPHIC VIEW COMPARISON-A CENTRAL CRITERION USED BY HLA TO DETERMINE VISIBILITY

HIDDEN

DEPTH

 IF

DEPTH COMPARISON SOLELY USEDPROBLEMS ENCOUNTERED,RESULTS INTO SLOW CALCULATION

TECHNIQUES

ARE THERE WHICH ESTABLISH RELATIONSHIP BETWEEN POLYGONS AND EDGES IN VIEWING PLANE

 KNOWN

AS OVERLAP OR BOUNDING BOX

TSES A POLYGON SURROUNDING BY A BOX & CHECKS FOR INTERSECTION OF ANY TWO BOXES IF TWO BOXES DOES NOT INTERSECT & POLYGONS DO NOT OVERLAP,NO FURTHER TESTING NEEDED IF MINIMAX TEST FAILS,POLYGONS MAY OR MAY NOT OVERLAP THEN COMPARISON TAKES PLACE

 THIS

TEST DETERMINES WHETHER A POINT LIES INSIDE A GIVEN POLYGON METHODS OF COMPUTING CONTAINMENT CONVEX POLYGON-USE X & Y COORDINATE AND LINE EQUATION NON CONVEX POLYGONINTERSECTION METHOD & ANGLE METHOD

THREE

FOR

FOR

 ALSO

CALLED AS BACK FACE OR DEPTH

TEST
EQUATION

OF PLANE IS UTILIZED = Ax+ by + cz + d = 0

IF

A GIVEN POINT IS NOT ON THE PLANE,LHS OF EQUATION HAS POSITIVE SIGN IF POINT LIES ON ONE SIDE OF PLANE AND NEGATIVE IF OPPOSITE CASE OCCURS.

 SORTING

OPERATE ON RECORD OF SCENE DATABASE SORTING IS AN OPERATION THAT ORDERS A GIVEN SET OF RECORDS AS PER SELECTED CRITERION COHERENCE IS A MEASURE OF HOW RAPIDLY A SCENE OR ITS IMAGE CHANGES COHERENCE IS AN AID USEFUL IN SORTING TECHNIQUES

THREE DIMENSIONAL SCENE DATA

TWO DIMENSIONAL IMAGE DATA

SORTING OF IMAGE DATA

APPLICATION OF VISIBILITY TECHNIQUES

ELIMINATION OF HIDDEN LINES OF IMAGE

DISPLAY OR PLOT THE RESULTS

 THERE

EXISTS WEALTH OF HIDDEN LINE ALGORITHM THAT UTILIZES ONE OR MORE OF THE VISIBILITY TECHNIQUES

PLANE

SWEEP PARADIGM,PRIORITY ALGORITHM,OVER-LAY ALGORITHM,AREA ORIENTED ALGORITHM ETC..........

Hidden line removal is an extension of wireframe model rendering where lines (or segments of lines) covered by surfaces are not drawn. Although the ability of the algorithm to correctly remove hidden lines is clear, the way in which the algorithm removes these lines is hard to see. Although much of the initial work in the field of hidden line removal was done by Arthur Appel, the field is still growing as there are exceptions when his algorithm is not effective.

THANK YOU FOR YOUR VALUABLE TIME