Presents an algorithm to divide a simple polygon into regions based on proximity to two points.
This paper considers the following problem : Given two points u and v in a simple polygon P, divide P into three parts, locus of points closer to u, that closer to v, and that equidistant from u and v. An O(n**2)-time algorithm is presented where n is the number of vertices of the simple polygon.
No takes yet. Share an insight, caveat, or question.
浅野 et al. (1986) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: