Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
swayvil
on Sept 11, 2022
|
parent
|
context
|
favorite
| on:
Monte Carlo Geometry Processing
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:
After much futzing it seems to be the only sane way. Fast too.