An Algorithmic Approach to Decorative Content Placement

Given a polygon P of n vertices, the method to define a visibility polygon from a single point, q, is a well established Most digital games are goal-oriented; players are given an problem (Ghosh 2007), of time complexity Θ(n log(n)). We initial position and have to reach a certain goal position or use the well known angular plane-sweep algorithm (Asano state within a virtual level. Many generative methods to create 1985) to construct a visibility region V (q), giving us a starshaped such levels have been defined, and are able to create engaging polygonal region defined by the existing edge set, levels (Dormans and Bakkes 2011), while making filtered according to visibility from q. Figure 2 shows such a sure the game's fundamental puzzle structure in terms of region in light purple for point q.