Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a bitmap image with some blots of solid color on it, what algorithm would you employ to construct polygons in the same shape as the blots?
This can be done in multiple steps: a high-resolution polygon could be later cut down by a best fit algorithm. Bonus points if you can tell me how to cut the resulting polygons into convex components so that they can be rendered in OpenGL without problems.
Reverse rasterizing is referred to as vectorizing. The algorithms are generally quite complex, here’s a googlet of a few of them. Check out sparse pixel tracking and sparse pixel vectorization for some good examples.
For good algorithms for polygon partitioning, check out Joespeh O’Rourkes ‘Computational Geometry in C’, ISBN 0-521-44034-3, or search for concave polygon partitioning algorithms, such as this