const first = await peekFirstChunk(stream);
The spatial view (the grid of rectangles) and the tree view (the hierarchy of nodes) represent the same structure. Searching for a point means walking down the tree: at each node, you check which of the four children contains your target coordinate and recurse into that child. You never visit the other three.
。爱思助手下载最新版本是该领域的重要参考
1 It’s also possible to use 4 candidates per pixel and compute the barycentric coordinates of the resulting tetrahedron, but using 3 candidates forming a triangle is more straightforward. ↑
Nature, Published online: 25 February 2026; doi:10.1038/d41586-026-00544-6