Sensors coverage problem

Using Topological Data Analysis the problem of asking whether a set of sensors cover some region is solved. Two settings are considered, one where we do know about the exact location of sensors and one where we do not.

This is a partial implementation of the paper Coordinate-free coverage in sensor networks with controlled boundaries via homology by V. De Silva and R. Ghrist. Link to paper.

This repository does not explain the concepts used from algebraic topology, it merely justifies their usage.

Network creator

To create networks which we wish to consider, a visual creator is located in network_creator, hosted at github.shilangyu.dev/sensors-coverage/network_creator/.

Coordinate-full setting

Sensor coverage problem solved by means of homology of the Čech complex in a coordinate-full scenario. See here.

Coordinate-free setting

Sensor coverage problem solved by means of the Rips complex and its relative homology in a coordinate-free scenario. See here.

Network examples

Sensor network with $r_c = r_b$ falling to cover the region (there are 4 1 dimensional holes).

Sensor network with $r_c = r_b$ covering the region.