Scribd Logo
Upload

Welcome to Scribd!

  • Clipping Polygons - The Sutherland-Hodgman Algorithm

    Uploaded by

    Fellah
    16 views17 pages
    The Sutherland-Hodgman algorithm clips polygons by processing each vertex of the subject polygon against the edges of the clipping region. At each vertex, the algorithm adds 0, 1, or 2 vertices to the output based on whether the vertex is inside, outside, or on the edge of the clipping region. It handles 4 cases where the vertex can be fully inside, clipped to a new location, fully outside, or clipped to 2 new locations. The algorithm steps through each vertex recursively to clip the subject polygon.

    Original Description:

    Computer graphisc

    Original Title

    raster_clip2_inclass

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The Sutherland-Hodgman algorithm clips polygons by processing each vertex of the subject polygon against the edges of the clipping region. At each vertex, the algorithm adds 0, 1, or 2 vertices to the output based on whether the vertex is inside, outside, or on the edge of the clipping region. It handles 4 cases where the vertex can be fully inside, clipped to a new location, fully outside, or clipped to 2 new locations. The algorithm steps through each vertex recursively to clip the subject polygon.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views17 pages

    Clipping Polygons - The Sutherland-Hodgman Algorithm

    Uploaded by

    Fellah
    The Sutherland-Hodgman algorithm clips polygons by processing each vertex of the subject polygon against the edges of the clipping region. At each vertex, the algorithm adds 0, 1, or 2 vertices to the output based on whether the vertex is inside, outside, or on the edge of the clipping region. It handles 4 cases where the vertex can be fully inside, clipped to a new location, fully outside, or clipped to 2 new locations. The algorithm steps through each vertex recursively to clip the subject polygon.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 17

    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex.


    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Case 3 — no vertex added
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Case 3 — no vertex added (segment AB clipped out)
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Case 3 — no vertex added (segment AB clipped out)
    Case 4 — vertices A’ and B are added to the output
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Case 3 — no vertex added (segment AB clipped out)
    Case 4 — vertices A’ and B are added to the output (edge AB
    is clipped to A’B)
    Clipping polygons — the Sutherland-Hodgman algorithm

    Clipping polygons would seem to be quite complex. A single


    polygon can actually be split into multiple polygons (can you
    draw an example?).
    The Sutherland-Hodgman algorithm clips a polygon against all
    edges of the clipping region in turn.
    The algorithm steps from vertex to vertex, adding 0, 1, or 2
    vertices to the output list at each step.
    inside outside inside outside inside outside inside outside
    B A’ A
    A B
    B A
    B A B’

    Case 1 Case 2 Case 3 Case 4

    Assuming vertex A has already been processed,


    Case 1 — vertex B is added to the output list
    Case 2 — vertex B’ is added to the output (edge AB is clipped
    to AB’)
    Case 3 — no vertex added (segment AB clipped out)
    Case 4 — vertices A’ and B are added to the output (edge AB
    is clipped to A’B)
    1
    Typically, this is coded recursively — the recursive implemen-
    tation lends itself to efficient hardware implementation.
    Typically, this is coded recursively — the recursive implemen-
    tation lends itself to efficient hardware implementation.

    This algorithm is actually quite general — the clip region can


    be any convex polygon in 2D, or any convex polyhedron in 3D.
    Typically, this is coded recursively — the recursive implemen-
    tation lends itself to efficient hardware implementation.

    This algorithm is actually quite general — the clip region can


    be any convex polygon in 2D, or any convex polyhedron in 3D.

    You might also like