In article <Misc-4C3299.20020913092006@[EMAIL PROTECTED]
>,
Miss Elaine Eos <Misc@[EMAIL PROTECTED]
> wrote:
> I'm having trouble implementing the binary-tree algorithm described on
> <http://www.ldagames.com/seumas/progbintri.html>.
Ah, nevermind -- just me being stupid. <sigh>
My problems were two-fold:
1) When I allocated the original pair of triangles, I forgot to make
them each other's bottomNeighbors -- they were left unlinked.
2) In my actualSplit() routine, I originally had
if (mySize < 4) return (false)
to prevent over-splitting but, in a wild-grasp-at-straws, I changed it
to return true which, once I fixed (1), led to cra****ng with null
pointers.
My code now tessellates nicely.
As penance, I will start a web-site of sample code to help folks out,
and place the working vsn there.
Thanks for your time, sorry for the bother.
--
Please take off your pants or I won't read your e-mail.
I will not, no matter how "good" the deal, patronise any business which
sends
unsolicited commercial e-mail or that advertises in discussion newsgroups.
|
