Presidential Young Investigator: Randomized Geometric Algorithms and Data Structures

该项目研究了 几何算法和数据结构设计中的随机化 涉及大量对象的问题，特别强调 所谓的高维点的各个方面 问题. 目标是设计数据结构， 在d空间的多面体划分中快速定位查询点。 各种范围查询问题，考虑可能 在预处理时间、空间使用、查询时间和 也被调查。

This project investigates the possible use of randomization in the design of algorithms and data structures for geometric problems that involve a large number of objects, with a particular emphasis various aspects of the so-called higher-dimensional point problem. The goal is to design data structures that permit the rapid location of a query point in a polyhedral partition of d- space. Various range query problems which consider possible between preprocessing time, space usage, query time, and are also investigated.