Nearest-tree and Variable Polygon Sampling

HTML Source EditorWord Wrap Sampling a nearest neighbor is often presented as a Hansen-Hurwitz or Horvitz-Thompson estimation process. This may not be the most informative viewpoint, and measuring the probability of selection is not necessary. The measurement of the nearest object as a “depth” over...

Full description

Saved in:
Bibliographic Details
Published in:International journal of mathematical and computational forestry & natural-resource sciences 2023-04, Vol.15 (1), p.1
Main Author: Iles, Kim
Format: Article
Language:English
Subjects:
Geometry
Polygons
Probability
Sampling
Trees
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:HTML Source EditorWord Wrap Sampling a nearest neighbor is often presented as a Hansen-Hurwitz or Horvitz-Thompson estimation process. This may not be the most informative viewpoint, and measuring the probability of selection is not necessary. The measurement of the nearest object as a “depth” over the selection area can be done by a sampling process, and the total estimated without the polygon areas. The process is unbiased, quite general, and easy to understand. It can be extended to more than just the nearest object to a sample point and to many different polygon shapes. This paper is an extension, simplification and generalization of an earlier paper in this journal (Iles, K. 2009 “Nearest-tree" estimations - A discussion of their geometry, MCFNS 1(2), pages 47 51.) , and does not require a random orientation or weighting for the direction of measurement from the tree to the polygon border.
ISSN:1946-7664