TIPS: On Finding a Tight Isothetic Polygonal Shape Covering a 2D Object
The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to image mining, rough sets, computational geometry, and robotics. Designing efficient algorithms for these cover problems was an open problem in the literature. The elegance of the proposed algorithm lies in utilizing the inherent combinatoral properties of the relative arrangement of the object and the grid lines. The shape and the relative error of the polygonal cover can be controlled by changing the granularity of the grid. Experimental results on various complex objects with variable grid sizes have been reported to demonstrate the versatility, correctness, and speed of the algorithm.
- 2.Gatrell, L.: Cad-based grasp synthesis utilizing polygons, edges and vertices. In: Proc. IEEE Intl. Conf. Robotics and Automation, pp. 184–189 (1989)Google Scholar
- 3.Kamon, Y., Flash, T., Edelman, S.: Learning to grasp using visual information. In: Proc. IEEE Intl. Conf. Robotics and Automation, pp. 2470–2476 (1995)Google Scholar
- 5.Liu, M., He, Y., Hu, H., Yu, D.: Dimension Reduction Based on Rough Set in Image Mining. In: Das, G., Gulati, V.P. (eds.) CIT 2004. LNCS, vol. 3356, pp. 39–44. Springer, Heidelberg (2004)Google Scholar
- 6.Morales, A., Sanz, P.J., del Pobil, Á.P.: Vision-Based Computation of Three-Finger Grasps on Unknown Planar Objects. In: IEEE Intl. Conf. on Intelligent Robots and Systems, pp. 1711–1716 (2002)Google Scholar