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.
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. 9. The polyhedron algorithmic method of claim 8 , wherein further improvements include the polyhedron algorithm's representation on a planar surface of a computer's monitor screen, that portrays an image of a map, to establish the planar polygon base of the polyhedron by having the Invoke facility service builder use a curser to select the points of the polygon, and providing the third dimension convergence point and the third dimension frustum point by specifying values in a suitable metric; or establishing the polygon base by means of an apparatus with GPS communication and a memory to record a GPS position by depressing a button on the apparatus to store the apparatus' GPS position, and providing the third dimension convergence point and the third dimension frustum point by specifying values in a suitable metric; whereby the Compound Wireless Services interactive graphical compiler forms a closed set of planes having straight line boundaries, that is geographically congruent to the volume consisting of GPS coordinates, including the specified third dimension convergence point and the third dimension frustum point.