您当前的位置:
首页 >
文章列表页 >
Build Kd-Tree for Virtual Scenes in a Fast and Optimal Way
更新时间:2025-07-16
    • Build Kd-Tree for Virtual Scenes in a Fast and Optimal Way

    • Acta Electronica Sinica   Vol. 39, Issue 8, Pages: 1811-1817(2011)
    • CLC: TP391
    • Published:2011

    移动端阅览

  • GUO Jie, XU Xiao-yang, PAN Jin-gui. Build Kd-Tree for Virtual Scenes in a Fast and Optimal Way[J]. Acta Electronica Sinica, 2011, 39(8): 1811-1817. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1873

下载量

5

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Review on Technology of Placement and Routing for the FPGA
A Salp Swarm Algorithm Based on Stepped Tent Chaos and Simulated Annealing
DReAC:A Novel Dynamically Reconfigurable Co-Processor
Hybrid Artificial Fish Swarm Optimization Algorithm Based on Mutation Operator and Simulated Annealing

Related Author

CHEN Lei
WANG Shuo
ZHOU Jing
ZHANG Yao-wei
PANG Yong-jing
ZHOU Chong
MA Xiao-jing
DU Zhong

Related Institution

Beijing Microelectronics Technology Institute
Department of Micro/nanoelectronics, School of Electronics Engineering and Computer Science, Peking University
Inner Mongolia Electromechanical Control Laboratory
Inner Mongolia University of Technology
北京应用物理与计算数学研究所第一研究室北京
0