| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3650 |
| 2 | Benq | 3582 |
| 3 | Geothermal | 3570 |
| 3 | orzdevinwang | 3570 |
| 5 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3532 |
| 8 | Radewoosh | 3522 |
| 9 | Um_nik | 3483 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 157 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 150 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Does anyone know an algorithm to solve the following problem:
Given a sequence of points in the plane that represent a polygon (not necessarily convex), output the maximum possible radius of a circle that can fit inside this polygon.
It would be good if it was below O(n2), but any references are welcome. Thanks ahead.
Auto comment: topic has been updated by kowalsk1 (previous revision, new revision, compare).
If it was convex, you could make inequalities of form Ax+By+Cr>=0. For non-convex you need something different.
Binary search for R. if you choose R to be your radius check if size R circle fits inside.
You probably will need veronoi diagrams.
How do you determine in which point should be center of the circle?
All right, I already understand how. If somebody still curious — visit this article.
In each vertex with reflex angle generate two new polygons without that vertex. Black is non-convex. Red and green are new polygons. And after having only convex ones get maximum of circles in each polygon. Algorithm at emaxx for convex.
Where's O(2^n) subpolygons...
Btw, why did you not just google your question? I found answer for that in few minutes.