04/09/2017 – Solving Sutherland Hodgman Clipping in 3 Dimensions

  • Using the following algorithm
    • Found at: Sutherland-Hogman Clipping Algorithm
    • Create containers to hold the clipped points and a reference container for the plane points
      • Create a container to hold theĀ  edge normals that run parallel to the planes
      • Loop through the side planes and check each of the line segments in the incident plane against the edge normals
        • If both ends of the line are positive then the whole segment is inside the plane save the end point
        • If both are negative then the line segment is outside the plane save neither the start nor the end
        • If start is positive and end is negative then the line segment intersects the plane save the point of intersection
        • If the end is positive and the start is negative then save both the end and the point of intersection
      • Use the clipped points to return a point that can be projected onto the face
      • Use boht these points to find the point of intersection