Show simple item record

dc.contributor.authorAllison, Donald C. S.en_US
dc.contributor.authorNoga, M. T.en_US
dc.date.accessioned2013-06-19T14:37:07Z
dc.date.available2013-06-19T14:37:07Z
dc.date.issued1981
dc.identifierhttp://eprints.cs.vt.edu/archive/00000869/en_US
dc.identifier.urihttp://hdl.handle.net/10919/20365
dc.description.abstractTwo 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleOn the Computation of Minimum Encasing Rectangles and Set Diametersen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberCS81017-Ren_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000869/01/CS81017-R.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record