Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/2794
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoswami, Partha P-
dc.contributor.authorDas, Sandip-
dc.contributor.authorNandy, Subhas C-
dc.date.accessioned2012-01-03T15:27:45Z-
dc.date.available2012-01-03T15:27:45Z-
dc.date.issued2005-
dc.identifier.citationInformation processing letters,V94,6,P259-266en_US
dc.identifier.urihttp://hdl.handle.net/10263/2794-
dc.language.isoenen_US
dc.subjectLevels of arrangementen_US
dc.subjectPlan sweepen_US
dc.subjectcomputational geometryen_US
dc.subjectOptimizationen_US
dc.titleSmallest k-point enclosing rectangle and squares of arbitrary orintationen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
Binder24.pdf1.52 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.