Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...

A review of the archeological and non-archeological use of visibility networks reveals the use of a limited range of formal techniques, in particular for representing visibility theories. This paper aims to contribute to the study of complex visual relational phenomena in landscape archeology by proposing a range of visibility network patterns and methods. We propose firstand second-order visib...

We present a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visib...

The efficient evaluation of visibility in a three-dimensional scene is a longstanding problem in computer graphics. Visibility evaluations come in many different forms: figuring out what object is visible in a pixel; determining whether a point is visible to a light source; or evaluating the mutual visibility between 2 surface points. This paper provides a new, experimental view on visibility, ...

This paper describes the Visibility Octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an eeective control over the coarseness of the vis...

Visibility trends on the island of Taiwan were investigated employing visibility and meteorological (1961-2003), and air pollutant (1994-2003) data from one highly urbanized center (Taipei), one highly industrialized center (Kaohsiung), and two rural centers (Hualien and Taitung). Average annual visibility (1961-2003) was significantly higher at the rural centers. Unlike at the other centers, v...

In this paper we introduce unit bar k-visibility graphs, which are bar kvisibility graphs in which every bar has unit length. We show that almost all families of unit bar k-visibility graphs and unit bar k-visibility graphs are incomparable under set inclusion. In addition, we establish the largest complete graph that is a unit bar k-visibility graph. As well, we present a family of hyperbox vi...

Supply chain visibility continues to be a major concern for organizations. While there is a general perception that supply chain visibility is driven by information sharing and enabling information technologies, there are gaps in our understanding of what constitutes supply chain visibility and the specific information technology configurations that may be implemented for enabling visibility. T...

This paper describes the Visibility Octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an eeective control over the coarseness of the vis...

Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing visibility errors. We build a hierarchy of large convex occluders using face clustering. This structure is efficiently exploited to avoid computing visibility between mutually fully occluded scene elements. Used in con...