THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON

Rokne, J.Wang, S.Z.Wu, X.2008-05-082008-05-081992-03-01http://hdl.handle.net/1880/46398Given 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.EngComputer ScienceTHE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRONunknown1992-471-0910.11575/PRISM/30979