TY - CONF
AB - Any arbitrary polyhedron P contained as a subset within Rd can be written as algebraic sum of simple terms, each an integer multiple of the intersection of d or fewer half-spaces defined by facets of P. P can be non-convex and can have holes of any kind. Among the consequences of this result are a short boolean formula for P, a fast parallel algorithm for point classification, and a new proof of the Gram-Sommerville angle relation.
AU - Edelsbrunner, Herbert
ID - 4034
SN - 0272-5428
T2 - Proceedings of IEEE 36th Annual Foundations of Computer Science
TI - Algebraic decomposition of non-convex polyhedra
ER -