Poznan Area Buildings + Reachable Endpoints for Given RF Transmitter Location and Parameters, with and without RISs Installation.

1- The obstacles_save folder contains arrays defining the vertices locations (x,y) of buildings in the considered area in Poznan, Poland. A transmitter is placed at the center of a square at location [645, 1125]. Possible receiver (or relay trasnceivers) locations are defined as the vertices (i.e., corners) of buildings (from previous list). The goal of the simulation is to find how many hops are needed to reach, if possible, each location from the previously mentioned list of vertices, assuming a maximum allowed path loss value of 80 dB between any two consecutive hops. 2- The arrays in no_ris specify the vertices reachable within N sucessive hops, when no RIS is installed in the area. 3- Similarly, the arrays in single_ris give the coordinates of vertices reachable with N hops when a single RIS is installed in the square (as shown in related paper). 4- Same as (3) but for another RIS installation with another orientation in the same square.1- obstacles_save文件夹包含用于定义波兰波兹南（Poznan）研究区域内建筑物顶点(x,y)坐标的数组。 发射器被部署在一处正方形区域的中心，坐标为[645, 1125]。可选的接收器（或中继收发器）位置被定义为前述建筑物的顶点（即拐角处）。本次仿真的目标为：假设任意相邻两跳之间的最大允许路径损耗为80 dB，计算从上述顶点列表出发，若可行则求出抵达每个顶点位置所需的跳数。 2- no_ris文件夹中的数组定义了区域内未部署智能反射面（RIS, Reconfigurable Intelligent Surface）时，经过N次连续跳便可抵达的顶点集合。 3- 类似地，single_ris文件夹中的数组给出了在该正方形区域内部署单个智能反射面（RIS）时，经过N跳可抵达的顶点坐标（详见相关研究论文）。 4- 与(3)同理，但对应在同一正方形区域内采用另一朝向部署的智能反射面（RIS）的场景。