THE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRON

Simple item page
dc.contributor.authorRokne, J.eng
dc.contributor.authorWang, S.Z.eng
dc.contributor.authorWu, X.eng
dc.date.accessioned2008-05-08T18:37:44Z
dc.date.available2008-05-08T18:37:44Z
dc.date.computerscience1999-05-27eng
dc.date.issued1992-03-01eng
dc.description.abstractGiven 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.eng
dc.description.notesWe 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.caeng
dc.identifier.department1992-471-09eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30979
dc.identifier.urihttp://hdl.handle.net/1880/46398
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleTHE LARGEST VOLUME INSCRIBED ROOTED TETRAHEDRON IN A CONVEX POLYHEDRONeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1992-471-09.pdf
Size:
1.06 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications