Abstract
In this paper we study the problem of partitioning a convex polygon P of n vertices into m polygons of equal area and perimeter. We give an algorithm for m=2 that runs in O(n) time, and an algorithm for m=2k, where k is an integer, that runs in O((2n)k) time. These are the first algorithms to solve this problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
