An optimal two-dimensional orthogonal range search algorithm in VLSI design automation

Yu Hsiang Pan, Kuo Tien Lee, Yung Hung Wang

研究成果: 書貢獻/報告類型會議論文篇章同行評審

2 引文 斯高帕斯(Scopus)

摘要

It is well known that an optimal algorithm for logarithm query time and linear storage for two dimensional orthogonal range searches is nonexistent except for very few cases in which certain computational models have been assumed. A new algorithm called sliding kd tree is presented in this article where the length of the query box is fixed in any direction. The new algorithm is optimal in handling two-dimensional problems, and can be applied to VLSI Design Automations presented to show the performance of the SKD algorithm.

原文???core.languages.en_GB???
主出版物標題3CA 2010 - 2010 International Symposium on Computer, Communication, Control and Automation
頁面53-56
頁數4
DOIs
出版狀態已出版 - 2010
事件2010 International Symposium on Computer, Communication, Control and Automation, 3CA 2010 - Tainan, Taiwan
持續時間: 5 5月 20107 5月 2010

出版系列

名字3CA 2010 - 2010 International Symposium on Computer, Communication, Control and Automation
1

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???2010 International Symposium on Computer, Communication, Control and Automation, 3CA 2010
國家/地區Taiwan
城市Tainan
期間5/05/107/05/10

指紋

深入研究「An optimal two-dimensional orthogonal range search algorithm in VLSI design automation」主題。共同形成了獨特的指紋。

引用此