We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
This paper presents a new computer-based teleconference system. In order to build the system, we modified VNC(Virtual Network Computing) program and implemented Face mouse system....
—While mobile users move from one smart space to another, it is highly desirable for them to access the right media contents from the overabundant media information in the right ...