[{"month":"10","abstract":[{"text":"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.","lang":"eng"}],"date_created":"2018-12-11T12:06:33Z","citation":{"mla":"Edelsbrunner, Herbert. *Algebraic Decomposition of Non-Convex Polyhedra*. IEEE, 1995, pp. 248–57.","chicago":"Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra,” 248–57. IEEE, 1995.","ista":"Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. FOCS: Foundations of Computer Science 248–257.","ieee":"H. Edelsbrunner, “Algebraic decomposition of non-convex polyhedra,” presented at the FOCS: Foundations of Computer Science, 1995, pp. 248–257.","ama":"Edelsbrunner H. Algebraic decomposition of non-convex polyhedra. In: IEEE; 1995:248-257.","apa":"Edelsbrunner, H. (1995). Algebraic decomposition of non-convex polyhedra (pp. 248–257). Presented at the FOCS: Foundations of Computer Science, IEEE.","short":"H. Edelsbrunner, in:, IEEE, 1995, pp. 248–257."},"_id":"4034","quality_controlled":0,"title":"Algebraic decomposition of non-convex polyhedra","day":"01","date_updated":"2019-04-26T07:22:39Z","publist_id":"2093","conference":{"name":"FOCS: Foundations of Computer Science"},"page":"248 - 257","publication_status":"published","type":"conference","author":[{"full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"extern":1,"publisher":"IEEE","status":"public","year":"1995","date_published":"1995-10-01T00:00:00Z"}]