-
This message is to report a linux compile warning/error in boost-1.81.0/geometry/algorithms/detail/overlay/sort_by_side.hpp. gcc shows -Wuninitialized at line 299, and is converted to a hard compile-…
-
### Is your feature request related to a problem? Please describe.
It would be great to introduce zip functions to mta lua to handle zip files directly.
Many libraries could be easily updated with z…
-
Looking at CPU profile data, BSP tree traversal is very expensive considering the amount of geometry it feeds to the GPU. It made sense for using the painter's algorithm to render small maps in softw…
-
There's going to be an awful lot of detail in the "Analysing trees" tutorial about fundamental operations like tree traversal. I wonder if we should hive that off into its own tutorial and reorganise …
-
### What is the expected enhancement?
Should be similar to the networkx API: https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_sea…
-
What algorithm (paper) do you use for BVH traversal?
How does performance of compute traversal compare to hardware (Vulkan) traversal?
-
Current algorithm seems to work for testing the scene AABB, but breaks down when navigating child nodes; need to keep iterating until I reach something more scalable, A simpler algorithm than what I'm…
-
This is an umbrella issue for various algorithms that might or should be implemented mid- to long-term.
---
**Clustering**
- [ ] Transitivity
**Connectivity**
- [ ] Is connected
- [x] …
-
Q-learning algorithm for your graph traversal problem:
-
Ray casting mechanism for octree traversal and chunk traversal.
- For chunk traversal bresenham's line algorithm would need to be used
- For octree traversal, it would need to be visited in fron…