We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
This paper describes a long-term project exploring advanced visual interfaces for antenna design. MERL developed three successive prototypes that embodied an evolution towards lar...
Kent Wittenburg, Tom Lanning, Darren Leigh, Kathy ...
Information graphics (such as bar charts and line graphs) are an important component of many documents. Unfortunately, these representations present serious access challenges for ...
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....