Breadth-first search

Comment

Comment by Mateusz Zwierzycki on August 20, 2012 at 9:55am

https://www.dropbox.com/s/3ct98sorgnf6jl2/Top.JPG This is a 10k-polylines version - 500 ms to search it.

Comment by Mateusz Zwierzycki on August 20, 2012 at 9:47am

@Vicente : Thanks. It's just the beginning, it now only outputs each "level" as list. I need to make it more organized and then it will be used for finding mesh normals. For now its quite efficient : 150 ms for 2k polylines. It operates only on adjacency data tree (of integers) which is precalculated, so will be slower probably.

...and about colors : I see it as a good hippie t-shirt ;)

Comment by Vicente Soler on August 20, 2012 at 9:15am

Good job btw. You are using it fix flipped mesh normals right? How fast is it?

 

It looks like it's colored by distance but it's actually colored by the number of faces you have to cross to reach the start point. Maybe you could try coloring a mesh with very different face sizes to visualize it better.

Comment by Mateusz Zwierzycki on August 20, 2012 at 8:52am

youre right Vicente, I always had a problem with dth ght gth etc...

Comment by Vicente Soler on August 20, 2012 at 8:48am

Either you are missing a d or you need to have a mint.