Finding the intersection of n half-spaces in time O(n log n) (Q1260355): 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/0304-3975(79)90055-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987647724 / rank | |||
Normal rank | |||
Revision as of 23:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the intersection of n half-spaces in time O(n log n) |
scientific article |
Statements
Finding the intersection of n half-spaces in time O(n log n) (English)
0 references
1979
0 references
finding intersection of half-spaces in time O(n log n)
0 references
interior and vertices of polyhedron
0 references
