We consider the question of deciding whether or not certain subgroups of certain cocompact Kleinian groups are geometrically finite or infinite. This is reduced to a question about similarity interval exchange maps. The concept of trimming produces an practical algorithm to settle the latter question. This algorithm has been implemented on a computer and the results are perplexing.
"Trimming." Experiment. Math. 7 (4) 325 - 332, 1998.