Presented by Prof. Or. Gy. STROMMER Summary

A computer program is presented for determining the polygon of intersection of two convex polyhedra. The algorithm is based upon the trivial construction and uses O(N 2) operations. where N is the sum of the numbers of edges of the two polyhedra. The program is written in Basic for the personal computer Commodore 64. Finding the intersection of two convex polyhedra in three-dimensional space is a classical problem in computational geometry, and so far a few algorithms have been published already for the solution. In this paper a computer program is presented for determining the polygon of intersection and illustrating the solution. Let A and B be two convex polyhedra in three-dimensional space. We assume that the coordinates of the vertices are given in Descartes coordinate-system, moreover, the system of the edges of both polyhedra are given, as well [1]. Denote El (A), E 2 (A),..., ENA(A) the edges of the polyhedron A and El (B), E2 (B),..., ENB(B) the edges of the polyhedron B, respectively. In order to find the vertices of the polygon of intersection the edges Ei(A), i = 1,..., N A have t