Abstract: A system is described in which a local task (415) running on a local computer (400) can use a remote task (430) running on a remote computer (405). The local task (415) firstly establishes a conversation between a local data transmission agent (410) in the local computer (400) and a remote data transmission agent (420) in the remote computer (405). This conversation is assigned a handle (XmitHandle). The local task (415) can then use this handle (XmitHandle) to call tasks (430) running on the remote computer (405). Data is passed between the local task (415) and the local data transmission agent (410) by the use of a shared memory buffer. Data is similarly passed between the remote, task (430) and the remote data transmission agent (420) by the use of a shared memory buffer. The local (410) and remote (420) data transmission agent are connected together in a network which is preferably an SNA network.

Abstract: Processes for efficiently determining the subset of points, included in a given ordered set of points, that lie at a minimum distance from an arbitrarily specified point in a given coordinate system (for a modelling system, computer graphic system, and the like), operating under the control of, or with the assistance of, a digital computer. The novel processes are operative to transform a first set of signals representing the arbitrarily specified point and the given ordered set of points (in the given coordinate system), into a second set of signals identifying the subset of points, belonging to the ordered set of points, which are located at a minimum distance from the specified point, utilizing bounding box techniques. Such techniques facilitate obtaining a solution to the minimum distance determination problem without always having to determine the distance between all of the points in the given, ordered set of points, and the arbitrarily specified point, as required by the prior art.