Unverified50% confidenceFactExact time
BVH (Bounding Volume Hierarchy) recursively wraps scene geometry with axis-aligned bounding boxes to form a binary tree, reducing ray intersection complexity from O(n) to O(log n).
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe HNSW algorithm reduces ANN retrieval time complexity from O(N) to O(log N) by constructing a multi-layer proximity graph, and performs better in high-recall scenarios.61% similarUnverified法线贴图通过在低多边形网格表面存储法线方向偏移量，在不增加几何复杂度前提下模拟高细节表面的光照反应56% similarUnverified与树结构不同，DAG中一个节点可以有多个父节点，可以把不同探索分支的结论汇聚到同一个节点55% similarUnverified滑动窗口注意力将计算复杂度从O(n²)降至O(n×w)，是Mistral模型家族的核心创新之一55% similarUnverifiedFor a model with L layers, H attention heads, and per-head dimension d, caching n tokens requires VRAM of 2 × L × H × d × n × (precision bytes).54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/827987API
curl https://kongchang.com/api/v1/knowledge/claims/827987MCP
get_claim(id=827987)