A Geometric Approach for Computing the Kernel of a Polyhedron

We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simplykernel) is defined as the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel fora polygon has already been largely addressed in the literature, less has been done for polyhedra. Currently, the principalimplementation of the kernel estimation is based on the solution of a linear programming problem. We compare against it onseveral examples, showing that our method is more efficient in analysing the elements of a generic tessellation. Details on thetechnical implementation and discussions on pros and cons of the method are also provided.