On the Computation of Minimum Encasing Rectangles and Set Diameters

Simple item page
dc.contributor.authorAllison, Donald C. S.en
dc.contributor.authorNoga, M. T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:07Zen
dc.date.available2013-06-19T14:37:07Zen
dc.date.issued1981en
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
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000869/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000869/01/CS81017-R.pdfen
dc.identifier.trnumberCS81017-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20365en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOn the Computation of Minimum Encasing Rectangles and Set Diametersen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS81017-R.pdf
Size:
605.21 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports