---
res:
bibo_abstract:
- 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Edelsbrunner, Herbert
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
dct_date: 1995^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0272-5428
dct_language: eng
dct_publisher: IEEE@
dct_title: Algebraic decomposition of non-convex polyhedra@
...