![]() |
Re: Optimizing waypoint graph using an Octree
that's a good reason, but you could still organise your walkfaces like in the bsp, so you'd still have a nice method to search.
anyway, optimizing this one function isnt the most important topic we are working on :) |
Re: Optimizing waypoint graph using an Octree
I meant to build one from the world data.
|
Re: Optimizing waypoint graph using an Octree
There's a very efficient library for searching nearest neighbours in arbitrary dimensions. Have a look here
Internally, it uses different search strategies like kd-trees etc that you rather don't want to code yourself if you don't have to. I've tried it, works great. |
Re: Optimizing waypoint graph using an Octree
man, every year Killaruna creeps out of the grave =)
so what do you have in your basket this year? :D |
All times are GMT +2. The time now is 19:08. |
Powered by vBulletin® Version 3.8.2
Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.