Graduate Project

 

Finding and Using Chokepoints in Stratagus Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/zp38wh55x

Descriptions

Attribute NameValues
Creator
Abstract
  • This paper describes a method for finding areas of interest on a two-dimensional grid map used in the real-time strategy engine Stratagus. The method involves discovering chokepoints where through all simulation agents must pass. Using a set of tunable parameters, a full set of chokepoints are located. The redundant and useless chokepoints are then filtered out of the set. The resulting chokepoints can then be used to create a graph of the high-level map structure. The method used to cull less-useful chokepoints is presented. Secondarily, two algorithms were developed that help decide at which chokepoints a limited number of defensive structures may be placed for the greatest benefit. The results of a series of tests are given that show that these algorithms are valuable: tower placements based on both the optimal and greedy implementations, built on the maximum flow of the resultant graph, perform markedly better than random placement. Further, the framework (also by the author) used in this project is dissected.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-12-26T22:50:46Z (GMT). No. of bitstreams: 12007-49.pdf: 558314 bytes, checksum: e8266c9b71c642b39d978304679ca5bf (MD5) Previous issue date: 2007
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-12-26T22:49:37ZNo. of bitstreams: 12007-49.pdf: 558314 bytes, checksum: e8266c9b71c642b39d978304679ca5bf (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-12-26T22:50:46Z (GMT) No. of bitstreams: 12007-49.pdf: 558314 bytes, checksum: e8266c9b71c642b39d978304679ca5bf (MD5)

Relationships

Parents:

This work has no parents.

Items