Fast geometric algorithms
dc.contributor.author | Noga, Mark T. | en |
dc.contributor.committeechair | Allison, Donald C. S. | en |
dc.contributor.committeemember | Roselle, David P. | en |
dc.contributor.committeemember | Haralick, Robert M. | en |
dc.contributor.committeemember | Ehrich, Roger W. | en |
dc.contributor.committeemember | Roach, John W. | en |
dc.contributor.department | Computer Science and Applications | en |
dc.date.accessioned | 2019-02-15T21:40:17Z | en |
dc.date.available | 2019-02-15T21:40:17Z | en |
dc.date.issued | 1984 | en |
dc.description.abstract | 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, the Euclidean and L₁ diameter of a set of points, the metric traveling salesman problem, and finding the superrange of starshaped and monotone polygons. The main theme of all our work has been to develop a set of very fast state-of-the-art algorithms which supercede any rivals in terms of speed and ease of implementation. In some cases we have refined existing algorithms; for others we have ·developed new techniques which 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. | en |
dc.description.degree | Ph. D. | en |
dc.format.extent | x, 277 leaves | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.uri | http://hdl.handle.net/10919/87694 | en |
dc.language.iso | en_US | en |
dc.publisher | Virginia Polytechnic Institute and State University | en |
dc.relation.isformatof | OCLC# 11231678 | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.lcc | LD5655.V856 1984.N642 | en |
dc.subject.lcsh | Algorithms | en |
dc.title | Fast geometric algorithms | en |
dc.type | Dissertation | en |
dc.type.dcmitype | Text | en |
thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
thesis.degree.level | doctoral | en |
thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1