Efficient algorithm for identifying a pair of maximal empty rectangles of maximum total area amidst a point set

Simple item page
dc.contributor.authorBiswas, Aniruddha
dc.date.accessioned2017-07-17T10:39:22Z
dc.date.available2017-07-17T10:39:22Z
dc.date.issued2016
dc.descriptionDissertation under the supervision of Dr. Subhas C. Nandy, ACM Uniten_US
dc.identifier.citation38p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6815
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;16-356
dc.subjectComputational geometryen_US
dc.subjectGeometric algorithmsen_US
dc.titleEfficient algorithm for identifying a pair of maximal empty rectangles of maximum total area amidst a point seten_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
DISS-356.pdf
Size:
776.79 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dissertations - M Tech (CS)