| Computers Forum Index » Computer - Graphics (Algorithms) » Quadtree Implementation |
|
Page 1 of 1 |
|
| Author |
Message |
| PengYu.UT@gmail.com |
 Posted: Sat Jun 04, 2005 11:06 pm |
|
|
|
Guest
|
|
| Back to top |
|
|
|
| vsgdp |
| Posted: Sun Jun 05, 2005 7:03 pm |
|
|
|
Guest
|
<PengYu.UT@gmail.com> wrote in message
news:1117921365.286969.60590@g44g2000cwa.googlegroups.com...
This might not be too benificial to you, but if you understand binary trees,
and then apply it to binary space partitioning trees, generalizing to
quadtree and octree is pretty straightforward. I think the hardest part
people have with these tree structures is that they do not have a good
handle on recursion. |
|
|
| Back to top |
|
|
|
| PengYu.UT@gmail.com |
| Posted: Sun Jun 05, 2005 7:03 pm |
|
|
|
Guest
|
| Could you explain what you mean "a good handle on recursion"? Thanks! |
|
|
| Back to top |
|
|
|
| Bob |
| Posted: Mon Jun 06, 2005 9:07 pm |
|
|
|
Guest
|
"A good handle on ..." is an English idiom for "a clear understanding
of ...". "Recursion" is the calling of a function within that function
-- this is essentially the software implementation of an inductive
proof. |
|
|
| Back to top |
|
|
|
|
