Recently the light-field and lumigraph systems have been proposed as general methods of representing the visual information present in a scene. These methods represent this information as a 4D function of light over the domain of directed lines. These systems use the intersection points of the lines on two planes to parameterize the lines in space. This paper explores the structure of the two-p...

The core of multiple-view geometry is governed by the fundamental matrix and the trilinear tensor. In this paper we unify both representations by rst deriving the fundamental matrix as a rank-2 trivalent tensor, and secondly by deriving a uniied set of operators that are transparent to the number of views. As a result, we show that the basic building block of the geometry of multiple views is a...

In order to reach higher acceleration gradients in linear accelerators, it is advantageous to use a higher accelerating RF frequency, which in turn requires smaller accelerating structures. As the structure size becomes smaller, rectangular structures become increasingly interesting because they are easier to construct than cylindrically symmetric ones. [1,2] One drawback of small structures, h...

The paper outlines the relevance of computational geometry within the design and production process of architecture. Based on two case studies, the digital chain from the initial formfinding to the final realization of spatial concepts is discussed in relation to geometric principles. The association with the fascinating complexity that can be found in nature and its underlying geometry was the...

In the present paper the pressure drop characteristics of a 1.4 mm hydraulic diameter multiport minichannel tube during adiabatic two-phase flow of HFC refrigerants are discussed. The tube consists of eleven parallel rectangular cross section channels. Although much experimental research has been devoted to investigate the pressure drop characteristics of R134a inside multiport minichannels in ...

We first scale the instance. If we see two points x, y as a vector, we can replace them by αx and αy. By the properties of a norm, w(αx, αy) = ‖αx − αy‖ = α‖x − y‖. Therefore all distances are scaled by α. We choose an α > 0 such that all vertices fit exactly into an axis-parallel n2 × n2 square (where n = |V |), i. e., all vertices fit into the square and there are two vertices that lie on opp...

Let G = (V, E) be a directed acyclic graph with two distinguished vertices s, t, and let F be a set of forbidden pairs of vertices. We say that a path in G is safe, if it contains at most one vertex from each pair {u, v} ∈ F. Given G and F, the path avoiding forbidden pairs (PAFP) problem is to find a safe s–t path in G. We systematically study the complexity of different special cases of the P...

In an earlier paper, I showed that the classes of pentagon-free two-graphs and of pentagon-and-hexagon-free two-graphs could be represented in terms of trees. This paper gives formulae for the numbers of labelled objects in each of these classes, as well as the numbers of labelled reduced two-graphs in each class. The proofs use various enumeration results for trees. At least some of these resu...

The total scattering cross section of polycrystalline materials in the thermal neutron region contains valuable information about the scattering processes that neutrons undergo as they pass through the sample. In particular, it displays characteristic discontinuities or Bragg edges of selected families of lattice planes. We have developed a pixelated time-of-flight transmission detector able to...

We further develop the corresp0ndenc.e established in Part I of this paper to characterize optimal soluticns to the gossip problem in which no one hears his own information. To reiterate, these are graphs on n vertices with 2n -4. edges (n even), for which the edges c:ln bc linearly ordered to produce an increasing path from each vertex to every other, without having an imzzeasing path from any...