Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/2794
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goswami, Partha P | - |
dc.contributor.author | Das, Sandip | - |
dc.contributor.author | Nandy, Subhas C | - |
dc.date.accessioned | 2012-01-03T15:27:45Z | - |
dc.date.available | 2012-01-03T15:27:45Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Information processing letters,V94,6,P259-266 | en_US |
dc.identifier.uri | http://hdl.handle.net/10263/2794 | - |
dc.language.iso | en | en_US |
dc.subject | Levels of arrangement | en_US |
dc.subject | Plan sweep | en_US |
dc.subject | computational geometry | en_US |
dc.subject | Optimization | en_US |
dc.title | Smallest k-point enclosing rectangle and squares of arbitrary orintation | en_US |
dc.type | Article | en_US |
Appears in Collections: | Computer Science |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Binder24.pdf | 1.52 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.