The largest empty annulus problem

International Journal of Computational Geometry and Applications

Volumn 13, Issue 4, 2003, Pages 317-325

  Diaz Banez J M ^a   Hurtado, F ^d   Meijer, H ^b   Rappaport, D ^b   Sellares J A ^c  

^a UNIVERSITY OF SEVILLE   (Spain)

^b QUEEN S UNIVERSITY   (Canada)

^c UNIVERSITY OF GIRONA   (Spain)

^d NONE

Author keywords

Computational geometry; Facility location; Optimization

Indexed keywords

EID: 18244426491     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001207     Document Type: Conference Paper

References (24)

1. P. K. AGARWAL, M. SHARIR, AND S. TOLEDO, Applications of parametric searching in geometric optimization. Journal of Algorithms, 17: 292-318, 1994.
2. R. BATTA, AND S. CHIU, Optimal obnoxious paths on a network: Transportation of hazardous materials. Opns. Res., 36:84-92, 1988.
3. B. K. BHATTACHARYA, Circular separability of planar point sets. Computational Morphology, G. T. Toussaint ed. North Holland, 1988.
4. B. BHATTACHARYA AND H. ELGINDY, Biased search and k-point clustering. In Proc. 9th Canad. Conf. Comput. Geom., 141-146, 1997.
5. B. BOFFEY, AND J. KARKAZIS, Optimal location of routes for vehicles: Transporting hazardous materials. European J. Oper. Res., 201-215, 1995.
6. S. CHATTOPADHYAY AND P. DAS, The k-dense corridor problems. Pattern Recogn. Lett., 11:463-469, 1990.
7. S.-W. CHENG, Widest empty corridor with multiple links and right-angle turns. In Proc. 6th Canad. Conf. Comput. Geom., pages 57-62, 1994.
8. S.-W. CHENG, Widest empty L-shaped corridor. Inform. Process. Lett., 58:277-283, 1996.
9. J.M. DÍAZ-BÁÑEZ , J.A. MESA AND A. SCHÖBEL, Continuous Location of Dimensional Structures. European J. Oper. Res. in press, 2003.
10. Z. AND WESOLOWSKY, G.O., Location of an obnoxious route. Journal Operational Research Society, 40:1011-1018, 1989.
11. H. EBARA, H. NAKANO, Y. NAKANISHI, AND T. SANADA, A roundness algorithms using the Voronoi diagrams. Transactions IEICE, J70-A:620-624, 1987.
12. A. EFRAT. M. SHARIR AND A. ZIV, Computing the smallest k-enclosing circle and related problems. Computational Geometry: Theory and Applications, 4:119-136, 1995.
13. S. FISH , Separating point sets by circles and the recognition of digital disks. Pattern Analysis and Machine Intelligence , 8 (4), 1986.
14. F. FOLLERT, Maxmin location of an anchored ray in 3-space and related problems. In 7th Canadian Conference on Computational Geometry, Quebec, 1995.
15. J. GARCÍA-LÓPEZ, P. A. RAMOS, J. SNOEYINK, Fitting a set of points by a circle. Discrete & Computational Geometry, 20, 1998, 389-402.
16. D. HALPERIN, Chapter 21: Arrangements, Handbook of Discrete and Computational Geometry. Jacob E. Goodman and Joseph O'Rourke eds., CRC Press LLC, Boca Raton, FL, 389-412, 1997.
17. M. HOULE AND A. MACIEL, Finding the widest empty corridor through a set of points. In Snapshots of Computational and Discrete Geometry, pages 201-213. Dept. of Computer Science, McGill University, Montreal, Canada, Technical Report SOCS-88.11, 1988.
18. R. JANARDAN AND F. PREPARATA, Widest-corridor problems. In Proc. 5th Canad. Conf. Comput. Geom., pages 426-431, 1993.
19. R. JANARDAN AND F. P. PREPARATA, Widest-corridor problems. Nordic J. Comput., 1:231-245, 1994.
20. D. T. LEE. On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput., vol. C-31:478487, 1982.
21. J. O'ROURKE , Computational Geometry in C. Cambridge University Press, 2nd edition, 1998.
22. J. O'ROURKE, S.R. KOSARAJU AND N. MEGGIDO, Computing circular separability. Discrete Computational Geometry, 1 (1): 105-113, 1986.
23. T. J. RIVLIN, Approximation by circles. Computing, 21:93-104, 1979.
24. G.T. TOUSSAINT , Computing largest empty circles with location constraints. International Journal of Computer and Information Sciences, 12:347-358, 1983.