Graham algorithm development for constructing convex hulls of bitmapped objects

User Rating:  / 0
PoorBest 
Category: IT technologies
Last Updated on Saturday, 05 January 2013 16:45
Published on Saturday, 05 January 2013 16:45
Hits: 3683

 

Authors: T.A. Ruzova
 
It has been analysed the problems occuring while using Graham algorithm for constructing convex hulls of bitmapped objects. It is proposed the algorithm of making hulls for geometrically-complex objects improvement which allows avoiding errors caused by discrete representation of contour. Proposed approach can be used for designing software concerning wide range of problems.
Files:
2010_11-12 Ruz
Date 2012-12-14 Filesize 371.68 KB Download 1182
 
Tags: Graham algorithmconvex hullbitmapped imageobject’s contourpolar angle