Dividing a simple polygon into two territories

Key Points

• The research aims to devise a method to partition a simple polygon based on distances to two specific points.
• Considered a simple polygon with designated points u and v.
• Developed an O(n^2)-time algorithm for division.
• Categorized regions as closer to u, closer to v, and equidistant from both u and v.
• Successfully divided the polygon into three distinct regions based on closeness.
• Achieved this partitioning using a time-efficient algorithm.
• The proposed method scales quadratically with the number of vertices.