References
- Aggarwal , A. , Imai , H. , Katoh , N. and Suri , S. 1991 . Finding k points with minimum diameter and related problems . Journal of Algorithms , 12 : 38 – 56 .
- Datta , A. , Lenhof , H.P. , Schwarz , C. and Smid , M. 1993 . “ Static and dynamic algorithms fork point clustering problems ” . In Lecture Notes in Computer Science Vol. 709 , 265 – 276 . New York
- Eppstein , D. 1992 . New algorithms for minimum area fc-gons . Proceedings of the 3rd ACM-SIàM Symposium on Discrete Algorithms . 1992 . pp. 83 – 88 .
- Eppstein , D. and Erickson , J. 1993 . Iterated nearest neighbours and finding minimal poly topes . Proceedings of the fourth ACM Symposium on Discrete Algorithms . 1993 . pp. 64 – 73 . Austin , Texas
- Jeyalakshmi , S. 1998 . Minimum L-shaped polygons enclosing fc-subsets of a point set , Madras : Indian Institute of Technology . M.S Thesis
- Jeyalakshmi , S. and Krithivasan , K. Some optimal isothetic polygons enclosing kpoints . International Symposium on Intelligent Robotic Systems . Bangalore , , India
- Segal , M. and Kadern , K. 1996 . Enclosing k points in the smallest axis parallel rectangle . Proceedings of the eighth Canadian conference on Computational Geometry . 1996 . Vol. 5 , pp. 20 – 25 . Ottawa , , Canada : Carleton University .
- O'Rourke , J. 1987 . Art Gallery Theorems and Algorithms , Oxford University Press .
- Preperata , F.P. and Shamos , M.I. 1985 . Computational Geometry-An Introduction , Springer-Verlag .