摘要
PCB设计中大量空间数据的查询 ,采用普通的数据结构组织很难达到性能上的要求。针对这一问题 ,提出一种四维二叉树的结构 ,可有效地解决这个问题 ,使得查询复杂度在log(N)
Considering the high difficulty in meeting the performance requirement when using the common data structure in data searching ,this paper introduces a new four dimensional binary tree that provides the solution in an effective way, which makes the complicacy level in data searching lowed to log(N).
出处
《湘潭师范学院学报（自然科学版）》
2003年第4期46-47,共2页
Journal of Xiangtan Normal University (Natural Science Edition)
