A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty. (Q2742360)
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 point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty. |
scientific article; zbMATH DE number 1649898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty. |
scientific article; zbMATH DE number 1649898 |
Statements
20 September 2001
0 references
A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty. (English)
0 references
