Orthogonal Polyhedra offer a worthy-to-explore simplification. In this work we propose a specific model for representing
orthogonal polyhedra that allows simple and robust algorithms for performing the most usual and demanding tasks, such
as closed and regularized boolean operations; solid splitting and other set membership classification operations; and so on.
These algorithms have much lower complexities than their counterparts for general objects have, and they also avoid
floating-point computations.Postprint (published version
