Capturing realistic 3D shapes of human bodies is very useful for many computer graphics applications. However, for existing 3D shape capturing devices, such as structured light, laser scanner or multi-view methods, problems arise when dealing with 3D hairstyle scanning and body deformation. To solve these problems, a novel approach is proposed to scan 3D body with hairstyle using only one time-...

In this paper, the Lie group analysis method is applied to the geometric average Asian option pricing equation in financial problems. Firstly, the complete Lie symmetry group and infinitesimal generators of this equation are derived. Then the optimal system with one parameter for the Lie symmetry algebra are obtained, which gives the possibility to describe a complete set of invariant solutions...

Discrete geometric estimators aim at estimating geometric characteristics of a shape with only its digitization as input data. Such an estimator is multigrid convergent when its estimates tend toward the geometric characteristics of the shape as the digitization step h tends toward 0. This paper studies the multigrid convergence of tangent estimators based on maximal digital straight segment re...

In this paper we approach the analysis of statistics algorithms from a geometric viewpoint and use techniques from computational geometry to develop new, fast algorithms for computing familiar statistical quantities. Such fundamental procedures as sorting and selection play an important role in nonparametric estimation as well as in correlation and regression and we use known results to obtain ...

Discrete geometric estimators aim at estimating geometric characteristics of a shape with only its digitization as input data. Such an estimator is multigrid convergent when its estimates tend toward the geometric characteristics of the shape as the digitization step h tends toward 0. This paper studies the multigrid convergence of tangent estimators based on maximal digital straight segment re...

In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less than the average degree in the hypergraph, with equality only if the hypergraph is regular. Here, we prove a wider class of inequalities in a ...

For words of length n, generated by independent geometric random variables , we consider the average value and the average position of the rth left–to–right maximum counted from the right, for fixed r and n → ∞. This complements previous research [5] where the analogous questions were considered for the rth left–to–right maximum counted from the left.