•  
  •  
 

Journal of System Simulation

Abstract

Abstract: A precisely algorithm of total coverage area when a plurality of circulars are random deployed and overlapping with each other is needed. The key issues of the solution are the calculating principle of the overlapping area, the differentiation and enumeration of the multi-overlapping circulars, and the calculation of the multi-shaped curved edges. Based on the inclusion-exclusion principle, overlapping area was added or subtracted to the amount area. The computer calculation process was proposed. Because the circulars are random deployed, in order to ensure the area coverage, the area cover rate problem of repeatedly deployment of the circulars were simulated and analyzed.

First Page

2896

Revised Date

2015-06-21

Last Page

2902

CLC

TP391.9

Recommended Citation

Zhang Ye, Liu Kui, Chen Yuzhi, Liu Junyang, Du Jianchao. Precisely Algorithm and Simulation of Plurality of Random Deployed Circulars’ Total Coverage Area[J]. Journal of System Simulation, 2016, 28(12): 2896-2902.

DOI

10.16182/j.issn1004731x.joss.201612003

Share

COinS