Herbert Edelsbrunner
Herbert
Edelsbrunner0000-0002-9823-6833
Algebraic decomposition of non-convex polyhedra
IEEE
1995
2018-12-11T12:06:33Z
2019-04-26T07:22:39Z
conference
https://research-explorer.app.ist.ac.at/record/4034
https://research-explorer.app.ist.ac.at/record/4034.json
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.