Spatial data structures
- data structures for
- line-segments
- polylines
- curves
- rectangles
- applications
- Applications cover:
- computational geometry
- point location
- intersection queries
- range queries
- computer graphics
- representation of images
- conversions
- temporal databases
PREREQUISITES:
Basic sorting and searching algorithms. Traditional data structures both for main and secondary storage (e. g., dynamic balanced search trees, heaps, hashing, B-trees, etc.)
Este curso se dictará en inglés
Volver a ECI 1996