The whole process of realtime-rendering is usually structured into several parts, like rendering scenegraph, visibility processing and interaction device handling. Ideally each parts function-ality should be offered in an efficient and reusable C++-library. For the visibility processing we discuss requirements and design options for the library. The discussion is based on the OpenSG scenegraph ...

A complementarity relation is shown between the visibility of interference and bipartite entanglement in a two qubit interferometric system when the parameters of the quantum operation change for a given input state. The entanglement measure is a decreasing function of the visibility of interference. The implications for quantum computation are briefly discussed.

A complementarity relation is shown between the visibility of interference and bipartite entanglement in a two qubit interferometric system when the parameters of the quantum operation change for a given input state. The entanglement measure is a decreasing function of the visibility of interference. The implications for quantum computation are briefly discussed.

Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P . We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P . Al...

Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axisparallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i. e., the problem of representing USGV with fixed visibilities within small area and, for USV, the gener...

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...

This paper introduces the concept of geo-consistency to overcome the occlusion problems associated with wide-baseline multiple-camera stereo. By expressing more formally the geometric relationship between occlusion and visibility, it provides a new tool to understand and compare the behavior of stereo algorithms. In this context, we present a new visibility mask handling that can render most re...

Dark-adapted spectral sensitivities were measured in the peripheral retinas of 38 patients diagnosed as having typical retinitis pigmentosa (RP) and in 3 normal volunteers. The patients included those having autosomal dominant and autosomal recessive inheritance patterns. Results were analysed by comparisons with the CIE standard scotopic spectral visibility function and with Judd's modificatio...