Reduction of the radar cross section of arbitrarily shaped cavity structures

The problem of the reduction of the radar cross section (RCS) of open-ended cavities was studied. The issues investigated were reduction through lossy coating materials on the inner cavity wall and reduction through shaping of the cavity. A method was presented to calculate the RCS of any arbitrarily shaped structure in order to study the shaping problem. The limitations of this method were also addressed. The modal attenuation was studied in a multilayered coated waveguide. It was shown that by employing two layers of coating, it was possible to achieve an increase in both the magnitude of attenuation and the frequency band of effectiveness. The numerical method used in finding the roots of the characteristic equation breaks down when the coating thickness is very lossy and large in terms of wavelength. A new method of computing the RCS of an arbitrary cavity was applied to study the effects of longitudinal bending on RCS reduction. The ray and modal descriptions for the fields in a parallel plate waveguide were compared. To extend the range of validity of the Shooting and Bouncing Ray (SBR) method, the simple ray picture must be modified to account for the beam blurring

Flip Distance Between Triangulations of a Planar Point Set is APX-Hard

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one edge and adding another one, such that the resulting graph is again a triangulation. Flips are a major way of locally transforming triangular meshes. We show that, given a point set $S$ in the Euclidean plane and two triangulations $T_1$ and $T_2$ of $S$, it is an APX-hard problem to minimize the number of edge flips to transform $T_1$ to $T_2$.Comment: A previous version only showed NP-completeness of the corresponding decision problem. The current version is the one of the accepted manuscrip

Algorithms for distance problems in planar complexes of global nonpositive curvature

CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an algorithm for answering single-point distance queries in a CAT(0) planar complex. Namely, we show that for a CAT(0) planar complex K with n vertices, one can construct in O(n^2 log n) time a data structure D of size O(n^2) so that, given a point x in K, the shortest path gamma(x,y) between x and the query point y can be computed in linear time. Our second algorithm computes the convex hull of a finite set of points in a CAT(0) planar complex. This algorithm is based on Toussaint's algorithm for computing the convex hull of a finite set of points in a simple polygon and it constructs the convex hull of a set of k points in O(n^2 log n + nk log k) time, using a data structure of size O(n^2 + k)

Regression Depth and Center Points

We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions there exists a point that cannot escape to infinity without crossing at least ceiling(n/(d+1)) hyperplanes. We also apply our approach to related questions on the existence of partitions of the data into subsets such that a common plane has nonzero regression depth in each subset, and to the computational complexity of regression depth problems.Comment: 14 pages, 3 figure

On finding widest empty curved corridors

Open archive-ElsevierAn α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets.We present an efficient O(n log3 n)-time algorithm for computing the widest oriented α-siphon through P such that the orientation of a half-line of C is known.We also propose an O(n3 log2 n)-time algorithm for the widest arbitrarily-oriented version and an (nlog n)-time algorithm for the widest arbitrarily-oriented α-siphon anchored at a given point

Spatially hybrid computations for streamer discharges: II. Fully 3D simulations

We recently have presented first physical predictions of a spatially hybrid model that follows the evolution of a negative streamer discharge in full three spatial dimensions; our spatially hybrid model couples a particle model in the high field region ahead of the streamer with a fluid model in the streamer interior where electron densities are high and fields are low. Therefore the model is computationally efficient, while it also follows the dynamics of single electrons including their possible run-away. Here we describe the technical details of our computations, and present the next step in a systematic development of the simulation code. First, new sets of transport coefficients and reaction rates are obtained from particle swarm simulations in air, nitrogen, oxygen and argon. These coefficients are implemented in an extended fluid model to make the fluid approximation as consistent as possible with the particle model, and to avoid discontinuities at the interface between fluid and particle regions. Then two splitting methods are introduced and compared for the location and motion of the fluid-particle-interface in three spatial dimensions. Finally, we present first results of the 3D spatially hybrid model for a negative streamer in air