Show simple item record

dc.identifier.urihttp://hdl.handle.net/1951/56126
dc.identifier.urihttp://hdl.handle.net/11401/71701
dc.description.sponsorshipThis work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.en_US
dc.formatMonograph
dc.format.mediumElectronic Resourceen_US
dc.language.isoen_US
dc.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dc.typeThesis
dcterms.abstractMotivated 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.
dcterms.available2012-05-17T12:22:34Z
dcterms.available2015-04-24T14:48:34Z
dcterms.contributorJie Jie Gao. .en_US
dcterms.contributorJoseph S.B. Mitchell.en_US
dcterms.creatorSrihari, Yogesh Mysore
dcterms.dateAccepted2012-05-17T12:22:34Z
dcterms.dateAccepted2015-04-24T14:48:34Z
dcterms.dateSubmitted2012-05-17T12:22:34Z
dcterms.dateSubmitted2015-04-24T14:48:34Z
dcterms.descriptionDepartment of Computer Scienceen_US
dcterms.formatMonograph
dcterms.formatApplication/PDFen_US
dcterms.identifierSrihari_grad.sunysb_0771M_10555.pdfen_US
dcterms.identifierhttp://hdl.handle.net/1951/56126
dcterms.identifierhttp://hdl.handle.net/11401/71701
dcterms.issued2011-05-01
dcterms.languageen_US
dcterms.provenanceMade available in DSpace on 2012-05-17T12:22:34Z (GMT). No. of bitstreams: 1 Srihari_grad.sunysb_0771M_10555.pdf: 2742151 bytes, checksum: c59c7a39fcb04c90d9297da293740276 (MD5) Previous issue date: 1en
dcterms.provenanceMade available in DSpace on 2015-04-24T14:48:34Z (GMT). No. of bitstreams: 3 Srihari_grad.sunysb_0771M_10555.pdf.jpg: 1894 bytes, checksum: a6009c46e6ec8251b348085684cba80d (MD5) Srihari_grad.sunysb_0771M_10555.pdf: 2742151 bytes, checksum: c59c7a39fcb04c90d9297da293740276 (MD5) Srihari_grad.sunysb_0771M_10555.pdf.txt: 29588 bytes, checksum: 907210274bd3623b181e732d590feb80 (MD5) Previous issue date: 1en
dcterms.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dcterms.subjectComputer Science
dcterms.subjectComputational Geometry, Geometric Partition, Load Balancing, Optimization Problem
dcterms.titleOn Balanced Geometric Point Set Partitioning Problems
dcterms.typeThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record