원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
vol.3 no.1
2010.03
pp.1-12
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Spatial data is data related to space. In various application fields like GIS, multimedia information systems, etc., there is a need to store and manage these data. Some datastructures used for the spatial access methods are R tree and its extensions where objects could be approximated by their minimum bounding rectangles and Quad tree based structures where space is subdivided according to certain rules. Also another structure KD Tree is used for organizing points in a k dimensional space.
This paper makes review on some of these Hiearchical datastructures used for handling point data. It focuses on PR Quad Tree and KD Tree.The insertion procedure of these structures is reviewed and analyzed and also a comparison between them is drawn..
목차
Abstract
1. Introduction
2. Introduction to Quad Tree
3. PR Quad Tree
3.1. Introduction to PR Quad Tree
3.2. Insertion in PR Quadtree
3.3. Analysis of the Algorithm
4. The KD-Tree (Organization of point data)
4.1 Introduction to KD Tree
4.2. The Algorithm for Insertion in a KD Tree
4.3. Analysis of the Algorithm
5. Comparison Study
6. Conclusion
References
1. Introduction
2. Introduction to Quad Tree
3. PR Quad Tree
3.1. Introduction to PR Quad Tree
3.2. Insertion in PR Quadtree
3.3. Analysis of the Algorithm
4. The KD-Tree (Organization of point data)
4.1 Introduction to KD Tree
4.2. The Algorithm for Insertion in a KD Tree
4.3. Analysis of the Algorithm
5. Comparison Study
6. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보