The report suggests a numerical method for constructing Stackelberg trajectories in a linear two-person n-dimensional differential game with special terminal payoffs for players. The game is reduced to a game on the plane and the problem is transformed into a non-standard optimal control problem. For the approximation of the trajectories sets for this problem a set of computational geometry algorithms in plane is used, including convex hull construction, union and intersection of polygons and a Minkowski sum for polygons.