Asiler, MerveSahillioglu, YusufHu, RuizhenLefebvre, Sylvain2024-06-202024-06-2020241467-8659https://doi.org/10.1111/cgf.15137https://diglib.eg.org/handle/10.1111/cgf15137We compute the kernel of a shape embedded in 3D as a polygon mesh, which is defined as the set of all points that have a clear line of sight to every point of the mesh. The KerGen algorithm, short for Kernel Generation, employs efficient plane-plane and line-plane intersections, alongside point classifications based on their positions relative to planes. This approach allows for the incremental addition of kernel vertices and edges to the resulting set in a simple and systematic way. The output is a polygon mesh that represents the surface of the kernel. Extensive comparisons with the existing methods, CGAL and Polyhedron Kernel, demonstrate the remarkable timing performance of our novel additive kernel computation method. Yet another advantage of our additive process is the availability of the partial kernel at any stage, making it useful for specific geometry processing applications such as star decomposition and castable shape reconstruction.CCS Concepts: Computing methodologies → Mesh geometry modelsComputing methodologies → Mesh geometry models10.1111/cgf.1513713 pages