Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
In this paper, a novel, adaptive noise reduction method for engineering drawings is proposed based on assessment of both primitives and noise. Unlike the current approaches, our m...
This paper describes Squidball, a new large-scale motion capture based game. It was tested on up to 4000 player audiences last summer at SIGGRAPH 2004. It required the construction...
Christoph Bregler, Clothilde Castiglia, Jessica De...