It is at times important to detect human presence automatically in secure environments. This needs a shape recognition algorithm that is robust, fast and has low error rates. The algorithm needs to process camera images quickly to detect any human in the range of vision, and generate alerts, especially if the object under scrutiny is moving in certain directions. We present here a simple, effic...

An iterative algorithm for decomposing an integer composite number C into prime factors X1 and X2 is proposed in which the properties of Vieta’s theorem are used reduced quadratic equations X2+B·X·C = 0, when first approximation computation taken equal to square root C, then С, B rounded up a larger from that is, C. In this case, calculations carried out by linearly increasing approximations one.

Given a set of n points P in the plane, the first layer L1 of P is formed by the points that appear on P ’s convex hull. In general, a point belongs to layer Li, if it lies on the convex hull of the set P \ ⋃ j<i{Lj}. The convex layers problem is to compute the convex layers Li. Existing algorithms for this problem either do not achieve the optimal O (n log n) runtime and linear space, or are o...

In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...

The problem of finding the dominators in a control-flow graph has a long history in the literature. The original algorithms suffered from a large asymptotic complexity but were easy to understand. Subsequent work improved the time bound, but generally sacrificed both simplicity and ease of implementation. This paper returns to a simple formulation of dominance as a global data-flow problem. Som...