The 2-center problem for a convex polgon $G$ is to cover $G$ by two congruent closed disks whose radius is as small as possible. This is a variation of the standard 2-center problem in which the two disks cover a set of $n$ points given in the plane. The standard 2-center problem has been studied ex...
#Computational geometry Convex polygon Center 계산기하학 볼록다각형 센터;
|총페이지||ii, 37 p.|
|키워드||Computational geometry Convex polygon Center 계산기하학 볼록다각형 센터|
DOI 인용 스타일