[{"dini_type":"doc-type:conferenceObject","date_updated":"2022-06-13T12:27:11Z","date_created":"2018-12-11T12:06:33Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"publication_status":"published","acknowledgement":"The author thanks Bei-Fang Chen, Siu-Wing Cheng, David Dobkin, Nikolai Dolbilin, Ping Fu, Sergei Ryshkov, and Vadim Shapiro for discussions on the topic of this paper.","creator":{"login":"alisjak","id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},"extern":"1","publist_id":"2093","language":[{}],"conference":{"end_date":"1995-10-25","start_date":"1995-10-23","location":"Milwaukee, WI, United States of America","name":"FOCS: Foundations of Computer Science"},"quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/492480"}],"month":"10","publication_identifier":{"issn":[]},"oa_version":"None","status":"public","_id":"4034","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng"}],"type":"conference","date_published":"1995-10-01T00:00:00Z","page":"248 - 257","publication":"Proceedings of IEEE 36th Annual Foundations of Computer Science","citation":{"apa":"Edelsbrunner, H. (1995). Algebraic decomposition of non-convex polyhedra. In Proceedings of IEEE 36th Annual Foundations of Computer Science (pp. 248–257). Milwaukee, WI, United States of America: IEEE.","ieee":"H. Edelsbrunner, “Algebraic decomposition of non-convex polyhedra,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States of America, 1995, pp. 248–257.","ista":"Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 248–257.","short":"H. Edelsbrunner, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 248–257.","mla":"Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra.” Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 248–57.","chicago":"Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra.” In Proceedings of IEEE 36th Annual Foundations of Computer Science, 248–57. IEEE, 1995."},"day":"01","uri_base":"https://research-explorer.ista.ac.at","article_processing_charge":"No","dc":{"description":["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."],"identifier":["https://research-explorer.ista.ac.at/record/4034"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text","http://purl.org/coar/resource_type/c_5794"],"creator":["Edelsbrunner, Herbert"],"title":["Algebraic decomposition of non-convex polyhedra"],"relation":["info:eu-repo/semantics/altIdentifier/issn/0272-5428"],"publisher":["IEEE"],"rights":["info:eu-repo/semantics/closedAccess"],"source":["Edelsbrunner H. Algebraic decomposition of non-convex polyhedra. In: Proceedings of IEEE 36th Annual Foundations of Computer Science. IEEE; 1995:248-257."],"language":["eng"],"date":["1995"]}}]