Local convex hull (LoCoH) is a method for estimating size of the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions, or herd of buffaloes), and for constructing a utilization distribution.[1][2] The latter is a probability distribution that represents the probabilities of finding an animal within a given area of its home range at any point in time; or, more generally, at points in time for which the utilization distribution has been constructed. In particular, different utilization distributions can be constructed from data pertaining to particular periods of a diurnal or seasonal cycle.
Utilization distributions are constructed from data providing the location of an individual or several individuals in space at different points in time by associating a local distribution function with each point and then summing and normalizing these local distribution functions to obtain a distribution function that pertains to the data as a whole.[3][4][5][6] If the local distribution function is a parametric distribution, such as a symmetric bivariate normal distribution then the method is referred to as a kernel method, but more correctly should be designated as a parametric kernel method. On the other hand, if the local kernel element associated with each point is a local convex polygon constructed from the point and its k-1 nearest neighbors, then the method is nonparametric and referred to as a k-LoCoH or fixed point LoCoH method. This is in contrast to r-LoCoH (fixed radius) and a-LoCoH (adaptive radius) methods.
In the case of LoCoH utilization distribution constructions, the home range can be taken as the outer boundary of the distribution (i.e. the 100th percentile). In the case of utilization distributions constructed from unbounded kernel elements, such as bivariate normal distributions, the utilization distribution is itself unbounded. In this case the most often used convention is to regard the 95th percentile of the utilization distribution as the boundary of the home range.
To construct a k-LoCoH utilization distribution:
Locate the k − 1 nearest neighbors for each point in the dataset.
Construct a convex hull for each set of nearest neighbors and the original data point.
Merge these hulls together from smallest to largest.
Divide the merged hulls into isopleths where the 10% isopleth contains 10% of the original data points, the 100% isopleth contains all the points, etc.
In this sense, LoCoH methods are a generalization of the home range estimator method based on constructing the minimum convex polygon (MCP) associated with the data. The LoCoH method has a number of advantages over parametric kernel methods. In particular:
As more data are added, the estimates of the home range become more accurate than for bivariate normal kernel constructions.
LoCoH handles 'sharp' features such as lakes and fences much better than parametric kernel constructions.
As mentioned above, the home range is a finite region without having to resort to an ad-hoc choice, such as the 95th percentile to obtain bounded region.
LoCoH has a number of implementations including a now-defunct LoCoH Web Application.
LoCoH was formerly known as k-NNCH, for k-nearest neighbor convex hulls. It has recently been shown that the a-LoCoH is the best of the three LoCoH methods mentioned above (see Getz et al. in the references below).
^Getz, W. M. and C. C. Wilmers, 2004. A local nearest-neighbor convex-hull construction of home ranges and utilization distributions. Ecography 27: 489-505.View PDF
^Getz, W.M, S. Fortmann-Roe, P. C. Cross, A. J. Lyons, S. J. Ryan, C.C. Wilmers, PLoS ONE 2(2): e207. doi:10.1371/journal.pone.0000207. LoCoH: nonparametric kernel methods for constructing home ranges and utilization distributions. View PDF
^Silverman BW. (1986) Density estimation for statistics and data analysis. London: Chapman and Hall. 176 p.
^Worton BJ. (1987). A review of models of home range for animal movement. Ecological Modelling, 38: 277–298.
^Worton BJ. (1989) Kernel methods for estimating the utilization distribution in home-range studies. Ecology 70: 164–168.
^Seaman DE, Powell RA. (1996) An evaluation of the accuracy of kernel density estimators for home range analysis. Ecology 77: 2075–2085.
Localconvexhull (LoCoH) is a method for estimating size of the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions...
In geometry, the convexhull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convexhull may be defined either...
nonparametric methods such as the Burgman and Fox's alpha-hull and Getz and Wilmers localconvexhull have been used. Software is available for using both...
locally convex space, the convexhull and the disked hull of a totally bounded set is totally bounded. In a complete locally convex space, the convexhull and...
A kinetic convexhull data structure is a kinetic data structure that maintains the convexhull of a set of continuously moving points. It should be distinguished...
less biased home-range area estimates compared to convexhull methods. Home range Localconvexhull Anderson, D. John (February 1982). "The Home Range:...
The polynomially convexhull contains the holomorphically convexhull. The domain G {\displaystyle G} is called holomorphically convex if for every compact...
or vertices. A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convexhull of its vertices...
Closed hulls In a locally convex space, convexhulls of bounded sets are bounded. This is not true for TVSs in general. The closed convexhull of a set...
vertex of the convexhull is chosen, one can then apply the formula using the previous and next vertices, even if those are not on the convexhull, as there...
convexhull Conv(Q) is the minimal convex set that contains Q. Thus Conv(Q) is the intersection of all the convex sets that cover Q. The convexhull of...
Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves...
(convexhull) - If a point x of Rd lies in the convexhull of a set P, there is a subset of P with d+1 or fewer points such that x lies in its convex hull...
bounding box of a point set is the same as the minimum bounding box of its convexhull, a fact which may be used heuristically to speed up computation. In the...
use. A convexhull is the smallest convex volume containing the object. If the object is the union of a finite set of points, its convexhull is a polytope...
change continuously with time. For points moving in a plane, the kinetic convexhull data structure can be used as a basis for a responsive, compact and efficient...
an edge a b {\displaystyle ab} of the convexhull, and the other line must go through a point c of the convexhull such that (a,c) and (b,c) are antipodal...
so as to preserve the symmetry of the Platonic solid) and taking the convexhull. Expansion with twisting also involves rotating the faces, thus splitting...
function's convexhull. Let I ⊂ R {\displaystyle I\subset \mathbb {R} } be an interval, and f : I → R {\displaystyle f:I\to \mathbb {R} } a convex function;...
variance, the set of training points should contain the test point in their convexhull (see Gupta et al. reference). Instead of fitting locally linear functions...
connects alternate vertices. A vertex arrangement is often described by the convexhull polytope which contains it. For example, the regular pentagram can be...
having the two-dimensional standard normal distribution. Let Kn be the convexhull of these points, and Xn the area of Kn Then X n − E ( X n ) Var (...
Global Information