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. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(98)00128-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967868261 / rank | |||
Normal rank |
Latest revision as of 10:57, 30 July 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