Access Structures for an Image Data Base.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Computer Vision and Pattern Recognition Unit (CVPR-Kolkata)


Parui, Swapan Kumar (CVPR-Kolkata; ISI)

Abstract (Summary of the Work)

A new indexing structure called Spatial kd-Tree is proposed in the book named, Ef-ficient Query processing in Geographic Infomation Systems by Beng Chi Ooi. The new structure supports two types of search, namely the Containment search and Intersec- tion search in order to facilitate the evaluation of queries involving spatial (geometric) objects. I have implemented the skd-tree structure for isothetic rectangular objects for retrieving all objects which are contained in or intersect with the isothetic query rectangle. I have extended the structure and have seen its implementation for conve polygonal objects keeping the query rectangle as before (i.e, isothetic rectangle).Further extension is made for finding the intersection between convex polygonal object and isothetic rectangle and also for finding the area of the intersecting region.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.