Results in computational geometry: Geometric embeddings and query-retrieval problems. Technical report
Technical Report
·
OSTI ID:5673429
Many fundamental questions in computational geometry arise from the consideration of distributions of points in euclidean space. This thesis explores two important areas of computational geometry in this setting: geometric embeddings and query-retrieval problems. Each area is addressed in a separate part of the thesis. Part I examines the geometric embedding problem for many of the graphs which are important in the study of parallel computation. Part II of this thesis examines query-retrieval problems concerning distributions of points in euclidean space. In this part, we describe a new technique for solving a variety of query-retrieval problems in optimal time with optimal or near optimal space. Our compaction technique incorporates planar separators, filtering search, and the probabilistic method for discrepancy problems.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge, MA (USA). Lab. for Computer Science
- OSTI ID:
- 5673429
- Report Number(s):
- AD-A-230380/8/XAB; MIT/LCS/TR--492; CNN: N00014-89-J-1988
- Country of Publication:
- United States
- Language:
- English
Similar Records
Integral geometry and geometric probability
Query optimization in distributed databases
Fast geometric algorithms
Book
·
Wed Dec 31 23:00:00 EST 1975
·
OSTI ID:7227539
Query optimization in distributed databases
Technical Report
·
Fri Oct 01 00:00:00 EDT 1982
·
OSTI ID:6744813
Fast geometric algorithms
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5343099