comp.graphics.algorithms
Subject: Clipping 3D Triangle by Convex Polyhedron
Hi,
I have a (hopefully) quite straightforward problem that I am having
trouble finding a solution to. I need to be able to clip a 3D triangle
by a 3D convex Polyhedron (which will always be an extruded triangle
itself into 3 dimensions).
At first I thought that I could just work out where each line of the
triangle intersected with the polyhedron and reduce the triangle in
this way but the more I have thought about it, the more I see that this
will not always work (e.g. if intersection occurs in the middle of the
triangle with and I need a more definite algorithm for this.
Any ideas?
Thanks,
Mark.
Reply
View All Messages in comp.graphics.algorithms
path:
Replies:
Re: Clipping 3D Triangle by Convex Polyhedron
Re: Clipping 3D Triangle by Convex Polyhedron
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.


