1. An optimal algorithm for determining the visibility of a polygon from an edge;Avis;IEEE Transactions on Computers,1981
2. Optimally computing a shortest weakly visible line segment inside a simple polygon;Bhattacharya;Computational Geometry Theory and Applications,2002
3. P. Bose, P. Morin, M. Smid, S. Wuhrer, Rotational clamshell casting in three dimensions, Technical Report TR0604, Carleton University, 2006
4. P. Bose, P. Morin, M. Smid, S. Wuhrer, Rotationally monotone polygons, in: Proceedings of the Canadian Conference on Computational Geometry, 2006, pp. 105–108
5. Generalizing monotonicity: On recognizing special classes of polygons and polyhedra by computing nice sweeps;Bose;International Journal of Computational Geometry,2005