Please use this identifier to cite or link to this item:
http://hdl.handle.net/1880/46398| Title: | THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON |
| Authors: | Rokne, J. Wang, S.Z. Wu, X. |
| Keywords: | Computer Science |
| Issue Date: | 1-Mar-1992 |
| 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. |
| URI: | http://hdl.handle.net/1880/46398 |
| Appears in Collections: | Rokne, Jon |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 1992-471-09.pdf | 1.09 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.