A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (Q789728): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(83)80008-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080937655 / rank | |||
Normal rank | |||
Revision as of 23:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form |
scientific article |
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
