Fast geometric algorithms
This thesis addresses a number of important problems which 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₁ hull, determination of the minimum encasing rectangle of a set of points, th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Virginia Polytechnic Institute and State University
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/87694 |