Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I did an algorithm like this for finding the diameter of the largest circle that can fit inside an arbitrary irregular polygon. Concave or convex.

After much futzing it seems to be the only sane way. Fast too.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: