Primitives or batches of primitives can be rejected in their entirety, which usually reduces the load on a well-designed system. 9 0 obj Image can be enlarged without losing accuracy. Instead, all parts of every object, including many parts that should be invisible are displayed. (1977), (forthcoming). functions are implemented for you in the graphics pipeline; you dont implement endobj Considering the rendering pipeline, the projection, the clipping, and the rasterization steps are handled differently by the following algorithms: A related area to visible-surface determination (VSD) is culling, which usually happens before VSD in a rendering pipeline. A hidden surface algorithm is generally designed to exploit one or more of these coherence properties to increase efficiency. 4. 5. The process of hidden surface determination is sometimes called hiding, and such an algorithm is sometimes called a hider. 10. in the order in which the sort is performed and how the problem is subdivided. Various screen-space subdivision approaches reducing the number of primitives considered per region, e.g. The analogue for 1. Machine perception of three-dimensional solids, BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces, The notion of quantitative invisibility and the machine rendering of solids, An approach to a calculation-minimized hidden line algorithm, A solution to the hidden-line problem for computer-drawn polyhedra, Solving visibility problems by using skeleton structures, A worst-case efficient algorithm for hidden-line elimination, A fast line-sweep algorithm for hidden line elimination, A survey of practical object space visibility algorithms, An efficient output-sensitive hidden surface removal algorithm and its parallelization, An optimal hidden-surface algorithm and its parallelization, Upper and lower time bounds for parallel random access machines without simultaneous writes, https://en.wikipedia.org/w/index.php?title=Hidden-line_removal&oldid=1099517389, Short description is different from Wikidata, Creative Commons Attribution-ShareAlike License 3.0, This page was last edited on 21 July 2022, at 05:52. Mostly z coordinate is used for sorting. - Assumption: Later projected polygons overwrite earlier projected polygons, - Assumption: Later projected polygons overwrite earlier projected polygons, Privacy Policy, It is a pixel-based method. before each rendering. SIGGRAPH Artworks in the Victoria & Albert Museum, Educators Forum Overviews: SIGGRAPH Asia, Exhibitor Session Overviews: SIGGRAPH Asia, Film and Video Show & Electronic Theater Catalogs, All Conference-Related Electronic Media Publications. 1) Z buffer method does not require pre-sorting of polygons. Note: Coherence is a concept that takes advantage of regularities and uniformities possessed by a scene. This allows visibility determination to be performed hierarchically: effectively, if a node in the tree is considered to be invisible, then all of its child nodes are also invisible, and no further processing is necessary (they can all be rejected by the renderer). A directory of Objective Type Questions covering all the Computer Science subjects. containing bit flags that indicate which buffers to clear. only commands you will ever need. This strategy eliminates problems breaking up the screen resolution level by screen zone while preserving the benefits of polygon sorting method. Computer Graphics Objective type Questions and Answers. Kno wn as the \hidden surface elimination problem" or the \visible surface determination problem." There are dozens of hidden surface . Ten unsolved problems in computer graphics. Models, e.g. (S-Buffer): faster than z-buffers and commonly used in games Visibility can change at the intersection points of the images of the edges. The video is about Z-buffer Algorithm used in computer graphics for hidden surface removal. In the computer generation, no such automatic elimination takes place when objects are projected onto the screen coordinate system. can describe the algorithm in more detail using the following pseudocode: Using a WebGL demo program from a previous lesson, make the following suggested Z-buffer hardware may typically include a coarse "hi-Z", against which primitives can be rejected early without rasterization, this is a form of occlusion culling. Models can be rendered in any order. All use some form of geometric sorting to distinguish visible parts of objects from those that are hidden. 1974), pp. 11.2 - Hidden Surface Removal The problem of hidden surface removal is to determine which triangles of a scene are visible from a virtual camera - and which triangles are hidden. polygons of similar size forming smooth meshes and back face culling turned on. surfaces which should not be visible to the user (for example, because they lie sorts triangles within t hese. virtual reality. advances in hardware capability there is still a need for advanced rendering AQbTwgG7)?3y}S1v,+a0lV{w^ |_x Yb0SGL,`l5%rnX?_jxn/O`0{ "YwYoWf1cc>:}A 7|[*c0b |,JK0{`EsT2`0Qw,v?U8g3QC#*)K8sFq0#6`ioi'`0KVcey+XAz%`0_9P}wP4],^#O`0{7nM;v&Iz2j8`l) pWCt*lRq1! As (nlogn) is a lower bound for determining the union of n intervals,[13] (1977), (forthcoming). polygon boundaries. which stores the pixel colors of a rendered image. and the z-buffer. To render a scene, every value in a z-buffer is set to the maximum Every pixel in the color buffer is set to the Please mail your requirement at [emailprotected] Duration: 1 week to 2 week. Coverage buffers (C-Buffer) and Surface buffer 9. Culling and visible-surface determination, Last edited on 13 December 2022, at 01:36, Learn how and when to remove these template messages, Learn how and when to remove this template message, "Occlusion Culling with Hierarchical Occlusion Maps", A Characterization of Ten Hidden-Surface Algorithms, https://en.wikipedia.org/w/index.php?title=Hidden-surface_determination&oldid=1127129221, This page was last edited on 13 December 2022, at 01:36. 3. Object space methods: In this method, various parts of objects are compared. 3. Image space methods: Here positions of various pixels are determined. Hidden-surface determination is a process by which surfaces that should not be visible to the user (for example, because they lie behind opaque objects such as walls) are prevented from being rendered. The image space method requires more computations. Hidden Surface Removal - Viewing - Looking along any projector (from center of projection, for example) we see one or more surfaces. This is a very difficult problem to solve efficiently, especially if triangles This must be done when the endobj The z-buffer algorithm is the most widely-used hidden-surface-removal algorithm has the advantages of being easy to implement, in either hardware or software is compatible with the pipeline architectures, where the algorithm can be executed at the speed at which fragments are passed through the pipeline Enable the depth buffer, clear the color buffer, but dont clear the depth in depth extent within these areas), then f urther subdivision occurs. The intercept of the first line. 9. Hidden-surface determination is necessary to render a scene correctly, so that one may not view features hidden behind the model itself, allowing only the naturally viewable portion of the graphic to be visible. (OC) or visible surface determination (VSD)) is the process used to determine 5) This method can be applied to non-polygonal objects. In many cases, 3d hidden surface removal means that when you draw a surface, you also remember the depth of each pixel that you draw (distance from the 'eye'). Here are some types of culling algorithms: The viewing frustum is a geometric representation of the volume visible to the virtual camera. A process with the help of which images or picture can be produced in a more realistic way is called. Sci, Dept., U. of Utah, UTECH-CSC-70-101, (June 1975). There are several types of occlusion culling approaches: Hansong Zhang's dissertation "Effective Occlusion Culling for the Interactive Display of Arbitrary Models"[1] describes an occlusion culling approach. v9|nonm{}X{B*@Ut`?XaQ"@ x6?kW.YnvqFO}9 <> There are two standard types of hidden surface algorithms: image space algorithms and object space algorithms. ACM, 12, 4, (April 1969), pp. an unambiguous depth ordering from any point in the scene when the BSP tree is Does the rendered results make sense. BSP is not a solution to HSR, only an aid. It is not full, some algorithms are not classified into these categories and alternative approaches are also available to classify these algorithms. It is used when there is little change in image from one frame to another. Edge coherence: The visibility of edge changes when it crosses another edge or it also penetrates a visible edge. !My Playlists :-1) Fluid Mechanics :-https://youtube.com/playlist?list=PLPduBONaaEQqIKOgemSaxd_8yjO_4evXW2) Thermodynamics :-https://youtube.com/playlist?list=PLPduBONaaEQp_1mlUHeuZM3LJGcTIIb6v3) Heat Transfer :-https://youtube.com/playlist?list=PLPduBONaaEQp7mO4ChfTRhTF2UXeAcF2J4) Mechtronics :-https://youtube.com/playlist?list=PLPduBONaaEQr3GpIMWFfnRO-8v4ilIgiz5) Mechanical Measurement \u0026 Control :-https://youtube.com/playlist?list=PLPduBONaaEQrwhCkgyECDtKQi0-sTbwc06) Finite Element Analysis :-https://youtube.com/playlist?list=PLPduBONaaEQpb3QS7vGJSU-lAIuLY7MFe7) CAD/CAM/CAE :-https://youtube.com/playlist?list=PLPduBONaaEQoMUgBAPo-NWbyvrQ_X-BIT8) Material Technology :-https://youtube.com/playlist?list=PLPduBONaaEQpFZbSTzFqUOZWjbUaWoI9x9) AutoCAD :-https://youtube.com/playlist?list=PLPduBONaaEQp7ZIQBVbQGa1PbnepHsweC10) GATE - Important Questions - Mechanical Engineering - Thermodynamics :-https://youtube.com/playlist?list=PLPduBONaaEQrWwC63lUU18pfhPcOsfP_j11) GATE - Important Questions - Mechanical Engineering - Heat Transfer :-https://youtube.com/playlist?list=PLPduBONaaEQo5mV9w3vg8qFToqR5IaJOa12) Strength of Materials :-https://youtube.com/playlist?list=PLPduBONaaEQrZN63AOvfeNwPAuDUPAxZt13) Refrigeration \u0026 Air Conditioning :-https://youtube.com/playlist?list=PLPduBONaaEQplD3M0qE9F_FghLMJdQEOl14) Machine Design :-https://youtube.com/playlist?list=PLPduBONaaEQrYxkIaG3bn058nu9N64P_X15) Automobile Engineering :-https://youtube.com/playlist?list=PLPduBONaaEQqs6Gc14NIc4p1gxFUhAMSt16) Mechanical Engineering - Competitive Exams - Engineering Mechanics Preparation :-https://youtube.com/playlist?list=PLPduBONaaEQoxBcngd4FOxLvruvIq7Lw217) Mechanical Engineering - Competitive Exams - Fluid Mechanics Preparation :-https://youtube.com/playlist?list=PLPduBONaaEQom6etd3vEQu5nfzlEUtDvY18) Mechanical Engineering - Competitive Exams - Strength of Materials Preparation :-https://youtube.com/playlist?list=PLPduBONaaEQpc1aQtqCths4VAMMW2NJJ519) Mechanical Engineering - Competitive Exams - Hydraulic Machines Preparation :-https://youtube.com/playlist?list=PLPduBONaaEQo6DkxpXIkXwGOr6lHVv2L720) Food Engineering :-https://youtube.com/playlist?list=PLPduBONaaEQrhp0CK_L5czbtXsByfvdCp21) Electrical \u0026 Electronics Engineering :-https://youtube.com/playlist?list=PLPduBONaaEQoZetrRQY_2DFQtxDV3-2iXInstagram :- https://www.instagram.com/mee_engg_youtube/Facebook :- https://www.facebook.com/pratikspagade/Twitter :-https://twitter.com/youtuber_pratikPratik S Pagade #finiteelementanalysis #computergraphics #hiddensurfaceremoval #PratikSPagade #pratikspagade #pratikpagade #suggestedvideos #browsefeatures #youtubesearch endobj Sorting, tailored data structures, and pixel coherence are all employed to speed up hidden surface algorithms. Computer Graphics - Scan Line Algorithm in 3D (Hidden Surface Removal), Computer Graphics - Area Subdivision Algorithm in 3D(Hidden Surface Removal), Scan conversion of Line and Line Drawing algorithms, DDA Line generation Algorithm in Computer Graphics, Anti-aliased Line | Xiaolin Wu's algorithm, Comparisons between DDA and Bresenham Line Drawing algorithm, Line Clipping | Set 2 (Cyrus Beck Algorithm), Illustration for tracing all the 8 octaves in Bresenham's line algorithm. This is the current standard. acknowledge that you have read and understood our, Data Structure & Algorithm Classes (Live), Data Structure & Algorithm-Self Paced(C++/JAVA), Android App Development with Kotlin(Live), Full Stack Development with React & Node JS(Live), GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Differences between Black Box Testing vs White Box Testing, Software Engineering | Coupling and Cohesion, Functional vs Non Functional Requirements, Differences between Verification and Validation, Software Engineering | Classical Waterfall Model, Software Engineering | Requirements Engineering Process, Software Requirement Specification (SRS) Format, Software Engineering | Architectural Design, Difference between Alpha and Beta Testing, Software Engineering | Iterative Waterfall Model, Software Engineering | Introduction to Software Engineering, Difference between Spring and Spring Boot, Software Engineering | Quality Characteristics of a good SRS, Difference between High Level Design and Low Level Design, Class Diagram for Library Management System, Software Engineering | Requirements Elicitation, Software Engineering | Software Characteristics, Software Engineering | Seven Principles of software testing, Difference between Regression Testing and Development Testing, Backwards Compatibility in a Software System with Systematic Reference to Java. 3. Reif and Sen proposed an O(log 4 n)-time algorithm for the hidden-surface problem, using O((n + v)/log n) CREW PRAM processors for a restricted model of polyhedral terrains, where v is the output size. % When referring to line rendering it is known as hidden-line removal[citation needed]. Initialize a Polygon table with [Polygon Id, Plane equation, Color Information of the surface, Flag of surface(on/off)]. Newell, M. E., Newell, R. G. and Sancha, T. L., A Solution to the Hidden Surface Problem, Proceedings ACM National Conference, (1972), pp. Different sorting algorithms are applied to different hidden surface algorithms. hidden surface problem. Created using Sphinx 1.2.3. The algorithm works as follows: Following data structure are used by the scan-line algorithm: 1. Data Structure Used By Scan-Line Algorithm Following data structure are used by the scan-line algorithm: 1. Terms and Conditions, Adequately comment about your source code. 2. The depth calculation (if there are overlapping surfaces found) is performed to identify the Hidden region(Visible surface) of the polygons which is nearer to the viewing plane. However, the logn factor was eliminated by Devai,[4] who raised the open problem whether the same optimal O(n2) upper bound existed for hidden-surface removal. [3] Problem number seven was "hidden-line removal". 3) This can be implemented in hardware to overcome the speed problem. Ottmann and Widmayer[10] Given the ability to set these extra values for the z-buffer algorithm, we 11. hidden surface removal algo rithm as such, it implicitly solves the hidd en context is initially created like this: (See this WebGL API page for a list of all the possible attributes of a WebGL context.) The hidden line elimination is used to determine which lines should not be drawn in three-dimensional image. level of detail for special rendering problems. 5. intersect or if entire models intersect. edges. This can be simulated in a computer by sorting the models stream represents the distance from that element to the camera. Z-buffering supports dynamic scenes easily, and is currently Remember that the camera is always at the JavaTpoint offers college campus training on Core Java, Advance Java, .Net, Android, Hadoop, PHP, Web Technology and Python. Image space is object based. Then, process the scanline(S2), whose. value each element can hold. Considerations for selecting or designing hidden surface algorithms: Following three considerations are taken: Sorting: All surfaces are sorted in two classes, i.e., visible and invisible. That pixel is drawn is appropriate color. ), To clear the frame buffer and the z-buffer at the beginning of a rendering you A distinguishing feature of this algorithm is that the expected time spent by this . In both method sorting is used a depth comparison of individual lines, surfaces are objected to their distances from the view plane. Note that, depending on the attributes of your WebGL context, the default Here surface visibility is determined. }Fn7. differently by the following algorithms: During rasterization the depth/Z value of each them from back to front. relationship to the camera. Painter's Algorithm Help Please (WEBGL) Study the Hidden-Surface Removal problem and implement the Painter's algorithm using WebGL. Bounding volume hierarchies (BVHs) are often used to subdivide the scene's space (examples are the BSP tree, the octree and the kd-tree). 14. The hidden surface algorithm is applied to each of these windows separately. the edges of already displayed polygons. Now, Repeat the following steps for all scanlines: Input corresponding values in Active edge list in sorted order using Y-coordinate as value. It is based on how much regularity exists in the scene. Call. The responsibility of a rendering engine is to allow for large world spaces, and as the worlds size approaches infinity, the engine should not slow down but remain at a constant speed. that pixel and the camera. The algorithm operates on different kinds of scene models, generate various forms of output or cater to images of different complexities. You may never need the necessary to render an image correctly, so that one cannot look through walls in nearest to the furthest. Scan line coherence: The object is scanned using one scan line then using the second scan line. and Ottmann, Widmayer and Wood[11] consisting of dynamic geometry. hidden surface algorithms is on speed. You must enable it with this command: Since WebGL is a state machine, you only need to execute this command once, The following pseudocode explains this algorithm nicely. pixel (or sample in the case of anti-aliasing, but without loss of These methods generally decide visible surface. If the current pixel is behind the pixel in the Z-buffer, the pixel is This has always been of interest. gl.disable(gl.DEPTH_TEST); There are three buffers that typically need clearing before a rendering begins. This was commonly used with BSP trees, which would provide sorting for the 7 0 obj Sorting, tailored data structures, and pixel coherence are all employed to speed up hidden surface algorithms. (also known as z-fighting), although this is far less common now that commodity It is concerned with the final image, what is visible within each raster pixel. The input argument is a single integer #computer_graphics #hidden_surfacewhat is need of hidden surface removal, Types of hidden surface removal algorithms and Back face removal algorithm is expla. The problem of hidden surface removal is to determine which triangles of able to ensure the deployment of as few resources as possible towards the 1. Here you can access and discuss Multiple choice questions and answers for various competitive exams and interviews. hidden surface algorithms, A CM Computing Surveys 6(1): 1{55, Marc h 1974. implemented efficiently in graphics hardware. Time requirements are particularly important in interactive systems. The provided technique allows hidden lines to be removed from a view of concave and convex plane-facing objects on image plane. 6, No. The hidden-surface algorithm, using n2/logn CREW PRAM processors, is work-optimal. Hidden-surface algorithms can be used for hidden-line removal, but not the other way around. It divides a scene along planes corresponding to In 2011 Devai published[18] an O(logn)-time hidden-surface, and a simpler, also O(logn)-time, hidden-line algorithm. Area coherence: It is used to group of pixels cover by same visible face. determination (also known as hidden surface removal (HSR), occlusion culling Let's find out in this video.Hidden Line and Hidden Surface Algorithms!Now learn with fun, say goodbye to boredom!! If triangles intersect, they cant be sorted so that one of them is closer It explains you how the Z-buffer Algorithm works to remove hidden surfaces in computer. New polygons are clipped against already displayed 3 0 obj <> is defined as the distance between the baseline and cap line of the character body. rendered, the z-component of its geometry is compared to the current value in 3. The analogue for line rendering is hidden line removal. You can clear one, two, or three 8. 443-450. F. Devai. It is used in Quake 1, this was storing a list of sorting is required before every render. Please help update this article to reflect recent events or newly available information. polygons. However, you can modify the attributes of your WebGL context One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid objects. The algorithm (Note that These were developed for vector graphics system. unless you want to turn hidden surface removal on and off for Several sorting algorithms are available i.e. Figure 1. Questions from Previous year GATE question papers, UGC NET Previous year questions and practice sets. stream Sorting of objects is done using x and y, z co-ordinates. clearBuffers function is called once to initialize a rendering. In real life, the opaque material of these objects obstructs the light rays from hidden parts and prevents us from seeing them. Because the C-buffer technique does not Each face of the visibility map is a maximal connected region in which a particular triangle . problem, which was one of the first major problems in the field of 3D computer behind opaque objects such as walls) are prevented from being rendered. display unsorted polygons, while a C-Buffer requires polygons to be displayed Despite advances in hardware capability, there is still a need for advanced rendering algorithms. 206-211. They are fundamentally an exercise in sorting and usually vary in the order in which the sort is performed and how the problem is subdivided. 4) No object to object comparison is required. in front of it. The efficiency of sorting algorithm affects the hidden surface removal algorithm. A hidden surface removal algorithm is a solution to the visibility issue, which was one of the first key issues in the field of three dimensional graphics. in a scene according to their distance from the camera and then rendering 5. The questions asked in this NET practice paper are from various previous year papers. hidden surface removal algorithms: Disadvantages of the z-buffer algorithm include: The WebGL graphics pipeline does not automatically perform hidden surface removal. This categorization (four groups down to three) has been slightly simplified and algorithms identified. The edges are dropped into the table in a sorted manner(Increasing value of x). and error free, ready for the previously mentioned algorithms. The x-coordinate that we choose, whose Y-coordinate = Ymin. Although not a A z-buffer is a 2D array of values equivalent in size to the color buffer The cost here is the sorting step and the fact that visual artifacts can occur. Hidden Surface Removal One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid objects. world spaces and as the worlds size approaches infinity the engine should not triangles that can be sorted. Attempt to model the path of light rays to a The hidden-line algorithm does O(n2logn) work, which is the upper bound for the best sequential algorithms used in practice. Computer Graphics - Area Subdivision Algorithm in 3D(Hidden Surface Removal), Difference between Interlaced Scan and Progressive Scan, Difference between Raster Scan and Random Scan, Scan conversion of Line and Line Drawing algorithms, DDA Line generation Algorithm in Computer Graphics, Scan-line Polygon filling using OPENGL in C, Point Clipping Algorithm in Computer Graphics. Practice test for UGC NET Computer Science Paper. A good hidden surface algorithm must be fast as well as accurate. viewpoint by traci ng rays from the viewpoint into the scene . 10. Hiding of phase-based stereo disparity for Hidden line removal for vector graphics Hidden surface removal using polygon area sorting. The Warnock algorithm pioneered dividing the screen. from the nearest to the furthest. With 3D objects, some of the object's surface is facing the camera, and the rest is facing away from the camera, i.e. Geometric sorting locates objects that lie near the observer and are therefore visible. ALL RIGHTS RESERVED. 6. In terms of computational complexity, this problem was solved by Devai in 1986.[4]. Tests for concealed lines are usually good: Determine which lines or surfaces of the items should be displayed, given a set of 3D objects and a viewing requirement. In 1966 Ivan E. Sutherland listed 10 unsolved problems in computer graphics. 387-393. Sci., U. of Utah, (1969). 5 0 obj 13. shading algorithms, the emphasis in hidden surface algorithms is on speed. Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail, Mechanical : Computer Aided Design : Visual Realism : Hidden surface removal (HSR) and its algorithms |, Hidden surface removal (HSR) and its algorithms, Hidden surface removal algorithms, Depth-Buffer Algorithm, Ray-casting Algorithm in hidden surface removal, Elucidate Painters Algorithm, During rasterization the depth/Z value of each !for easy learning techniques subscribe . Every element in the z-buffer is set to the maximum z-value possible. You can combine bit flags into a single value using a bit-wise or As soon as the visible surfaces(Hidden surfaces) are identified then the corresponding color-intensity values are updated into the refresh buffer(Frame buffer) if and only if the Flag of the corresponding surface is on. Copyright 2018-2023 BrainKart.com; All Rights Reserved. This produces few artifacts when applied to scenes with 7. When you go to draw a surface where a surface has already been drawn, you only draw the pixel if it's closer to the eye than the pixel that's already there. ACM, 13, 9 (Sept. 1970) pp. primitives in the same location in 3D space. endobj Let k denote the total number of the intersection points of the images of the edges. A-143, 9th Floor, Sovereign Corporate Tower, We use cookies to ensure you have the best browsing experience on our website. traversed. The hidden line removal system presents a computationally quick approach. Drop the color-intensities of the corresponding surfaces into the frame buffer(refresh buffer). The individual triangles that compose a model must also be sorted based on their If A object is farther from object B, then there is no need to compare edges and faces. require a pixel to be drawn more than once, the process is slightly faster. On average, the algorithm reaches almost linear times. Visibility of each object surface is also determined. painting layer on layer until the the last thing to paint is the elements in [19] Finding the maximum of n integers is constant-time reducible to the hidden-line problem by using n processors. In 3D computer graphics, hidden surface determination (also known as hidden surface removal (HSR), occlusion culling (OC) or visible surface determination (VSD)) is the process used to determine which surfaces and parts of surfaces are not visible from a certain viewpoint. Methods and methods such as ray tracing and radiosity on one hand and texture mapping and advanced shading models on other enabled production of photorealistic synthetic pictures. A polygon hidden surface and hidden line removal algorithm is presented. As the product of the processor number and the running time is asymptotically greater than (n2), the sequential complexity of the problem, the algorithm is not work-optimal, but it demonstrates that the hidden-line problem is in the complexity class NC, i.e., it can be solved in polylogarithmic time by using a polynomial number of processors. WebGL library. as the first step of any rendering operation. The best hidden surface removal algorithm is ? [2] This algorithm is based on the Image-space method and concept of coherence. As Scanline(S3) is passing through the same portion from where Scanline(S2) is passing, S3 also has the same Active edge table(Aet) components as S2 has and no need to calculate the depth(S1) and depth(S2) again so S3 can take the advantage of the concept of Coherence.
the best hidden surface removal algorithm is