leaf node

基本解釋

A node that has no children is called a leaf node.
沒有子節(jié)點的節(jié)點稱為“葉節(jié)點”。
In the document map, all of the text describing the books is stored in leaf elements; the text itself is the leaf node.
在文檔映射中,介紹書籍的所有文本存儲在葉元素中;文本本身就是葉節(jié)點。
To obtain to a leaf (data), ESE starts at the root node and follows the page pointers until it gets to the desired leaf node.
若要到達葉(數據),ESE會從根節(jié)點開始追溯頁指針,直到到達所需的葉節(jié)點。
By virtue of object-oriented concept, the efficient octree that stores object’s information in scene is constructed based on number oflayers and amount of leaf node link tables.
借助面向對象概念,根據層數和葉結點鏈表個數上限來構建存儲場景物體信息的高效八叉樹。
We optimize the storage of AABB bounding-volume and leaf node at the same time.The direct result is that it can save a large amount of space and speed up the algorithm.
實驗表明，利用AABB包圍盒和葉節(jié)點的存儲優(yōu)化，既減少了算法的存儲空間又加快了算法的執(zhí)行時間。