For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Dividing a Simple Polygon into Two Territories
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1986/04/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Algorithm, Computational Complexity
Full Text: PDF(187KB)>>
This paper consider the 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(n2)-time algorithm is presented where n is the number of vertices of the simple polygon.