Kavand, P., Mohades, A., Eskandari, M.. (1393). (n,1,1,α)-Center Problem. نشریه مهندسی عمران امیرکبیر, 46(1), 57-64. doi: 10.22060/miscj.2014.535
P. Kavand; A. Mohades; M. Eskandari. "(n,1,1,α)-Center Problem". نشریه مهندسی عمران امیرکبیر, 46, 1, 1393, 57-64. doi: 10.22060/miscj.2014.535
Kavand, P., Mohades, A., Eskandari, M.. (1393). '(n,1,1,α)-Center Problem', نشریه مهندسی عمران امیرکبیر, 46(1), pp. 57-64. doi: 10.22060/miscj.2014.535
Kavand, P., Mohades, A., Eskandari, M.. (n,1,1,α)-Center Problem. نشریه مهندسی عمران امیرکبیر, 1393; 46(1): 57-64. doi: 10.22060/miscj.2014.535

(n,1,1,α)-Center Problem

AUT Journal of Modeling and Simulation
مقاله 6، دوره 46، شماره 1، 2014، صفحه 57-64    اصل مقاله (584.49 K)
نوع مقاله: Research Article
شناسه دیجیتال (DOI): 10.22060/miscj.2014.535
نویسندگان
P. Kavand1؛ A. Mohades* 2؛ M. Eskandari3
1PhD. Student of Computer Science, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran.
2Associate Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
3Assistant Professor, Department of Mathematics, Alzahra University, Tehran, Iran
چکیده
Given a set  of  points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrained version. Then, we present an  algorithm for solving the -center problem. Finally, we propose a linear time algorithm for its constrained version.
کلیدواژه‌ها
computational geometry؛ K-Center Problem؛ Farthest Point Voronoi Diagram؛ Center Hull
مراجع
آمار
تعداد مشاهده مقاله: 1,307
تعداد دریافت فایل اصل مقاله: 1,544
پیوندهای مفید
آمار
تعداد نشریات9
تعداد شماره‌ها455
تعداد مقالات5,773
تعداد مشاهده مقاله8,414,320
تعداد دریافت فایل اصل مقاله6,975,057