hehehe.. thats what you get for drinking too much ;)
no use having a look at trees you're never going to use ;)
hehehe.. thats what you get for drinking too much ;)
no use having a look at trees you're never going to use ;)
But if they are better suited for one job, you know ways around the problem if oyu know about them. Thats a better solution the trying to make a tree fit your needs when it don't...Quote:
Originally posted by kedaman
hehehe.. thats what you get for drinking too much ;)
no use having a look at trees you're never going to use ;)
yeah but then you go look for the tree when you need it, not learn all sorts of stuff and then don't need it. Thats like going out and buy loads of stuff just because its cheap, then you figure out you don't actually need them
No that is not the same thing....it's more like
You go out, see things....now you know about them (reads the thory), but you don't buy them (implement them/use them). When you get to a situation where you need them (if you didn't read the theory, you don't know this tool is great for the job), then you know where to look for them.
Quote:
Bounding volume trees approach the problem diffrently then Oct/BSP/K-D trees. Instead of dividing space, bounding volume trees recursively divide a set of triangles into two subsets and fin a bounding volume that enclosure each subset. This approach avoids having to split triangles or include them in multiple nodes, and building a tree simply stops when a subset has only one remaining triangle. For more information on bounding volume tree, see [vandenBergen99]
yeah i was thinking about that too.. it was actually in the link i posted, they picked a wall and split everything in what was in front of and behind it.. its still a BSP tree after all
After reading more here, I am not so sure if you are right anyway....you are trying to bend the rules here....don't call everything you see a BSP tree...:D
Alle these structures are binary trees, they are just diffrent versions of it....ahha...let me draw again....:D
Here is how they are related...;)
And remember that all quad tree, oct tree and so on has a lot of diffrent way to bi implemented too....so I guess that there should have been one more level in that tree too..:D
http://vbforums.com/attachment.php?s=&postid=1663403
BTW I guess Heap and BS tree are Binary trees too...arn't they?
Best web page about K-D trees in the whole world I guess..:D
http://www.rolemaker.dk/nonRoleMaker...gem/kdtree.htm
no way note, they all partition space, and they are all binary ;) Heaps and.. do you mean BR tree? are binary trees yeah but they don't partitition spaceQuote:
Originally posted by NoteMe
Here is how they are related...;)
And remember that all quad tree, oct tree and so on has a lot of diffrent way to bi implemented too....so I guess that there should have been one more level in that tree too..:D
http://www.vbforums.com/
BTW I guess Heap and BS tree are Binary trees too...arn't they?
btw quad and oct are sort of malnamed, they should be Bool^2 and Bool^3
Yeah, that is what my image shows...they are all binary trees..but non of them is more related then that...all of the trees are "derived" from the binary tree, but no one of the others you see here are "derived" from BSP tree.Quote:
Originally posted by kedaman
no way note, they all partition space, and they are all binary ;) Heaps and.. do you mean BR tree? are binary trees yeah but they don't partitition space
Heap and BS (I ment BS tree) are also binary trees, but I didn't add them to the picture becuase they are not partitioning space...;)...
Quote:
Originally posted by kedaman
btw quad and oct are sort of malnamed, they should be Bin^2 and Bin^3
They are called quad (4) becuase it devides into 4 elements rather then 2, and there is no way you are ever going to make me say Binary^2 or what ever...
Last link I am up for today...
AABB tree tutroail
http://www.flipcode.com/dp/dpcolumn_issue05.shtml
Quote:
Originally posted by NoteMe
Yeah, that is what my image shows...they are all binary trees..but non of them is more related then that...all of the trees are "derived" from the binary tree, but no one of the others you see here are "derived" from BSP tree.
which is what i disagreed with because they all partition space
[/quote]
Heap and BS (I ment BS tree) are also binary trees, but I didn't add them to the picture becuase they are not partitioning space...;)... [/QUOTE]
whats a BS tree`? bull**** treè? :D
of course there is, i'm here to correct the stupid programmers who have named those things out of their stupid heads ;)Quote:
Originally posted by NoteMe
They are called quad (4) becuase it devides into 4 elements rather then 2, and there is no way you are ever going to make me say Binary^2 or what ever...
BS != Binary Sh! tree
BS == Binary Search tree
what is a BR tree?
Binary "rumpe" tree?
I must admitt that I don't understand what you disagree with me on the drawing....can you draw it like you meen...
Quote:
Originally posted by kedaman
of course there is, i'm here to correct the stupid programmers who have named those things out of their stupid heads ;)
BTW why did you change it too bool^2..that is even worse..
that sounds relatively cool, although I think two triangles can be inseparable stillQuote:
Originally posted by NoteMe
Last link I am up for today...
AABB tree tutroail
http://www.flipcode.com/dp/dpcolumn_issue05.shtml
lol.. binary search trees hehe :D I think all binary trees are search trees, why would you use trees if not for searching ;)Quote:
Originally posted by NoteMe
BS != Binary Sh! tree
BS == Binary Search tree
what is a BR tree?
Binary "rumpe" tree?
I must admitt that I don't understand what you disagree with me on the drawing....can you draw it like you meen...
BR means Black Red trees let me find a link
Quote:
Originally posted by kedaman
that sounds relatively cool, although I think two triangles can be inseparable still
Let me show you a drawing here too...just wait a bit...:D
No it is not actually the same...don't tell me that I have to draw that for you too....:D....it took me 4 og the 6 months of my ALgorith course to understand that it was not the same...I thought it was the same thing...Quote:
Originally posted by kedaman
lol.. binary search trees hehe :D I think all binary trees are search trees, why would you use trees if not for searching ;)
Heard of those....not sure what it is..never had them in our algorith class...Quote:
Originally posted by kedaman
BR means Black Red trees let me find a link
This is as long as I can go on my tree thingy....might happen that BS should have been a child node of Binary tree, and all the other child nodes of BS tree again...but I don't think that...no forget that...this is right...
http://vbforums.com/attachment.php?s=&postid=1663423
nope, it is sensible, I hope you've had your algebra done already,Quote:
Originally posted by NoteMe
BTW why did you change it too bool^2..that is even worse..
BOOL = { True, False }
BOOL^2 = BOOL X BOOL (cartesian product)
= {
(False, False),(False, True)
,
(True, False),(True, True)
}
X^2 are also called 2-tiples or 2-vectors, because they make up of 2 dimensions. A binary vector just make up a two dimensional binary spatial partitioning, True if X>Xboundary, otherwise false, for the X dimension, and True if Y>Yboundary, otherwise false for the Y dimension, and you should have all quandrants given by BOOL^2
Quote:
Originally posted by NoteMe
No it is not actually the same...don't tell me that I have to draw that for you too....:D....it took me 4 og the 6 months of my ALgorith course to understand that it was not the same...I thought it was the same thing...
hehe go ahead.. i was just guessing here i have to admit, but I can't see any other practical use without searching ;)
we had those, but they didn't bother explaining them, we had all sorts of other trees though, and if you work with C++ STL library uses a RB treeQuote:
Heard of those....not sure what it is..never had them in our algorith class...
hehe yeah, you could add, ATL trees and splay trees as well ;)Quote:
Originally posted by NoteMe
This is as long as I can go on my tree thingy....might happen that BS should have been a child node of Binary tree, and all the other child nodes of BS tree again...but I don't think that...no forget that...this is right...
http://www.vbforums.com/
btw i'm not sure if BS tree is a specific tree structure down there
But you first wrote bin (guess that means niary). Binary is 0/1Quote:
Originally posted by kedaman
nope, it is sensible, I hope you've had your algebra done already,
BOOL = { True, False }
BOOL^2 = BOOL X BOOL (cartesian product)
= {
(False, False),(False, True)
,
(True, False),(True, True)
}
X^2 are also called 2-tiples or 2-vectors, because they make up of 2 dimensions. A binary vector just make up a two dimensional binary spatial partitioning, True if X>Xboundary, otherwise false, for the X dimension, and True if Y>Yboundary, otherwise false for the Y dimension, and you should have all quandrants given by BOOL^2
1 = true
0 = false
and you have the same math as you did...
yeah sort of, i changed to boolean because binary is numeric, perhaps more in a technical sense rather than boolean which is theoreticalQuote:
Originally posted by NoteMe
But you first wrote bin (guess that means niary). Binary is 0/1
1 = true
0 = false
and you have the same math as you did...
I don't think there was any use in it...just to extract it to a theory plan, so we could understand it...I at least thing...and I don't want to open that JAVA book again...so please don't make me look for it..Quote:
Originally posted by kedaman
hehe go ahead.. i was just guessing here i have to admit, but I can't see any other practical use without searching ;)
Havn't used STl that much....but at least I know a tiny tiny bit about it...but not much...Quote:
Originally posted by kedaman
we had those, but they didn't bother explaining them, we had all sorts of other trees though, and if you work with C++ STL library uses a RB tree
It has to be it....where the bigger number goes to the right and a smaller numer goes to the left...unlike in a heap where the only thing you know is that the mother leaf is bigger then the child leaf....Quote:
Originally posted by kedaman
hehe yeah, you could add, ATL trees and splay trees as well ;)
btw i'm not sure if BS tree is a specific tree structure down there
Never learned about ATL or Splay either...:D
hehe ok, but then we have to remain sceptical on that thing ;)Quote:
I don't think there was any use in it...just to extract it to a theory plan, so we could understand it...I at least thing...and I don't want to open that JAVA book again...so please don't make me look for it..
Man.. you need to get into it, it helps your life loads :D if you are a C++ programmer that is ;)Quote:
Havn't used STl that much....but at least I know a tiny tiny bit about it...but not much...
Quote:
Originally posted by kedaman
yeah sort of, i changed to boolean because binary is numeric, perhaps more in a technical sense rather than boolean which is theoretical
OK....won't bother you with it anymore...I am never going to call it that anyway..;)
No don't do that....if you are you are forcing me to look it up....:DQuote:
Originally posted by kedaman
hehe ok, but then we have to remain sceptical on that thing ;)
Quote:
Originally posted by kedaman
Man.. you need to get into it, it helps your life loads :D if you are a C++ programmer that is ;)
Isn't it the vector classes and stuff like that in it...???? Yeah I am using C++ now days...only used the Vector class once (and not even sure if it is in STL..:D
AABB tree to the right and a drawing of it to the left....
http://vbforums.com/attachment.php?s=&postid=1663438
hehe i begin to doubt that you were listeining on that course, or maybe they didn't take up all the stuff because you had much other stuff ;)Quote:
Originally posted by NoteMe
It has to be it....where the bigger number goes to the right and a smaller numer goes to the left...unlike in a heap where the only thing you know is that the mother leaf is bigger then the child leaf....
Never learned about ATL or Splay either...:D
BTw, AVL trees, i mispelt ;) when adding a node in an AVL tree it does rotations on the nodes so that they weight about teh same on both sides, a splay tree, flattens the tree every time you pull up an element it does AVL rotations all the way until its on the top, so splay trees are especially good if you access the same things often.
PS: I wish that I had someone in my class like you....you are forcing me to read and learn all the time in a fun way...if I was just as glad to work at school I would probably have straight As...:D....
yeah doesn't make any difference anyway ;)Quote:
Originally posted by NoteMe
OK....won't bother you with it anymore...I am never going to call it that anyway..;)
Quote:
Originally posted by kedaman
hehe i begin to doubt that you were listeining on that course, or maybe they didn't take up all the stuff because you had much other stuff ;)
BTw, AVL trees, i mispelt ;) when adding a node in an AVL tree it does rotations on the nodes so that they weight about teh same on both sides, a splay tree, flattens the tree every time you pull up an element it does AVL rotations all the way until its on the top, so splay trees are especially good if you access the same things often.
We had a lot of sorting algorithms and graph representation too...and they thought us about hashing, interface and stuff like that....so there was a lot of JAva in it too..not that much theory...
Sounds nice with an AVL tree.....but if you make an quad three the right way in memory...then you can just use pointer aretmetric to reach the node you want....guess that works for most trees...
BTW we also forgot about
ABT (Adaptative Binary Tree).
B+ tree
ISAM tree
...:D
Quote:
Originally posted by NoteMe
No don't do that....if you are you are forcing me to look it up....:D
Hehehe :D look it up if you want, i'm staying sceptical here until you tell me how it is ;)
Yeah mostly containers of all sorts, some algortims, but the key concept are the iterators that connects themQuote:
Isn't it the vector classes and stuff like that in it...???? Yeah I am using C++ now days...only used the Vector class once (and not even sure if it is in STL..:D
http://www.sgi.com/tech/stl/index.html
cool, thats brilliantQuote:
Originally posted by NoteMe
AABB tree to the right and a drawing of it to the left....
http://www.vbforums.com/