Finding the intersection of n half-spaces in time O(n log n) (Q1260355): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5589748 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the intersection of two convex polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4225312 / rank | |||
Normal rank | |||
Latest revision as of 01:48, 13 June 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
