isovist and visibility graph analysis tools are used to quantify and measure the quality of space, and despite their lack of maturity and evolution, they are considered to be the future of space analysis tools by researchers. this study was undertaken with the purpose of introducing the aforementioned tools for analyzing sanandaj’s urban areas. in this study, four different urban areas in sanan...

In an alternative approach to \characterizing" the graph class of visibility graphs of simple polygons, we study the problem of nding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that no ...

In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that n...

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...

Mobile robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. This is the problem of planning a path through a continuous domain, for which several approaches have been developed. A method for autonomous mobile robot path planning is presented. Ini...

We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zerovisibility copnumber in terms of the pathwidth.

Consider a random geometric graph defined on n vertices uniformly distributed in the ddimensional unit torus. Two vertices are connected if their distance is less than a “visibility radius” rn. We consider Bluetooth networks that are locally sparsified random geometric graphs. Each vertex selects c of its neighbors in the random geometric graph at random and connects only to the selected points...