Re: [Algorithms] theoretical clipping behavior
Brought to you by:
vexxed72
From: Daniel R. <Dan...@ho...> - 2000-11-01 18:46:01
|
hi andrew, probably i got somethign completely wrong, but i get much more tris than you do (already in 2d) and i believe that this is the same in 3d (but talking to a digital anviler makes me think that i miss a point here =0) take a look at the attached jpeg ;o) [best done in your favourite browser] my 2 cents, Daniel "SirLeto" Renkel [D.Renkel@FutureInt.de] technical design director - creactivity and technowhow Future Interactive [http://www.FutureInt.de] ----- Original Message ----- From: "Andrew Sega" <as...@di...> To: <gda...@li...> Sent: Wednesday, November 01, 2000 7:03 PM Subject: [Algorithms] theoretical clipping behavior > > In the midst of debugging a Sutherland-Hodgman style polygon clipper, I came > across an interesting question: > > Clipping a 2D triangle to a single plane will give you a most 2 resultant > triangles (when the plane cuts two edges). > Clipping a 2D triangle to a box (4 planes) will give you at most 5 resultant > triangles (when the box cuts through all four edges of the box). > > exxtending the question to 3D... > > How many potential triangles can you get by clipping an arbitrary 3D > triangle to an arbitrary 3D box (6 planes)? And how would one derive such a > result? > > - andrew > _______________________________________________ > GDAlgorithms-list mailing list > GDA...@li... > http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list > |