Given a set of n non-intersecting line segments $\mathcal{L}$ and a set Q of m points in ${\mathbb{R}}^2$; we present algorithms of the discrete two-center problem for (i) covering, (ii) stabbing and (iii) hitting the set $\mathcal{L}$ in (i) $O(m(m+n){\log }^{2}n)$, (ii) $O(m^{2}n\log n)$ and (iii) $O(m(m+n){\log }^{2}n)$ time respectively, where the two disks are centered at two points of Q and radius of the larger disk is minimized. We also study the mixed two-center problems for (i) covering, (ii) stabbing and (iii) hitting the set $\mathcal{L}$, where only one of the disks is centered at a point $q_i\in Q$ and the other disk is centered at any point in ${\mathbb{R}}^2$, and these three problems are solved in (i) $O(mn\log n)$, (ii) $O(m{n}^3\log n)$ and (iii) $O(mn{\log }^{2}n)$ time, respectively. The space complexities for all these algorithms are linear.

给定一组n 个不相交的线段$\mathcal{L}$和m 个点的集合Q${\mathbb{右}}^2$; 我们提出了离散双中心问题的算法（i）覆盖，（ii）刺伤和（iii）击中集合$\mathcal{L}$在(一)中$氧（米（米+n）{\mathrm{日志}}^{2}n）$，（二）$氧（{米}^{2}n\mathrm{日志}n）$(三)$氧（米（米+n）{\mathrm{日志}}^{2}n）$时间，其中两个圆盘以Q的两个点为中心，并且较大圆盘的半径最小化。我们还研究了（i）掩护、（ii）刺击和（iii）击球的混合双中心问题$\mathcal{L}$，其中只有一个圆盘以一点为中心$q_{我}\epsilon 问$另一个圆盘以任意点为中心${\mathbb{右}}^2$，这三个问题在 (i) 中得到解决$氧（米n\mathrm{日志}n）$，（二）$氧（米n^3\mathrm{日志}n）$(三)$氧（米n{\mathrm{日志}}^{2}n）$分别是时间。所有这些算法的空间复杂度都是线性的。