Sutherland hodgeman polygon clipping algorithm, Computer Graphics

Assignment Help:

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.  


Related Discussions:- Sutherland hodgeman polygon clipping algorithm

Multimedia, Multimedia- It is a new aspect of literacy which is being recog...

Multimedia- It is a new aspect of literacy which is being recognized as technology expands the manner people communicate. The principle of literacy increasingly, is a measure of th

Windowing transformations - raster graphics and clipping, Windowing Transf...

Windowing Transformations - Raster Graphics and  Clipping From the above section of introduction, we understood the meaning of the viewport and term window that could again be

Image processing, Image Processing New digital technology has made this...

Image Processing New digital technology has made this possible for the manipulation of multi- dimensional signals along with systems which range from easy digital circuits to

What are the different types of parallel projections, What are the differen...

What are the different types of parallel projections?  The parallel projections are basically divided into two types, depending on the relation among the direction of projectio

Determine the advantages of raster-scan systems, Determine the advantages o...

Determine the advantages of raster-scan systems (i)  Rasterisation is now performed faster since a special purpose processor is used. (ii)  The CPU is not slowed down by the

Composite transformations - 2-d and 3-d transformations, Composite Transfor...

Composite Transformations - 2-d and 3-d Transformations We can build complicated transformations as rotation regarding to an arbitrary point, mirror reflection about a line, a

Introduction of viewing transformations, Introduction of Viewing  Transfor...

Introduction of Viewing  Transformations Projection is fundamentally a transformation or mapping of 3D objects upon 2D screen. Projection is mostly categorised in Para

Acquire a transformation matrix for perspective projection, Acquire a trans...

Acquire a transformation matrix for perspective projection for a specified object projected onto x=3 plane as viewed by (5,0,0). Solution: Plane of projection: x = 3 as given.

What is transformation, What is Transformation?  Transformation is the ...

What is Transformation?  Transformation is the method of introducing changes in the shape size and orientation of the object using scaling rotation reflection shearing & transl

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