An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane (Q1806579): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3772828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3134474 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4295776 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving related two- and three-dimensional linear programming problems in logarithmic time / rank | |||
Normal rank |
Revision as of 09:58, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane |
scientific article |
Statements
An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane (English)
0 references
27 June 2000
0 references
extreme vertices
0 references
moving convex polyhedron
0 references