Algebraic decomposition of non-convex polyhedra
Edelsbrunner, Herbert
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.
IEEE
1995
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
http://purl.org/coar/resource_type/c_5794
https://research-explorer.ista.ac.at/record/4034
Edelsbrunner H. Algebraic decomposition of non-convex polyhedra. In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. IEEE; 1995:248-257.
eng
info:eu-repo/semantics/altIdentifier/issn/0272-5428
info:eu-repo/semantics/closedAccess