We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
This paper addresses players’ uses of supplemental items during gameplay, how they define what is and is not “cheating” in reference to these items, and then, what actions t...
we have documented shares some of the influences discussed by Ackerman et. al., but has unique dynamics of its own which present unique technical and social demands. Using several ...
As human computer interface gets more immersive, it will need to explicitly draw upon cognitive science as a basis for understanding what people are capable of doing. User experie...