> > (I want to split a triangle into many triangles (but only 2 in one > > time)using one function recursing until the area of a triangle is smaller > > than a value. >
Oh yeah, for two at a time subdivsion, divide only the longest edge: > Input: > > 2 > / \ > / \ > / \ > / \ > / \ > 0-----------1 > Find the longest edge. The subdivisions will have three cases: > > 2 > /|\ > / | \ > / | \ > / | \ > / | \ > 0-----3-----1 subtris [0,3,2], [3,1,2] > 2 > / \ > / \ > / 3 > / \ > / \ > 0-----------1 subtris [0,1,3], [0,3,2] > 2 > / \ > / \ > 3 \ > / \ > / \ > 0-----------1 subtris [0,1,3], [1,2,3]. Doug Gehringer Sun Microsystems =========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA3D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
