Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: Binhai Zhuen
dc.contributor.authorJiang, Minghuien
dc.date.accessioned2013-06-25T18:37:49Z
dc.date.available2013-06-25T18:37:49Z
dc.date.issued2005en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/1565en
dc.description.abstractWe study two geometric optimization problems motivated by cartographic applications: Map Labeling with Uniform Circles (MLUC) and Map Labeling with Uniform Circle Pairs (MLUCP). We show that the decision problems of both MLUC and MLUCP are NP-hard, and that the related optimization problems for maximizing the label sizes are NP-hard to approximate within factor 1.0349. We design approximation algorithms with constant performance guarantees for the two problems: for MLUC, we present a (3 + o)-approximation and a (2.98 + o)-approximation; for MLUCP, a (1.5+o)-approximation and a (1.491+o)-approximation. We also describe the implementation of AMLUC, a software system for automated map labeling with uniform circles. The system is based on our approximation algorithms for MLUC and uses an effective shake-and-grow heuristic to find near-optimal label placements.en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshAlgorithmsen
dc.subject.lcshCartographyen
dc.titleMap labeling with circlesen
dc.typeDissertationen
dc.rights.holderCopyright 2005 by Minghui Jiangen
thesis.catalog.ckey1168312en
thesis.degree.committeemembersMembers, Graduate Committee: Brendan Mumey; Rockford Ross; Denbigh Starkeyen
thesis.degree.departmentComputer Science.en
thesis.degree.genreDissertationen
thesis.degree.namePhDen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage100en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.