Fully flexible areas, near minimum set, Ecuador
Selects a near-minimum set of areas to represent all taxa at least once. This is a progressive rarity algorithm (Margules et al. 1988, Williams 1999a). First it selects all areas with taxa that are equally or more restricted than the representation goal. Then the algorithm follows a set of rules: rarest + next rarest + first encountered. The ruleset can be extended to five criteria by adding in "next rarest" two additional times. This is a rather time-consuming process; users should be prepared to wait several hours for completion of this analysis.
Center for Advanced Spatial Technologies
304 JBHT, University of Arkansas, Fayetteville AR 72701
Phone: (479)575-6159 | Fax: (479)575-5218 | Email: Turn on JavaScript!
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License.
Website Statistics | MySQL: 0.0031 s, 0 request(s), PHP: 0.0268 s, total: 0.0299 s, document retrieved from cache. Powered by MODx.