I'm conducting a density analysis of a series of polylines and I'm hung up on determining an appropriate search radius.
The default calculation performed by arcgis is to take the shorter dimension of the input feature extent divided by 30. However, I would prefer to use the formula set forth by Bailey and Gatrell in Interactive Spatial Data Analysis (1995).
They suggest that the bandwidth for a kernel analysis be set to 0.68n^(-0.2) where n=the number of features being analyzed.
This calculation is straightforward for points as each point is the same size. However, the polyline dataset I am working with has lines of varying length. Simply taking the number of lines as n doesn't seem appropriate.
I have considered converting the polylines to points but before I begin with this approach I am curious if there might be other valid approaches?
Thanks in advance for any help you can provide.