The content of the intersection
of a simplex with a semispace is computed by means of a dissection technique. An
efficient algorithm, suitable for automatic calculation, is given. For an n-dimensional
space, the algorithm needs only n − 1 storage location at most, and requires ∼ n2
operations.