The 2-Center Problem with Obstacles
โ
Dan Halperin; Micha Sharir; Ken Goldberg
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 190 KB
Given a set S of n points in the plane and a set O of pairwise disjoint simple polygons with a total of m edges, we wish to find two congruent disks of smallest radius whose union covers S and whose centers lie outside the polygons in O (referred to as locational constraints in facility location the