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.     

Barotropic Instability of the Bickley Jet at High Reynolds Numbers

We investigate the linear stability of the Bickley jet in the framework of the beta-plane approximation. Because singular inviscid neutral modes exist in the retrograde case     , it is necessary to add viscosity to interpret them. One of these modes was found in closed form by Howard and Drazin [1] . However, its critical point is at the center of the jet and it was therefore not possible for these authors to ascertain the relationship of this mode to the stability problem or to discuss how to continue the eigenfunction across the singularity.
The viscous critical layer problem associated with this singularity is considerably more difficult than the usual one (which leads to integrals of the Airy function) because     and, consequently, a second-order turning point is involved. Our analysis shows that the Howard–Drazin mode is degenerate in the domain where it is valid as a limit of the viscous problem (wavenumber  α²≤ 9/2  ), that is, it corresponds to both an odd and an even mode. This conclusion is confirmed by direct numerical solution of the Orr–Sommerfeld equation which shows, in addition, that viscosity is destabilizing along portions of the stability boundary. For a retrograde jet, instability is found to occur beyond the inviscid critical value of β, that is, in the region where the flow would be stable according to the Rayleigh–Kuo condition.     

Stable Ergodicity and Frame Flows

In this note we show that all diffeomorphisms close enough to the time-one map of the frame flow on certain negatively curved manifolds are ergodic. As a simple corollary we deduce that the frame flows are ergodic for all compact manifolds with curvature pinched sufficiently close to –1, thus providing results in the case of manifolds of dimension 7 or 8 which were missing from the results of Brin and Karcher.