Campus Event Calendar
Event Entry
What and Who
Data Structures for Orthogonal Range Searching
Christian Worm Mortensen
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 9 February 2004
13:30
30 Minutes
46.1 - MPII
024
Saarbrücken
Abstract
In this talk I will give an overview of the results I have
obtained during my first two years of ph.d. study and I
will present some of the main ideas I have used. All my work
so far has been about data structures for orthogonal range
searching in the RAM model of computation. One of the
problems I will consider in the talk is how to fully-dynamicaly
maintain a set of points in the plane such that given a query rectangle
(with sides parrallel to the coordinate axises) the points inside the
rectangle can be reported. I will sketch how this can be done using
time O(log n) per operation.
Contact
Christian Worm Mortensen
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Data Structures; Orthogonal Range Searching
Christian Worm Mortensen, 02/04/2004 14:08
Christian Worm Mortensen, 02/04/2004 14:07 -- Created document.
Christian Worm Mortensen, 02/04/2004 14:07 -- Created document.