Back to results

Rice University

Edge length minimizing polyhedra

Abstract

dc:description.abstract

This thesis investigates two different edge length minimization problems on convex polyhedra: first, minimizing edge length for fixed volume (Melzak's Problem), and second, minimizing edge length for fixed surface area (Aberth's Problem). Specific examples are given that demonstrate the necessity of restricting the problems to convex polyhedra. The right regular 3-prism of height 1 relative to base edge 1 is shown to minimize Melzak's Problem over several families of polyhedra, including Platonic solids, regular pyramids, and general prisms. For Aberth's Problem, the right regular 3-prism of height 2-13 relative to base edge 1 is shown to minimize over the same families. The minimizer of Aberth's Problem cannot have all equal-area faces; similarly, for Melzak's Problem, the minimizer cannot be an equal-faced polyhedron with 10 or more faces. For the minimizing object in both Aberth's Problem and Melzak's Problem, the area of the kth face must be of the order 1/k 2. The minimizer for Melzak's Problem must exist in a more general class which includes infinite-faced objects. Examples are presented of infinite-faced objects that have finite edge length. Although the minimizer might have an infinite number of faces, the edge skeleton of such a minimizer is proved to consist almost entirely of line segments, which means that the bad points of the edging contribute nothing to the total length of the edge skeleton. Specifically, an edge point is called bad if the local edge set is not a line segment. For a minimizing convex object, the 1-dimensional Hausdorff measure of the set of bad edge points is zero. As a corollary, the edge set of the minimizer for Melzak's Problem does not contain any smooth non-linear arcs.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy
Level thesis:degree_level
Doctoral
Discipline thesis:degree_discipline
Natural Sciences
Grantor
Rice University
Year dc:date.issued
2002

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Berger, Scott Byron
Advisor dc:contributor.advisor
  • Hardt, Robert M.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1911/18063
OAI identifier oai:identifier
oai:repository.rice.edu:1911/18063

Chain of custody

source
Harvested from
Rice University
Base URL
repository.rice.edu/server/oai/request
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
related terms
citation

Berger, Scott Byron. Edge length minimizing polyhedra. Doctoral thesis, Rice University, 2002. https://hdl.handle.net/1911/18063