Fast geometric algorithms
Thesis/Dissertation
·
OSTI ID:5343099
This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L/sub 1/ hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L/sub 1/ diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry.
- Research Organization:
- Virginia Polytechnic Inst. and State Univ., Blacksburg (USA)
- OSTI ID:
- 5343099
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient parallel techniques for computational geometry
Geometric optimization
Parallel algorithms for computational geometry utilizing a fixed number of processors
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6210414
Geometric optimization
Conference
·
Wed Sep 01 00:00:00 EDT 1993
·
OSTI ID:10184644
Parallel algorithms for computational geometry utilizing a fixed number of processors
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5702781