Finding all vertices of a convex polyhedron (Q2530169): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3266142 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3285991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Number of Vertices of a Convex Polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817857 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Vertices of a Polyhedron / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:28, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding all vertices of a convex polyhedron |
scientific article |
Statements
Finding all vertices of a convex polyhedron (English)
0 references
1968
0 references
numerical analysis
0 references