1. E. M. Arkin, M. Held, J. S. B. Mitchell, S. S. Skiena. Hamiltonian Triangulations for Fast Rendering. Visual Computer, 12:429–444, 1996.
2. B. K. Bhattacharya and S. K. Ghosh. Characterizing LR-visible polygons and related problems. Proc. of CCCG 1998; (accepted to CGTA, 2000).
3. B. Chazelle. Triangulating a simple polygon in linear time. Proc. of the 31-st Annual IEEE FOCS 220–229, 1990.
4. G. Das, P. J. Heffernan and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. Nordic J. of Comput. 1:433–457, 1994.
5. G. Das, P. J. Heffernan and G. Narasimhan. LR-visibility in polygons. Computational Geometry: Theory and Applications 7:37–57, 1997.