{"@context":"http://iiif.io/api/presentation/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/manifest.json","@type":"sc:Manifest","label":"On Balanced Geometric Point Set Partitioning Problems","metadata":[{"label":"dc.description.sponsorship","value":"This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree."},{"label":"dc.format","value":"Monograph"},{"label":"dc.format.medium","value":"Electronic Resource"},{"label":"dc.identifier.uri","value":"http://hdl.handle.net/11401/71701"},{"label":"dc.language.iso","value":"en_US"},{"label":"dc.publisher","value":"The Graduate School, Stony Brook University: Stony Brook, NY."},{"label":"dcterms.abstract","value":"Motivated by the airspace sectorization problem in air traffic management, we consider the following family of geometric partitioning problems: Given a finite set of points within a geometric domain, we want to partition the domain, and thereby the point set, in order that the resulting disjoint polygonal pieces are load-balanced, so that each piece contains a specified number of points and satisfies specified geometric constraints, such as fatness (aspect ratio), convexity of the pieces, etc. We consider different variations of the problem having various optimization criteria, including measures of the balance in terms of areas of pieces, number of points per piece, and total length of the edges defining the partition."},{"label":"dcterms.available","value":"2012-05-17T12:22:34Z"},{"label":"dcterms.contributor","value":"Joseph S.B. Mitchell."},{"label":"dcterms.creator","value":"Srihari, Yogesh Mysore"},{"label":"dcterms.dateAccepted","value":"2015-04-24T14:48:34Z"},{"label":"dcterms.dateSubmitted","value":"2012-05-17T12:22:34Z"},{"label":"dcterms.description","value":"Department of Computer Science"},{"label":"dcterms.format","value":"Monograph"},{"label":"dcterms.identifier","value":"http://hdl.handle.net/1951/56126"},{"label":"dcterms.issued","value":"2011-05-01"},{"label":"dcterms.language","value":"en_US"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2015-04-24T14:48:34Z (GMT). No. of bitstreams: 3\nSrihari_grad.sunysb_0771M_10555.pdf.jpg: 1894 bytes, checksum: a6009c46e6ec8251b348085684cba80d (MD5)\nSrihari_grad.sunysb_0771M_10555.pdf: 2742151 bytes, checksum: c59c7a39fcb04c90d9297da293740276 (MD5)\nSrihari_grad.sunysb_0771M_10555.pdf.txt: 29588 bytes, checksum: 907210274bd3623b181e732d590feb80 (MD5)\n  Previous issue date:    1"},{"label":"dcterms.publisher","value":"The Graduate School, Stony Brook University: Stony Brook, NY."},{"label":"dcterms.subject","value":"Computer Science"},{"label":"dcterms.title","value":"On Balanced Geometric Point Set Partitioning Problems"},{"label":"dcterms.type","value":"Thesis"},{"label":"dc.type","value":"Thesis"}],"description":"This manifest was generated dynamically","viewingDirection":"left-to-right","sequences":[{"@type":"sc:Sequence","canvases":[{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json","@type":"sc:Canvas","label":"Page 1","height":1650,"width":1275,"images":[{"@type":"oa:Annotation","motivation":"sc:painting","resource":{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/10%2F48%2F34%2F104834992351234224425066361138832846535/full/full/0/default.jpg","@type":"dctypes:Image","format":"image/jpeg","height":1650,"width":1275,"service":{"@context":"http://iiif.io/api/image/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/10%2F48%2F34%2F104834992351234224425066361138832846535","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}