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.     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Quantitative analysis of imazamox herbicide in environmental water samples by capillary electrophoresis electrospray ionization mass spectrometry

Capillary electrophoresis-mass spectrometry (CE-MS) with an electrospray ionization interface was applied for the quantitative analysis of imazamox pesticide in well water, potable water, and pond water. The detector response for imazamox was determined to be linear over the concentration range of 50-1 ng/ml. The limits of quantitation and detection of the method were determined to be 200 and 20 ng/l for imazamox compound in each type of water sample, respectively. The total sample preparation and CE-MS analysis time was under 2 h.     

A single crystal study of eight-layer barium managanese oxide,BaMnO3

A single crystal study of hydrothermally prepared eight-layer BaMnO₃ has been carried out which confirms the (Zhdanov notation) 121121 layer stacking scheme for the BaO₃ layers. The MnO₆ octahedra share faces in strings of four, and these strings are connected to each other by corner sharing. The compound has an hexagonal unit cell of dimensions a = 5.667 ± 0.003 and c = 18.738 ± 0.009 Å, probable space group $\text{P6}{}_3\text{mmc}\text{, Z = 8}$. Its structure has been determined from 352 independent reflections, of which 242 were considered observed, collected manually by a counter technique and refined to a conventional R value of 0.079.