Generalized shooter location problem

Authors:
Jeet Chaudhuri;Subhas C. Nandy
Affiliations:
Wipro Limited, Bangalore, India;Indian Statistical Institute, Calcutta, India
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 3
Cited 1

Topologically sweeping an arrangement

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Linear time algorithms on circular-arc graphs

Information Processing Letters
Shooter Location Problem

Proceedings of the 8th Canadian Conference on Computational Geometry

Maintenance of a Percing Set for Intervals with Applications

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an efficient algorithm for the generalized shooter location problem. A prior work on this problem appeared in [5], where an O(n5logn) algorithm was proposed. The time complexity of our algorithm is O(n4 + nK), where K is the number of dominating cells inside the floor. The concept of dominating cell will be introduced later in the text. Though the worst case number of K may be O(n4), it is much less in the actual practice.