ON THE COMPUTATION OF MINIMUM ENCASING RECTANGLES AND SET DIAMETERS
1981) ON THE COMPUTATION OF MINIMUM ENCASING RECTANGLES AND SET DIAMETERS. Technical Report CS81017-R, Computer Science, Virginia Tech. (
Two new algorithms are described for the following problems: given a set of N points in the plane determine (i) the rectangle of minimum area which will completely cover (or encase) the set and (ii) the two points that are farthest apart (diameter of the set). Both algorithms have O(NlogN) time complexity and are based upon a similar strategy.
|Item Type:||Departmental Technical Report|
|Keywords:||Computational geometry, convex hull, applied computational complexity|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||Administrator, Eprints|
|Deposited On:||10 May 2006|