中文摘要：

顺序的点树提供最先进的技术因为使点模型变为，由重排层次根据为快显示在 GPU 上跑的几何错误顺序指。这篇论文论述一个看法依赖者方法由在层次点的顺序的表嵌入层次树结构扩充顺序的点树。由方法，二种索引被构造便于近从主要在一份订单显示到远方的点；从对粗糙好。作为结果，不可见的点能为硬件加速在高效率 view-dependently 被挑选，；同时，顺序的点树的优点能仍然充分被拿。因此，新方法能跑得比常规顺序的点树快得多，；当目标拥有复杂吸藏关系时，加速能高度特别地被支持；因为不可见的点将在在更好的层次的点的一个高百分比，仔细看了。

英文摘要：

Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.