I have a large dataset of polygons and need to identify the overlaps for two purposes:
1) To create a display similar to a hot spot or density (shows the highest concentrations of polygon coverage).
2) For use in spatial joins with point features in order to answer questions such as: this point was intersected by ## polygons.
The first method I found was to run a Union, then a Dissolve. The problem is that this method takes a LONG time to run, and can actually run out of RAM, even with my 64GB system.
Does anyone have a better methodology? Thanks for the advice!
