Layer-based decompositions of polyhedra

This work describes a decomposition scheme for polyhedra called Layer-based decomposition. This decomposition can be computed in a efficient way for any kind of polyhedron, and has interesting applications in several geometric problems, like Boolean operation computation, point-in-polyhedron inclusion test, 3D location and rayscene intersection computation