5. The process extension of claim 4 , wherein a further enhancement constructs a frustum of the polyhedron configuration, created by identifying two points in the third dimension, both of which are aligned above or below the plane of the base planar polygon; whereby straight lines, extending from each corner point of the base polygon to the more distant third dimension point, are paired at the base polygon adjacent corner points to define triangular planes, with the planes all converging at the more distant third dimension point; where the third dimension point, closer the base polygon, is the frustum point which identifies the location of plane, to be placed parallel to the base polygon, to form a parallel polygon boundary, with corner points formed by the lines subtended from the base polygon points to the convergent third dimension point, resulting in a polyhedron bounded by a polygon base, a polygon parallel the polygon base, and the portions of the triangular planes in the form of quadrilaterals that interconnect the base polygon to the parallel polygon; with an event occurrence of either the wireless mobile terminal being outside the volume's boundary or the contradiction of not being outside the volume's boundary.
8. The process extension of claim 5 , wherein the algorithmic method refinement utilizes a polygon in prescribing a volume by deploying an n-tuple of successive points, ((x 1 , y 1 ), (x 2 , y 2 ), (x 3 , y 3 ), . . . , (x n , y n ),(x c , y c z c , z f )), that the Compound Wireless Services interactive graphical compiler will regard to represent the points for a polyhedron; consisting of a polygon base, for which the height is zero (i.e., z i =0) and are oriented according to their entry sequence of the presented points; for which the quadruple (x c , y c , z c , z f ) provides x, y, z coordinates for the third dimension edge convergence point (z c ) and the third dimension frustum plane point (z f ); for which z c =z f is assigned, when the volume is not to be a polyhedron frustum; where positive values for z c , z f indicate the points are above the polygon plane or negative values for z c , z f indicate the points are below the polygon plane; requiring that z c , z f have the same sign; where the polyhedron construction algorithm performs the following steps: a) define a polygon by the n-tuple ((x 1 , y 1 ), (x 2 , y 2 ), (x 3 , y 3 ), . . . , (x n , y n )); b) locate the reflection of the convergence point in the polygon's plane (x c , y c ); c) locate the third dimension convergence point (x c , y c , z c ) according to its reflection position; d) subtend the “n” straight lines between each point of the polygon base and the convergence point; e) if z c =z f , then stop here; f) otherwise, provide the third dimension frustum point (x c , y c , z f ); g) pass a plane parallel to the base polygon through the frustum point (x c , y c , z f ); h) establish the “n” frustum plane points from the “n” intersecting lines subtended between the points of the base polygon and the third dimension edge convergence point (z c ) to a distance of z f from the base plane.