A new algorithm for computing the convex hull of a planar point set

When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.

Sequence Boundary:Its Significance in Stratigraphic Subdivision,Correlation and Classification

Sequence boundary is studied in detail in reference to the Permian Guadalupian Lopingian boundary, based on high resolution correlation of conodont zones. A conceptual synchronous stratigraphic boundary, corresponding to the age of the sequence boundary dated in the conformable portion of the sequence boundary, is defined as the sequence chronostratigraphic boundary (SCB). The sequence boundary is proved to be dual in nature in regards to tin-synchrony and diachroneity of stratigraphic boundaries. The merits of the sequence boundary in stratigraphic subdivision, correlation and classification are elucidated in comparison with the lithostratigraphic boundary, the biostratigraphic boundary and the traditional approach of the global stratotype section and point (GSSP ). By integrating the virtues of the sequence boundary and the GSSP, it is proposed that the GSSP should be established in the conformable portion of the related sequence boundary. The boundary established in light of this approach is defined as the best natural boundary. The analysis of the sequence boundary leads to the conclusion that sequence stratigraphy is a regional and transitional stratigraphic system between local lithostratigraphy and global chronostratigraphy. Therefore, a new tripartite stratigraphic classification scheme is tentatively proposed.

A multiscale-contour-based interpolation framework for generating a time-varying quasi-dense point cloud sequence

To speed up the reconstruction of 3D dynamic scenes in an ordinary hardware platform, we propose an efficient framework to reconstruct 3D dynamic objects using a multiscale-contour-based interpolation from multi-view videos. Our framework takes full advantage of spatio-temporal-contour consistency. It exploits the property to interpolate single contours, two neighboring contours which belong to the same model, and two contours which belong to the same view at different times, corresponding to point-, contour-, and model-level interpolations, respectively. The framework formulates the interpolation of two models as point cloud transport rather than non-rigid surface deformation. Our framework speeds up the reconstruction of a dynamic scene while improving the accuracy of point-pairing which is used to perform the interpolation. We obtain a higher frame rate, spatio-temporal-coherence, and a quasi-dense point cloud sequence with color information. Experiments with real data were conducted to test the efficiency of the framework.

On a Class of Uniformly Distributed Sequences of Point Sets

In this note we construct certain sequences of finite point sets in [0, 1) s (s ≥ 1) and give the upper bounds of their discrepancy. Furthermore we prove that these sequences are uniformly distrbuted in [0, 1) s .

Iterative Schemes for a Family of Finite Asymptotically Pseudocontractive Mappings in Banach Spaces

Let E be a real Banach space and K be a nonempty closed convex and bounded subset of E. Let Ti ： K→ K, i=1, 2,... ,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε^（i）n} and asymptotically pseudocontractive mappings with sequences {κ^（i）n}, where {κ^（i）n} and {ε^（i）n}, i = 1, 2,... ,N, satisfy certain mild conditions. Let a sequence {xn} be generated from x1 ∈ K by zn：= （1-μn）xn＋μnT^nnxn, xn＋1 ：= λnθnx1＋ [1 - λn（1 ＋ θn）]xn ＋ λnT^nnzn for all integer n ≥ 1, where Tn = Tn（mod N）, and {λn}, {θn} and {μn} are three real sequences in [0, 1] satisfying appropriate conditions. Then ｜｜xn- Tixn｜｜→ 0 as n→∞ for each l ∈ {1, 2,..., N}. The results presented in this paper generalize and improve the corresponding results of Chidume and Zegeye, Reinermann, Rhoades and Schu.

Ruin Probability and Joint Distributions of Some Actuarial Random Vectors in the Compound Pascal Model

The compound negative binomial model, introduced in this paper, is a discrete time version. We discuss the Markov properties of the surplus process, and study the ruin probability and the joint distributions of actuarial random vectors in this model. By the strong Markov property and the mass function of a defective renewal sequence, we obtain the explicit expressions of the ruin probability, the finite-horizon ruin probability, the joint distributions of T, U（T - 1）, ｜U（T）｜ and inf U（n） （i.e., the time of ruin, the surplus immediately before ruin, the deficit at ruin and maximal deficit from ruin to recovery） and the distributions of some actuarial random vectors.