Home range estimation, MCP02 Apr 2016
I’ve been spending a lot of time over the last several months thinking about animal home ranges, utilization distributions, and movement ecology. All this thinking has gone into a shiny application for the exploratory analysis and visualization of animal movement data. Estimating the home ranges is fairly straight forward. The stumbling block is working with the classes in
sp R packages and mapping those ranges on an interactive leaflet map.
Over the next several posts I’ll go into detail about estimating home ranges and digging into the code to help me (maybe you) understand what is going on.
These days the data will be geographic coordinates collected from a telemetry system, either VHF or GPS. The data doesn’t need to have a timestamp. Other potential data sources can be from foot prints in snow, scat, hair traps, etc. As long as there are X and Y coordinates. For any data sources it is best to be able to identify individuals. VHF data should have a date and GPS data should be timestamped. This type of data is good for minimum convex polygon, kernel density, and brownian bridge methods. Below I generate a random point set (ignore the red dot for now).
Minimum Convex Polygon
One of the easiest and most widely used methods of estimating home ranges is the Minimum Convex Polygon. The concept is to construct the smallest possible convex polygon around the XY locations (point set). MCP has several downsides, however they are good for exploratory analysis and visualization. The steps to calculate a MCP are as follows.
- Calculate the centroid of all the points
- Calculate the distances from the centroid to all the points
- Remove all points with a distance greater than a selected quantile
- Use a convex hull algorithm to estimate the minimum convex polygon
Below is an example to estimate an minimum convex polygon with the randomly generated point set above. To use
adehabitatHR the data must be of class
sp::SpatialPointsDataFrame, and the dataframe must have a column with the ID of each individual (if there are multiple individuals). The first line is one of many ways to create a SpatialPointsDataFrame with your data. The following lines estimate the MCP with the
adehabitatHR::mcp function and plot the result.
As you can see each polygon encompasses fewer and fewer points. Because our data has 100 points each polygon encompasses 100, 90, 80, and 70 points respectively.
The Hard ways
To dig a little deeper into the method of constructing MCPs I looked under the hood at the source code for the function. I was curious about the nitty gritty of the method, and to see if there was an easier way plot the polygons on a leaflet map.
Step 1, 2 and 3
Calculate the centroid of all the points, and the distance from each point to the centroid. For simplicity, recreate the xy dataframe the x and y vector. The last chunk of code (under percentages) is used to exclude all the points from the original dataframe that are greater than which ever quantile you’ve selected, 80% in this case.
mcp.pts dataframe is ready for the convex hull algorithm. There are many different convex hull algorithms to estimate the minimum convex polygon. I’m sure any computational geometry textbook or website will have a complete explanation of the different implementations of these algorithms. The R function
chull will estimate the MCP. The algorithm this function uses is from Eddy 1977 (link to PDF, may auto download on some browsers). There may be quicker or more extensible algorithms (3 dimensions), however that is beyond the scope of this post.
The first line below does the work, estimating the points that are the vertexes of the MCP polygon. The two following lines are extracting those points then duplicating the first point as the last point to close the polygon.
The green polygon above is the same as the red polygon in the example with multiple MCP estimates.