# A Geometric Approach for Computing the Kernel of a Polyhedron

@article{Sorgente2021AGA, title={A Geometric Approach for Computing the Kernel of a Polyhedron}, author={Tommaso Sorgente and Silvia Biasotti and Michela Spagnuolo}, journal={ArXiv}, year={2021}, volume={abs/2110.11054} }

We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has already been largely addressed in the literature, less has been done for polyhedra. Currently, the principal implementation of the kernel estimation is based on the solution of a linear programming problem. We compare against it on severalâ€¦Â

## Figures and Tables from this paper

## One Citation

Polyhedral Mesh Quality Indicator for the Virtual Element Method

- Computer Science, MathematicsArXiv
- 2021

A significant correlation between the quality measured a priori by the indicator and the effective performance of the VEM is shown, including non convex and skewed threedimensional elements.

## References

SHOWING 1-10 OF 26 REFERENCES

An Optimal Algorithm for Finding the Kernel of a Polygon

- Mathematics, Computer ScienceJACM
- 1979

It is shown that one can exploit the ordering of the half-planes corresponding to the sequence of the polygon's edges to obtain a kernel finding algorithm which runs m time O(n) and is therefore optimal.

Geometric intersection problems

- Computer Science, Mathematics17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
- 1976

An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.

CGAL: the computational geometry algorithms library

- Computer ScienceSIGGRAPH Courses
- 2016

An overview of CGAL geometric algorithms and data structures is provided, including Boolean operations, deformation, skeletonization, segmentation, hole filling, isotropic remeshing, simplification and mesh generation.

Cinolib: A Generic Programming Header Only C++ Library for Processing Polygonal and Polyhedral Meshes

- Computer ScienceTrans. Comput. Sci.
- 2019

Cinolib is a novel header only C++ library for geometry processing that is specifically designed to support a wide set of meshes, such as triangle, quadrilateral and generalpolygonal surface meshes, as well as tetrahedral, hexahedral and general polyhedral volumetric meshes.

Computational geometry: an introduction

- Computer Science, Mathematics
- 1985

This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.

Geometric Algorithms for 3D Interface Reconstruction

- Computer ScienceIMR
- 2007

The numerical optimization method for interface normal computation is presented, and its super-linearly convergence is demonstrated, and actual reconstruction of complex geometry is demonstrated.

TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

- Computer ScienceACM Trans. Math. Softw.
- 2015

The essential algorithms and techniques used to develop TetGen are presented, including an efficient tetrahedral mesh data structure, a set of enhanced local mesh operations, and filtered exact geometric predicates, which can robustly handle arbitrary complex 3D geometries and is fast in practice.

The finite element method for elliptic problems

- Engineering, MathematicsClassics in applied mathematics
- 2002

From the Publisher:
This book is particularly useful to graduate students, researchers, and engineers using finite element methods. The reader should have knowledge of analysis and functionalâ€¦

Basic principles of Virtual Element Methods

- Mathematics
- 2013

We present, on the simplest possible case, what we consider as the very basic features of the (brand new) virtual element method. As the readers will easily recognize, the virtual element methodâ€¦

libigl: prototyping geometry processing research in C++

- Computer ScienceSIGGRAPH ASIA
- 2017

This course will explain the core functionality of libigl, how to piece together complex algorithms from library functions, and how to interface to libigl from Python and MATLAB, and highlight some oflibigl's most powerul features: including mesh booleans, quad remeshing, parameterization, and shape deformation.