Generalized shooter location problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 389-399

  Chaudhuri, Jeet ^a   Nandy, Subhas C ^b  

^a WIPRO TECHNOLOGIES   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY;

LOCATION PROBLEMS; TIME COMPLEXITY;

ALGORITHMS;

EID: 84949755328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_39     Document Type: Conference Paper

References (5)

1. H. Edelsbrunner and L. J. Guibas Topological sweeping an arrangement, Journal of Computer and System Sciences, vol. 38, pp. 165-194, 1989
2. H. Edelsbrunner, M. H. Overmars and D. Wood, Graphics in flatland: a case study, in F. P. Preparata ed., Advances in Computing Research vol. 1, JAI Press, London, 1983 pp. 35-59.
3. W. L. Hsu and K. H. Tsai, Linear time algorithms on circular-arc graphs, Information Processing Letters, vol. 40, 1991, pp. 123-129.
4. S. C. Nandy, K. Mukhopadhyaya and B. B. Bhattacharya, Shooter location problem, Proc. 8th Canad. Conf. on Computational Geometry, pp. 93-98, August 1996.
5. th Canad. Conf. on Computational Geometry, pp. 223-228, 1997.