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.
Notes
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca
