A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (Q789728)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form |
scientific article; zbMATH DE number 3846348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form |
scientific article; zbMATH DE number 3846348 |
Statements
A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (English)
0 references
1983
0 references
The authors describe an algorithm based on the well known sweep-plane technique [\textit{H. Hadwiger}, J. Reine Angew. Math. 194, 101-110 (1955; Zbl 0064.166)] for computing the volume of finite dimensional bounded polyhedra. The computer program of the algorithm is given in APL. They also record computational experience on three problems.
0 references
Konvexring
0 references
Euler characteristic
0 references
simplices
0 references
regular vertices
0 references
0.7968190908432007
0 references
0.788476824760437
0 references
0.7835066914558411
0 references
