3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Vascular morphology by three-dimensional magnetic resonance imaging

A three-dimensional examination of blood vessels is provided using MR data from seven cases. The vascular surfaces are constructed with an algorithm that automatically follows the selected artery or vein and generates a projected three-dimensional gradient shaded image. Fast 3DFT pulse sequences were optimized to enhance the time-of-flight contrast of the intravascular region. By increasing the surface threshold value in a three-dimensional head study, the flesh of a patient's face was peeled away to demonstrate the superfacial temporal artery. Gated cardiac images show the great vessels and cardiac chambers. A three-dimensional view of the aorta shows an irregular surface in the vicinity of an adrenal tumor. 3D MR exams provide a non-invasive technique for assessing vascular morphology in a clinical setting.     

On the feasibility of antideuteron production and storage at CERN

The new Antiproton Accumulator Complex is now in operation at CERN. We consider the possibility of using this facility to create and store antideuterons and conclude that we could achieve an accumulation rate of about 2·10⁶ particles/day. No major rebuild of the rings is envisaged, but it is thought that modification to existing components and becoming operational would take about 5 to 6 months. We stress, however, that the operation of such a facility and the use of any stack of antideuterons for particle physics would be extremely taxing.     

Negative luminescence from mid-wave infrared HgCdTe diode arrays

A self-referencing, optical modulation technique was used to measure the negative luminescence efficiencies of an array of mid-wave infrared HgCdTe photodiodes with cutoff wavelength 4.6 μm as a function of sample temperature. The internal efficiency at a wavelength of 4 μm was 93% at 295 K, and nearly independent of temperature in the 240–300 K range. This corresponds to an apparent temperature reduction >50 K at room temperature and >30 K at 240 K. Moreover, the reverse-bias saturation current density was only 0.13 A/cm². The measured transmission and emission spectra were simulated using empirical HgCdTe absorption formulas from the literature.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.