Planned maintenance: PRISM will be upgraded on Thursday, January 15, 2026 starting at 7:00 p.m. (Mountain Time). The site will be briefly unavailable during this time. We appreciate your patience as we complete this important update to improve performance and ensure continued reliability.

THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON

Thumbnail Image

Files

1992-471-09.pdf (1.06 MB)

Date

1992-03-01

Authors

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

URI

http://hdl.handle.net/1880/46398

Collections

Science Research & Publications

Endorsement

Review

Supplemented By

Referenced By

Powered by

Libraries & Cultural Resources

Start Something.

University of Calgary
2500 University Drive NW
Calgary Alberta T2N 1N4
CANADA

Copyright © 2023

The University of Calgary, located in the heart of Southern Alberta, both acknowledges and pays tribute to the traditional territories of the peoples of Treaty 7, which include the Blackfoot Confederacy (comprised of the Siksika, the Piikani, and the Kainai First Nations), the Tsuut’ina First Nation, and the Stoney Nakoda (including Chiniki, Bearspaw, and Goodstoney First Nations). The City of Calgary is also home to the Métis Nation of Alberta (Districts 5 and 6).

The University of Calgary is situated on land Northwest of where the Bow River meets the Elbow River, a site traditionally known as Moh’kins’tsis to the Blackfoot, Wîchîspa to the Stoney Nakoda, and Guts’ists’i to the Tsuut’ina. On this land and in this place we strive to learn together, walk together, and grow together “in a good way.”