Incoloring mode that measures distance to a periodic cycle

[dpthurst]

All of the in-coloring modes implicitly work much better if 0 is one of the points in the periodic cycle. This is true for the usual parametrization of the classical Mandelbrot set, but fails for many other families of fractals (particularly rational maps). There is already apparently periodicity checking; can we get an option for coloring by distance to the periodic cycle? (i.e., number of iterations to get a certain distance from the attracting cycle)

[jblang]

Is this the same thing as distance estimator method? https://mrob.com/pub/muency/distanceestimator.html

If not, some more details on how to compute this (or even better, some code) would be helpful.