I'm working on a dataset of house searches - 1 polygon for each area in which people want to find a house from an online search tool.
This produces many overlapping polygons. It would be great to get a basic understanding of the places that are most frequently searched.
You can do this in QGIS and other programs using transparency:
But ideally, you would create a new layer with the search density for each cell in a grid. This is exactly what the "feature density" algorithm does in ArcView 3.2 and I've seen it work to great effect. It creates a raster map from a mass of overlaid polygons.
So the question is: is there an implementation of this algorithm for my polygon dataset for open source programs. I'm an R and QGIS user so one of those would be preferable. Many thanks!