Please use this identifier to cite or link to this item:
|Title:||THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON|
|Abstract:||Given a polyhedron with n vertices, we present an algorithm for finding the maximum tetrahedron rooted on a face of the polyhedron in O(n log n) time. For the result we need to discuss a class of reciprocal search problems.|
|Appears in Collections:||Rokne, Jon |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.