Timeline for Partitioning a polygon into convex parts
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2022 at 11:31 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
a minor typo
|
| Dec 14, 2014 at 22:36 | comment | added | Joseph O'Rourke | This is called convex hull onion peeling. Too bad I cannot include an image in a comment, but: image. | |
| Dec 14, 2014 at 19:16 | comment | added | Benoît Kloeckner | If I understand well, at each step you remove from the finite set of the previous step some of the points (those that are extremal in the convex hull, I guess). | |
| Dec 14, 2014 at 18:16 | comment | added | Manfred Weis | @BenoîtKloeckner the nested convex hull is constructed by iteratively calculating the convex hull, then removing the points of the convex hull and then to calculate the convex hull of the remaining point set. So this is a set of nested convex polygons. The nested convex hull is also known as the iterated convex hull. | |
| Dec 14, 2014 at 16:54 | comment | added | Benoît Kloeckner | What is the nested convex hull? Does your algorithm handle correctly a polygon made of three concave parts (with only three non-inflex points)? | |
| Dec 14, 2014 at 15:53 | history | answered | Manfred Weis | CC BY-SA 3.0 |
