[KongchangAI]
Unverified50% confidenceFactExact time

两个 SDF 的并集、交集、差集可以通过对数值取 min/max/取反实现,无需网格裁剪

1
Sources
50%
Confidence
Long-term
Relevance
7/12/2026
First Seen

Sources

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/489436
API
curl https://kongchang.com/api/v1/knowledge/claims/489436
MCP
get_claim(id=489436)