Sorting in Space

Speaker:  Hanan Samet – College Park, MD, United States
Topic(s):  Graphics and Computer-Aided Design

Abstract

The representation of spatial data is an important issue in computer graphics, computer vision, geographic information systems, and robotics. A wide number of representations is currently in use. Recently, there has been much interest in hierarchical data structures such as quadtrees, octrees, R-trees, etc. The key advantage of these representations is that they provide a way to index into space.  In fact, they are little more than multidimensional sorts.  They are compact and depending on the nature of the spatial data they save space as well as time and also facilitate operations such as search.  In this talk we give a brief overview of hierarchical spatial data structures and related research results.  In addition we demonstrate the SAND Browser (found at http://www.cs.umd.edu/~brabec/sandjava) and the VASCO JAVA applet which illustrate these methods (found at http://www.cs.umd.edu/~hjs/quadtree/index.html).

About this Lecture

Number of Slides:  39
Duration:  60 - 90 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.