Layer-based decomposition of solids and its applications
In this work we describe a decomposition scheme for polyhedra called layer-based decomposition. This decomposition can be computed in a straightforward way for any kind of polyhedron: convex or nonconvex, genus 0 or higher, etc. and presents interesting properties and applications like point-in-polyhedron inclusion test, computation of Boolean operations, or 3D location. Two methods for computing this decomposition and several of its applications are described in detail, including experimental results and comparisons with alternative approaches.
3d decompositions solid modeling geometric algorithms