Visibility problems for polyhedral terrains
Journal of Symbolic Computation
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Criteria for reducibility of moving objects closeness problem
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Kinetic red-blue minimum separating circle
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
| Hi-index | 0.00 |
We consider problems in computational geometry when every one of the input points is moving in a prescribed manner. We present and analyze efficient algorithms for a number of problems and prove lower bounds for some of them.