New upper bounds in Klee's measure problem
SIAM Journal on Computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Data structures for mobile data
Journal of Algorithms
Evaluating strategies for similarity search on the web
Proceedings of the 11th international conference on World Wide Web
Shape Similarity Measures, Properties and Constructions
VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
The co-opticon: shared access to a robotic streaming video camera
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Algorithms and systems for shared access to a robotic streaming video camera
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Geometric optimization and sums of algebraic functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Geometric optimization and sums of algebraic functions
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We consider a system that allows n networked users to share control over a robotic webcamera. Each user guides the camera pan, tilt and zoom, by drawing a rectangle in the user interface. The server adjusts the camera to best satisfy the user requests, by solving a geometric optimization problem that requires fitting one rectangle to many. We improve upon previous results with an O(n3/2 log3 n) time exact algorithm for this problem. We also present a simple near-linear time e-approximation algorithm. We have implemented the latter and report on experimental results.