Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90101-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043237616 / rank | |||
Normal rank | |||
Revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving related two- and three-dimensional linear programming problems in logarithmic time |
scientific article |
Statements
Solving related two- and three-dimensional linear programming problems in logarithmic time (English)
0 references
1987
0 references
Given n linear inequalities in three variables, we show how to construct a corresponding spherical subdivision using great circle arcs in time O(n log n) and space O(n). This subdivision in turn allows us to compute the point in space satisfying all inequalities and maximizing any desired linear objective function in time O(log n).
0 references
linear inequalities
0 references
spherical subdivision
0 references
