The projection median of a finite set of points in R was introduced by Durocher and Kirkpatrick [Computational Geometry: Theory and Applications, Vol. 42 (5), 364–375, 2009]. They proved that the projection median in R provides a better approximation of the 2-dimensional Euclidean median, than the center of mass or the rectilinear median, while maintaining a fixed degree of stability. In this p...

ABSTRAC: -This research aims at the extraction of geometric features from Urdu ligatures. Though structural features are robust, its extraction and analysis is exceptionally complex and time-consuming task. The extraction and analysis is uncomplicated in case of the geometric features. Geometric features are language, script and font independent. There are twelve significant geometric features ...

I provide a historic review of the forward and backward projection pursuit algorithms, previously thought to be equivalent, and point out an important difference between the two. In doing so, I correct a small error in the original exploratory projection pursuit paper (Friedman 1987). The implication of the difference is briefly discussed in the context of an application in which projection pur...

This paper describes a computational framework for constructing point clouds using digital projection patterns. The basic principle behind the approach is to project known patterns on the object using a digital projector. A digital camera is then used to take images of the object with the known projection patterns imposed on it. Due to the presence of 3-D faces of the object, the projection pat...

This paper proposes a geometric iteration algorithm for computing point projection and inversion on planar parametric curves based on local biarc approximation. The iteration begins with initial estimation of the projection of the prescribed test point. For each iteration, we construct a biarc that locally approximates a segment on the original curve starting from the current projective point. ...

The classical theorem of general projection for surfaces says that a general projection in P of a smooth complex projective surface S of P is a surface F with ordinary singularities i.e. its singular locus is either empty or is a curve γ such that (i) γ is either non singular or has at most a finite number of ordinary triple points; (ii) every smooth point of γ is either a nodal point or a pinc...

We show that the parallel projection method with variable weights and one variable relaxation coefficient for obtaining a point in the intersection of a finite number of closed convex sets in a given Hubert space may be interpreted as a semi-alternating sequential projection method in a suitably newly constructed Hubert space. As such, convergence results for the parallel projection method may ...

Every population game defines a vector field on the set of strategy distributions X. The projection dynamic maps each population game to a new vector field: namely, the one closest to the payoff vector field among those that never point outward from X. We investigate the geometric underpinnings of the projection dynamic, describe its basic game-theoretic properties, and establish a number of cl...

This paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the socalled Newton–...

The warping degree of an oriented knot diagram is the minimal number crossings which we meet as under-crossing first when travel along from a fixed point. projection value for all alternating diagrams obtained projection. In this paper, consider maximal regions share no with crossing, and give lower bounds degree.