Extend the sutherland-hodgman clipping algorithm to clip
three- dimensional planes against a regular parallelepiped.
- 1 Answers
- 2537 Views
- Infosys, I also Faced
- E-Mail Answers
Answer Posted / Divya Gupta
The Sutherland-Hodgman clipping algorithm can be extended for 3D by generalizing the boundary lines, introducing a new type of polygon (polyhedron), and performing intersection tests in 3D space.n
1. Create a list of boundary planes for the parallelepiped.
2. For each polyhedron to clip, perform the following steps:n - Traverse all vertices of the polyhedron.n - Clip each vertex against each boundary plane using the Sutherland-Hodgman algorithm in 3D space.n - If a vertex is outside the parallelepiped after clipping, remove it from the polyhedron.
3. Traverse all edges of the remaining polyhedron and calculate the new vertices where they intersect (if any).
4. The final polyhedron is formed by the remaining vertices.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
No New Questions to Answer in this Category !! You can
Post New Questions
Answer Questions in Different Category
