Solving related two- and three-dimensional linear programming problems in logarithmic time
From MaRDI portal
Publication:1091934
DOI10.1016/0304-3975(87)90101-0zbMath0623.90049OpenAlexW2043237616MaRDI QIDQ1091934
Kenneth L. Clarkson, Jorge Stolfi, Leonidas J. Guibas
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90101-0
Related Items
Collision detection algorithm of a continuous type using spherical extreme vertex diagrams ⋮ An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane ⋮ Linear algorithm to find the largest intriangles of a planar convex polygon
Cites Work