Abstract
A convex fair partition of a convex polygonal region is defined as a partition on which all regions are convex and have equal area and equal perimeter. In this article we describe an algorithm that finds such fair partition.•The Fair Partitions method finds a fair partition for any given convex polygon and any given number of regions.•Our method relies on two well-known methods: Lloyd's algorithm and the Normal Flow Algorithm.•The method proposed in this article can be used in various contexts and many real-world applications.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
