Research Article
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks
Figure 6
The proof of Inference 22. (a) The edge is a diagonal edge in the complete graph, and not all the 2-simplices generated by the edge are in the complete graph. (b) A new hole is generated when the edge is deleted. (c) The edge is a diagonal edge in the complete graph, and all the 2-simplices generated by the edge are in the complete graph. (d) No hole will be generated when the edge is deleted.
(a) |
(b) |
(c) |
(d) |