Unverified50% confidenceFactExact time
A BVH is a standard spatial data structure for accelerating intersection tests in ray tracing, reducing naive O(n) traversal to approximately O(log n).
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedDFS借助栈或递归实现，时间复杂度为O(V+E)，广泛应用于拓扑排序、连通分量检测和环路判断58% similarUnverifiedHNSW以接近O(log n)的复杂度找到近似最优解，并支持动态插入新向量而无需重建整个索引58% similarUnverifiedBFS借助队列实现，从源节点逐层访问相邻节点，时间复杂度为O(V+E)，是求无权图最短路径的经典方法57% similarUnverified词云主流实现采用螺旋线扩展算法配合基于四叉树的空间索引，将碰撞检测时间复杂度从O(n²)降低至O(n log n)量级57% similarUnverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1038932API
curl https://kongchang.com/api/v1/knowledge/claims/1038932MCP
get_claim(id=1038932)