A General Quad Search Tree on Two-Dimension Data

Yuan Zhang; Hua Feng Ding; Wei Qing Wang; Xing Jiang Xiao; Jun Xu

doi:10.4028/www.scientific.net/AMR.179-180.1069

Paper Titles

Semi-Cylindrical Hyperlens Made of Al/MgO for 20nm Lithography Node
p.1047

A DCT-Based Blind Watermarking Algorithm for Vector Digital Maps
p.1053

Study on the Synthesis of Vinyl Ester and its Using as Thickener for SMC
p.1059

Research on Application and Development of Competitive Sports Simulation Based on Virtual Reality Technology
p.1063

A General Quad Search Tree on Two-Dimension Data
p.1069

Numerical Simulation of Infrared Nondestructive Testing to Metal Sample with Subsurface Defects
p.1075

The Markov Risk Model under Stochastic Discount Interest Force
p.1080

On a Risk Model with Dependence between Interclaim Arrivals and Claim Sizes with Multiple Thresholds under Stochastic Interest
p.1086

Prepare of Novel Zirconium Complex and Catalytic Performance for Ethylene Polymerization
p.1091

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 179-180A General Quad Search Tree on Two-Dimension Data

A General Quad Search Tree on Two-Dimension Data

Abstract:

In the plane coordinate system, x-coordinate and y-coordinate divide the plane into four quadrants. Combing the values of two-dimension data and the four quadrants, we can construct a general quad search tree easily. The quad search tree can be applied to all the two-dimension data. And, the height of the quad search tree can be reduced effectively, thus we can get a better search speed. The experiments have verified the validity and correctness of the quad search tree.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 179-180)

Pages:

1069-1074

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.179-180.1069

Citation:

Cite this paper

Online since:

January 2011

Authors:

Yuan Zhang, Hua Feng Ding, Wei Qing Wang, Xing Jiang Xiao, Jun Xu

Keywords:

Quad Tree, Search Tree, Two-Dimension Data

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Mao Guojun, Duan Lijuan, Wang Shi and Shi Yun: Principle and Algorithm of Data Mining (Second Edition)(Tsinghua University Press, 2007).

Google Scholar

[2] Yan Weimin and Wu Weimin: Data Structure (Tsinghua University Press, 1997).

Google Scholar

[3] Sun Zongcan, Tao Lan, Qi Jiandong and Wang Baoying, in: K-means clustering algorithm based on k-d tree, volume 25 of Computer Engineering and Design(2004).

Google Scholar

[4] He Yuanlie, Ying Zilu and Zhang Youwei: Using K-D Tree to Implement Effective Query Bimodal Multimedia Database, volume 18 of Computer Engineering and Applications (2003).

DOI: 10.1109/icosp.2002.1179965

Google Scholar

[5] Shao Fengjing and Yu Zhongqing: Principle and Algorithm of Data Mining(China WaterPower Press, 2003).

Google Scholar