Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

Algorithm to merge adjacent rectangles into polygon

Tags:

I guess that my problem is related to "convex hull", but no the same. All shapes in the drawing are rectangles with same width and height. Many are adjacent to each other. I want to combine those adjacent rectangles into polygons. Unlike "convex hull", the resuled polygons could be "hollow" inside.

Is there any open source algorithm available?

Related questions

Experiences with UI Automation and WPF [closed]
Best "pattern" for Data Access Layer to Business Object
Is there any way to speed up the Selenium Server load time?
What are the practical uses of Factory Method Pattern?
How are you keeping your WPF resources organized on large projects?
What are the benefits of covariance and contravariance?
Help catching StackOverflowException with WinDbg and ADPlus
Is it bad practice to use unicode symbols or shapes in a  app?
Hide keyboard when losing focus off UISearchBar
Is there a unit testing framework for testing PowerShell with PowerShell scripts? [closed]
jQuery XML Parsing/Traversing
Using iText (iTextSharp) to populate XFA form fields in PDF?

Donate For Us

If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!