7 replies to this topic

[v71]

Good day , has anyone had any luck with Stan Melax 's convex hull code ?
I tried to integrate in my works and i found it leaks memory quite a lot.
I couldn't fix the problem since the leaks aren't reported by visual studio with accuracy.
I know that the code is used in bullet and in other software , how can it be if it is a memory eater ?
By the way i tried to refactor it using stl with no luck.
It is very difficult to follow and it is written in a criptic way, actually there are even pieces of code that do absolutely nothing!

[v71]

Ok, problem solved, i wrote my own convex hull library ,thanks to anyone for the help

[v71]

Would it be usefull for anyone if i posted the code here ?

[paul_nicholls]

v71 said:

Would it be usefull for anyone if i posted the code here ?

I'm sure it would be :lol:

cheers,
Paul

[.oisyn]

Is this a 2d or 3d convex hull?
.edit: ah 3d. Obviously, as the 2d convex hull algorithm is dead simple

[v71]

I was thinking to do an article on that , only if it would be of any use, because it would take a considerable amount of time.

[paul_nicholls]

v71 said:

I was thinking to do an article on that , only if it would be of any use, because it would take a considerable amount of time.

Just posting the code here would be fine for now :)

Thanks for your hard work v71 :)

cheers,
Paul

[JarkkoL]

Quick hull should be pretty simple to implement for 3D as well.