TENTATIVE PRUNE-AND-SEARCH FOR COMPUTING FIXED-POINTS WITH APPLICATIONS TO GEOMETRIC COMPUTATION
David G. Kirkpatrick, Jack Scott Snoeyink · Fundamenta Informaticae · 1995
Motivated by problems in computational geometry, this paper investigates the complexity of finding a fixed-point of the composition of two or three continuous functions that are defined piecewise. It shows that certain cases require nested binary sea