Benchmark for Search Algorithms in Common Games Development Data I'm writing a benchmark for on data-oriented search algorithms and data structures in full details when there is a high need for efficient searching each frame and about what to choose depending on How cache friendly it can be Algorithm's order Insertion/Deletion frequency (how often data needs to change each frame) I have these Data Structures in mind right now Array (linear) Binary search trees B-trees Red Black Trees Hash Tables Bloom Filters I'm looking for common data used in games or graphics programming that is frequently modified and searched for to complete my benchmark. Data-Oriented Book uses Simple Toy Animation Data to benchmark linear search and binary search but I believe there's some data more challenging. https://ift.tt/eA8V8J

I'm writing a benchmark for on data-oriented search algorithms and data structures in full details when there is a high need for efficient searching each frame and about what to choose depending on How cache friendly it can be Algorithm's order Insertion/Deletion frequency (how often data needs to change each frame) I have these Data Structures in mind right now Array (linear) Binary search trees B-trees Red Black Trees Hash Tables Bloom Filters I'm looking for common data used in games or graphics programming that is frequently modified and searched for to complete my benchmark. Data-Oriented Book uses Simple Toy Animation Data to benchmark linear search and binary search but I believe there's some data more challenging.

from GameDev.net http://bit.ly/2XS3uae