On some optimization problems in obnoxious facility location

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

Volumn 1858, Issue , 2000, Pages 320-329

  Qin, Zhongping ^a   Xu, Yinfeng ^b   Zhu, Binhai ^c  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

FACILITY LOCATIONS; GENERAL METHOD; MINIMUM DISTANCE; OBNOXIOUS FACILITY LOCATIONS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 84957007809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_32     Document Type: Conference Paper

References (16)

1. F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structures, ACM Comput. Surveys, 23(3), pp. 343-405, 1991.
2. F. Aurenhammer and H. Edelsbrunner, An optimal algorithm for constructing the weighted Voronoi diagram in the plane, Pattern Recognition, 17, pp. 251-257, 1984.
3. J. Boissonnat, O. Devillers, R. Schott, M. Teillaud and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry, Disc. Comp. Geom. 8, pp. 51-71, 1992.
4. O. Devillers, S. Meiser and M. Teillaud, Fully dynamic Delaunay triangulation in logarithmic expected time per operation, Comp. Geom. Theory and Appl. 2, pp. 55-80, 1992.
5. L. Devroye, E. Mücke and B. Zhu, A note on point location in Delaunay triangulations of random points, Algorithmica, special issue on Average Case Analysis of Algorithms, 22(4), pp. 477-482, Dec, 1998.
6. T. Feder and D. Greene, Optimal algorithms for approximate clustering, Proc. 20th STOC, pp. 434-444, 1988.
7. L. Guibas, D. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, 7, pp. 381-413, 1992.
8. T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theo. Comput. Sci., 38, pp. 293-306, 1985.
9. R. Klein, K. Mehlhorn and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Comp. Geom. Theory and Appl. 3, pp. 157-184, 1993.
10. ∞) metric with twodimensional storage applications, SIAM. J Comput., 9, pp. 200-211, 1980.
11. p metric, J. ACM, 27, pp. 604-618, 1980.
12. E. Mücke, I. Saias and B. Zhu, Fast Randomized Point Location Without Preprocessing in Two and Three-dimensional Delaunay Triangulations, Comp. Geom. Theory and Appl, special issue for SoCG’96, 12 (1/2), pp. 63-83, Feb, 1999.
13. K. Nurmela and P. Ostergard, Packing up to 50 equal circles in a square, Disc. Comp. Geom. 18, pp. 111-120, 1997.
14. F. Preparata and M. Shamos, Computational Geometry, Springer-Verlag, 1985.
15. P. Widmayer, Y.F. Wu, and C.K. Wong, On some distance problems in fixed orientations. SIAM J. Comput., 16, pp. 728-746, 1987.
16. C.K. Yap, An O(n log n) algorithm for the Voronoi diagram of a set of curve segment, Disc. Comp. Geom. 2, pp. 365-393, 1987.