Sutherland hodgeman polygon clipping algorithm, Computer Graphics

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of polygon vertices, we could first clip the polygon against the left rectangle boundary to produce a new sequence of vertices. The new set of vertices could then be successively passed to a right boundary clipper a bottom boundary clipper and a top boundary clipper as in Fig. 1. At each step a new sequence of output vertices is generated and passed to the next window boundary clipper. There are four possible cases when processing vertices in sequence around the perimeter of a polygon. As each pair of adjacent polygon vertices is passed to a window boundary clipper we made the following tests: (1) If the first vertex is outside the window boundary and the second vertex is inside, both the intersection point of the polygon edge with the window boundary and the second vertex are added to the output vertex list. (2) If both input vertices are inside the window boundary, only the second vertex is added to the output vertex list. (3) If the first vertex is inside the window boundary and the second vertex is outside. Only the edge intersection with the window boundary as added to the output vertex list. (4) If both input vertices are outside the window boundary, nothing is added to the output list. These four cases are illustrated in Fig. 2 successive pairs of polygon vertices. Once all vertices have been processed for one clip window boundary, the output list of vertices is clipped against the next window boundary. We illustrate this method by processing the area in Fig. 3 against the lift window boundary. Vertices 1 and 2 are found to be on the outside of the boundary. Moving along t vertex 3 which is inside we calculate the intersection and save both the intersection point and vertex 3. Vertices 4 and 5 are determined to be inside and they are also saved. The sixth and final vertex is outside so we find and save the intersection point. Using the five saved points, we would repeat the process for the next window boundary. Implementing the algorithm as we have just described requires setting up storage for an output list of vertices as a polygon is clipped against each window boundary. We can eliminate the intermediate output vertex lists by simply clipping individual vertices at each step and passing the clipped vertices onto the next boundary clipper. This can be done with parallel processors or a single processor and a pipeline of clipping routines. A point is added to the output vertex list only after it has been determined to be inside of on a window boundary by all four boundary clippers. Otherwise, the point does not continue in the pipeline. Figure 4 below shows a polygon and its intersection points with a clip window. In Fig. 4 we illustrate the progression of the polygon vertices in Fig. 3 through a pipeline of boundary clippers. The following procedure demonstrates the pipeline clipping approach. An array, s, records the most recent point that was clipped for each clip window boundary. The main routine passes each vertex p to the clip point routine for clopping against the first window boundary. If the line defined by endpoints  p and s crosses this window boundary, the intersection is calculated and passed to the next clipping stage. Any point that survives clipping against all window boundaries is then entered into the output array of points. The array first point stores for each window boundary the first point clipped against that boundaries. After all polygon vertices have been processed, a closing routine clips line defined by the first and last points clipped against each boundary.  

Posted Date: 7/1/2012 6:36:50 AM | Location : United States







Related Discussions:- Sutherland hodgeman polygon clipping algorithm, Assignment Help, Ask Question on Sutherland hodgeman polygon clipping algorithm, Get Answer, Expert's Help, Sutherland hodgeman polygon clipping algorithm Discussions

Write discussion on Sutherland hodgeman polygon clipping algorithm
Your posts are moderated
Related Questions

Advantage and Disadvantage of Plasma panel - Graphics Hardware Advantage 1. Slim design as Wall mountable 2. Larger than LCD screens Disadvantage

Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

BlackJack is a popular card game played in many casinos. The player plays against the dealer aiming to reach 21 points, or a score higher than the dealer without exceeding 21. The

mcqs of illustration in nts test

Background Texturing is like wallpapering; you are pasting an image onto the OpenGL Quad primitive.  Recall that GL_QUAD is specified by four vertices.  An image, or a texture,


What do you mean by scan conversion?  A main task of the display processor is digitizing a picture definition given in an application program into a set of pixel-intensity valu

Event Driven Devices - Polling Polling: The status of all devices is periodically checked in a repetitive manner through a polling loop. While an event happens, the loop is