A SOLUTION FOR THE INTERSECTION OF TWO CONVEX POLYHEDRA

Authors

  • M. SZILVÁSI-NAGY

Abstract

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(N2) 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.

How to Cite

SZILVÁSI-NAGY, M. “A SOLUTION FOR THE INTERSECTION OF TWO CONVEX POLYHEDRA ”, Periodica Polytechnica Mechanical Engineering, 30(2), pp. 273–275, 1986.

Issue

Vol. 30 No. 2 (1986)

Section

Articles