Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On the discrete unit disk cover problem
Given a set of n points and a set of m unit disks on a 2-dimensional plane, the discrete unit
disk cover (DUDC) problem is (i) to check whether each point in is covered by at least one …
disk cover (DUDC) problem is (i) to check whether each point in is covered by at least one …
Algorithms for halfplane coverage and related problems
H Wang, J Xue - Discrete & Computational Geometry, 2024 - Springer
Given in the plane a set of points and a set of halfplanes, we consider the problem of
computing a smallest subset of halfplanes whose union covers all points. In this paper, we …
computing a smallest subset of halfplanes whose union covers all points. In this paper, we …
[HTML][HTML] Unit disk cover problem in 2D
M Basappa, R Acharyya, GK Das - Journal of Discrete Algorithms, 2015 - Elsevier
In this paper we consider the discrete unit disk cover problem and the rectangular region
cover problem as follows:(i) Given a set P of points and a set D of unit disks in the plane …
cover problem as follows:(i) Given a set P of points and a set D of unit disks in the plane …
Location determination of hierarchical service facilities using a multi-layered greedy heuristic approach
M Wang, H Jiang, Y Li, S Wu, L ** countries are experiencing dramatic growth in both
population and economy, which highlights the need for optimizing service affordance by the …
population and economy, which highlights the need for optimizing service affordance by the …
[HTML][HTML] The within-strip discrete unit disk cover problem
We present a study of the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem, which
is a restricted version of the Discrete Unit Disk Cover (DUDC) problem. For the WSDUDC …
is a restricted version of the Discrete Unit Disk Cover (DUDC) problem. For the WSDUDC …
An exact algorithm for a class of geometric set-cover problems
Given a set R of m disjoint finite regions in the 2-dimensional plane, all regions having
polygonal boundaries, and given a set D of n discs with fixed centers and radii, we consider …
polygonal boundaries, and given a set D of n discs with fixed centers and radii, we consider …
Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks
The coverage problem in wireless sensor networks deals with the problem of covering a
region or parts of it with sensors. In this paper, we address the problem of covering a set of …
region or parts of it with sensors. In this paper, we address the problem of covering a set of …
On the line-separable unit-disk coverage and related problems
G Liu, H Wang - Computational Geometry, 2024 - Elsevier
Given a set P of n points and a set S of m disks in the plane, the disk coverage problem asks
for a smallest subset of disks that together cover all points of P. The problem is NP-hard. In …
for a smallest subset of disks that together cover all points of P. The problem is NP-hard. In …
Multi cover of a polygon minimizing the sum of areas
We consider a geometric optimization problem that arises in sensor network design. Given a
polygon P (possibly with holes) with n vertices, a set Y of m points representing sensors, and …
polygon P (possibly with holes) with n vertices, a set Y of m points representing sensors, and …
Algorithms for the line-constrained disk coverage and related problems
L Pedersen, H Wang - Computational Geometry, 2022 - Elsevier
Given a set P of n points and a set S of m weighted disks in the plane, the disk coverage
problem asks for a subset of disks of minimum total weight that cover all points of P. The …
problem asks for a subset of disks of minimum total weight that cover all points of P. The …