Construction of the Generalized Czech Complex

In this paper, we introduce a centralized algorithm which constructs the generalized Cech complex. The generalized Cech complex represents the topology of a wireless network whose cells are different in size. This complex is useful to address a wide variety of problems in wireless networks such as: boundary holes detection, disaster recovery or energy saving. We have shown that our algorithm constructs the minimal generalized Cech complex, which satisfies the requirements of these applications, in polynomial time.