과제정보
연구 과제 주관 기관 : 경기대학교
참고문헌
- F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, 1985.
- M. de Berg, O. Cheong, M. van Kreveld and M. Overmars, Computationsl Geometry: Alogorithms and Applications, 3rd Ed., Springer-Verlag, 2008.
- M. Abellanas, F. Hurtado, Icking C., R. Klein, E. Langetepe, L. Ma, P. Palop and V. Sacristan, "Smallest Color-Spanning Objects," Proc. Euro. Sympos. Algo. (ESA 2001), LNCS, Vol. 2161, pp. 278-289, 2001.
- D. Huttenlocher, K. Kedem and M. Sharir, "The Upper Envelope of Voronoi Surfaces and Its Applications," Discrete Comput. Geom., Vol. 9, pp. 267-291, 1993. https://doi.org/10.1007/BF02189323
- M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, P. Palop and V. Sacristan, "The Farthest Color Voronoi Diagram and Related Problems," Proc. 17th Euro. Comput. Geom (EuroCG 2001), pp. 113-116, 2001.
- S. Das, P. Goswami and S. Nandy, "Smallest Color-Spanning Object Revisited," Int. J. Comput. Geom. Appl., Vol. 19, pp. 457-478, 2009. https://doi.org/10.1142/S0218195909003076
- A. D. Wainstein, "A non-monotonous placement problem in the plane," Software Systems for Solving Optimal Planning Problems, Abstract: 9th All-Union Symp. USSR, Symp., 1986.
- H. Ebara, N. Fukuyama, H. Nakano and Y. Nakanishi, "Roundness algorithms using the Voronoi diagrams," Abstracts 1st Canadian Conf. Comput. Geom (CCCG), 1989.
- P. K. Agarwal and M. Sharir, "Efficient randomized algorithms for some geometric optimization problems," Discrete Comput. Geom., Vol. 16, pp. 317-337, 1996. https://doi.org/10.1007/BF02712871
- M. Abellanas, F. Hurtado, C. Icking, L. Ma, B. Palop and P. A. Ramos, "Best Fitting Rectangles," Proc. 19th Euro. Workshop Comput. Geom. (EuroCG 2003), 2003.
- O. Gluckshenko, H. W. Hamacher and A. Tamir, "An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width," Operations Research Lett., Vol. 37, pp. 168-170, 2009. https://doi.org/10.1016/j.orl.2009.02.007
- S.W. Bae, "Computing a Minimum-Width Square Annulus in Arbitrary Orientation," Proc. 10th Int. Workshop on Algo. Comput. (WALCOM 2016), LNCS, Vol. 9627, pp. 131-142, 2016.
- J. Mukherjee, P. R. S. Mahapatra, A. Karmakar and S. Das, "Minimum-width rectangular annulus," Theoretical Comput. Sci., Vol. 508, pp. 74-80, 2013. https://doi.org/10.1016/j.tcs.2012.02.041
- A. Acharyya, S. Nandy and S. Roy, "Minimum Width Color Spanning Annulus," Proc. 22nd Int. Comput. Combinat. Conf. (COCOON 2016), LNCS, Vol. 9797, pp. 431-442, 2016.
- J. Hershberger, "Finding the upper envelope of n line segments in O(n log n) time," Inform. Proc. Lett., Vol. 33, pp. 169-174, 1989. https://doi.org/10.1016/0020-0190(89)90136-1