Ranking intervals under visibility constraints∗
Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben‐Arroyo Hartman, Jack A. Feldman · International Journal of Computer Mathematics · 1990
Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p∊s∩t so that p∉u for all u with p(s)<p(u)