http://openproblemgarden.org/op/convex_equipartitions_with_extreme_perimeter Comments for "Convex Equipartitions with Extreme Perimeter" en http://openproblemgarden.org/op/convex_equipartitions_with_extreme_perimeter <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/nandakumar_r_amrita_school_of_arts_and_science_kochi_682024_india">Nandakumar</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/geometry">Geometry</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <p>To divide a given 2D convex region C into a specified number n of convex pieces all of equal area (perimeters could be different) such that the total perimeter of pieces is (1) maximized (2) minimized.</p> <p>Remark: It appears maximizing the total perimeter is the easier problem.</p> </tr></td> </table> </td> </tr> </table> Nandakumar, R., Amrita School of Arts and Science, Kochi 682024, India convex equipartition Geometry http://openproblemgarden.org/op/convex_equipartitions_with_extreme_perimeter#comment Thu, 22 Oct 2015 09:19:25 +0200 Nandakumar 60010 at http://openproblemgarden.org