Revision history [back]

Hi, I have a polygon and i need to allocate space for given rectangular dimension in an effective way and this needs to be done sequentially every time we have a request. So every time I have a request, I need to process my polygon to see if I have the space to allocate for the requested rectangular area. I intended to do this in C# and after talking to some technical heads they suggested me to use skeleton algorithm which is most commonly used for image processing. For this I need to convert my polygon into bitmap which i had done and now need to process through skeleton algorithm. I need guidance here as I'm still struggling to use this algorithm. I understand skeleton algorithm on high level that its used for thinning process but i'm entirely not sure if i can achieve my requirements with this algorithm. For instance, if I request rectangular area of width 100 and length 60, how does this algorithm helps me to find the unused portion sequentially in the given polygon(now a bitmap)? Any help is highly appreciated.