Plant Spacing: A Size Sensitive Model with Implications for Competition

Document Type

Full Issue

Publication Date



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. A field experiment is proposed to test this inference.


This item is a dissertation published by a student who attended Utah State University. Abstract can be accessed through the remote link. Fulltext not available online.

This document is currently not available here.