An algorithm is presented which partitions space among mapped plants according to their relative sizes and positions using one of eight rules for locating boundaries between individuals. The performance of those rules is examined using several natural and artificial data sets with diverse measures of individual size. The relative performance of the rules was the same for all natural data sets examined. The best rule, as measured by a high correlation between individual size and assigned space, placed the boundary at a distance between neighbors proportional to the relative sizes of neighbors as long as a maximum distance (also a function of size) was not exceeded. It is inferred that the algorithm identifies contact neighbors and quantifies the extent of their contact. Afield experiment is proposed to test this inference.
| Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-3060 |
| Date | 01 May 1982 |
| Creators | Bayn, Robert L, Jr. |
| Publisher | DigitalCommons@USU |
| Source Sets | Utah State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | All Graduate Theses and Dissertations |
| Rights | Copyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact Andrew Wesolek (andrew.wesolek@usu.edu). |
Page generated in 0.0016 seconds