THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON

Date
1992-03-01
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Computer Science
Citation