In the course of trying to explain and “visually” I was led to this variation on the notion of convex hull. Given a set in the plane, the convex hull is constructed by considering all the half-planes that contain and taking their intersection. The requirement can be relaxed for instance by saying that has measure zero. But what happens if we instead ask that be bounded? Suppose for instance that is the first quadrant. Then any half-plane of the form , for , is a candidate and we see that their intersection is empty. But it isn’t empty if we pass to the projective plane. In that case we would get an arc of the line at infinity, which could maybe be called the “limit hull” of . It seems the case, but I haven’t sat down to check, that whenever is unbounded, its limit hull is non-empty.
The connection with was as follow. Let be the graph of your favorite function. First define the infimum of “visually” by saying that “we draw a horizontal line under the graph and then raise it as far as we can until it bumps into the graph of . The can be defined analogously by drawing a horizontal line under the graph and continue raising it as long as the set of ‘s where is under the line forms a bounded set.