Zooplankton and chlorophyll in upper water layers within research polygons in the Atlantic Ocean, June-September 2001

During Cruise 46 of R/V Akademik Mstislav Keldysh (from June to September 2001), vertical distributions of Radiolaria (Acantharia - Bac and Euradiolaria - Beur), mesozooplankton (from 0.2 to 3.0 mm size, Bm), and chlorophyll a (Cchl) in the epipelagic zone of the North Atlantic were studied. To examine the above-listed characteristics, samples were taken by Niskin 30 l bottles from 12-16 depth levels within the upper 100 to 200 m layer in the subarctic (48°11'N, 16°06'W) and subtropical (27°31'N, 75°51'W) waters, as well as in the transitional zone (41°44'N, 49°57'W). The latter proved to be characterized by the highest values of all averaged parameters examined by us within the upper 100 m layer (Bm - 365mg/m**3, Bac - 140 mg/m**3, Beur - 0.37 mg/m**3, and Cchl - 0.32 mg/m**3). For subarctic and subtropical waters corresponding characteristics were as follows: Bm - 123 and 53 mg/m**3, Bac - 0 and 0.06 mg/m**3, Beur - 0.17 and 0.19 mg/m**3, and Cchl - 0.27 and 0.05 mg/m**3, respectively. Percentage of Acantharia in total biomass of Radiolaria and zooplankton ranged from 0 to 39%, whereas that of Euradiolaria varied from 0.01 to 0.36%. Depth levels with maximum abundance of Acantharia were located above maxima of zooplankton and chlorophyll a or coincided with them. As for Euradiolaria, vertical profiles of their biomass were more diverse as compared with Acantharia. The latter group preferred more illuminated depth levels for its maximum development (10-100% of surface irradiance, E0) with respect to Euradiolaria (1-60% of E0). Possible reasons for this difference are discussed.

Heavy metal contents in Fe-Mn nodules and crusts from R/V Vityaz polygons and stations in the East Indian Ocean

Regional variations in abundance, morphology, and chemical composition of Fe-Mn nodules have a zonal character. Due to circumcontinental zonality of terrigenous sedimentation the main mass of the nodules occurs in the pelagic part of the ocean, in areas of minimal sedimentation rates. In spatial variations in morphology and chemical composition of the nodules the latitudinal zonality is very clear and associated with latitudinal changes in facial conditions of sedimentation. Elevated contents of Mn, Ni, and Cu and of Mn/Fe ratio occur in nodules from the radiolarian belt. Changes of chemical composition of the nodules with depth (vertical zonality of mineralization) are confirmed. Local variations in abundance, morphology and chemical composition of the nodules are caused by ruggedness of relief and depth variations, variations in sedimentation rate, age of ore formation, intensity of diagenetic redistribution of metals.

An efficient algorithm for partitioning parameterized polygons into rectangles

In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.

Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.

Asymmetric polygons with maximum area

We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given n diameters of a circle and a positive integer k < n, this paper addresses the problem of computing a maximum area asymmetric k-gon having as vertices k < n endpoints of the given diameters. The study of this type of polygons is motivated by ethnomusiciological applications.

Some results on open-edge and open mobile guarding of polygons and triangulations

This paper focuses on a variation of the Art Gallery problem that considers open-edge guards and open mobile-guards. A mobile guard can be placed on edges and diagonals of a polygon, and the ‘open’ prefix means that the endpoints of such an edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open-edge and open mobile-guards. A wide range of polygons is studied, which include orthogonal polygons with or without holes, spirals, orthogonal spirals and monotone polygons. Moreover, this problem is also considered for planar triangulation graphs using open-edge guards.