[HTML][HTML] Packing, covering and tiling in two-dimensional spaces

C Zong - Expositiones Mathematicae, 2014 - Elsevier
Packing, covering and tiling is a fascinating subject in pure mathematics. It mainly deals with
arrangement patterns and efficiencies of geometric objects. This subject has a long and rich …

3D model-based scan planning for space frame structures considering site conditions

D Li, J Liu, Y Zeng, G Cheng, B Dong… - Automation in Construction, 2022 - Elsevier
The acquisition of point cloud data from a space frame using terrestrial laser scanning is
usually affected by many occluding components and site conditions and therefore needs to …

SDRS: A stable data-based recruitment system in IoT crowdsensing for localization tasks

A Alagha, R Mizouni, S Singh, H Otrok… - Journal of Network and …, 2021 - Elsevier
Mobile Crowdsensing (MCS), an important component of the Internet of Things (IoT), is a
paradigm which utilizes people carrying smart devices, referred to as “workers”, to perform …

Covering a rectangle with equal circles

A Heppes, H Melissen - Periodica Mathematica Hungarica, 1997 - Springer
Recently, Tarnai and Gáspár [22] used mechanically inspired computer simulations to
construct thin coverings of a square with up to ten equal circles. We generalise the problem …

[HTML][HTML] Covering a rectangle with six and seven circles

JBM Melissen, PC Schuur - Discrete Applied Mathematics, 2000 - Elsevier
In a recent article (Heppes and Melissen, Period. Math. Hungar. 34 (1997) 63–79), Heppes
and Melissen have determined the thinnest coverings of a rectangle with up to five equal …

Improved coverings of a square with six and eight equal circles

JBM Melissen, PC Schuur - the electronic journal of …, 1996 - combinatorics.org
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a
square with up to ten equal circles. We will give improved coverings with six and eight …

I-DEEC: improved DEEC for blanket coverage in heterogeneous wireless sensor networks

V Nehra, AK Sharma, RK Tripathi - Journal of Ambient Intelligence and …, 2020 - Springer
Event critical applications demand blanket coverage. On the other hand, nodes closer to the
base station are exploited as they have to spend additional energy in relaying data of far …

Efficient algorithm for placing a given number of base stations to cover a convex region

GK Das, S Das, SC Nandy, BP Sinha - Journal of Parallel and Distributed …, 2006 - Elsevier
In the context of mobile communication, an efficient algorithm for the base-station placement
problem is developed in this paper. The objective is to place a given number of base …

Partial paving strategy: application to optimize the area coverage problem in mobile wireless sensor networks

A Boualem, C De Runz, M Ayaida - Journal of Wireless Mobile …, 2022 - hal.science
Finding the minimum number of sensor nodes to ensure coverage of an area for a maximum
of time duration is an NP-difficult problem, especially in large areas. The mathematical …

Covering a compact polygonal set by identical circles

YG Stoyan, VM Patsuk - Computational Optimization and Applications, 2010 - Springer
The paper considers the problem of covering compact polygonal set by identical circles of
minimal radius. A mathematical model of the problem based on Voronoi polygons is …