Back to search

University of Minnesota

Optimization Methods in Geometric Shape Approximation

Abstract

dc:description.abstract

This thesis studies the application of optimization methods in approximating geometric shapes. In particular, it considers the problem of finding maximum volume (axis-aligned) inscribed parallelotopes and boxes in a compact convex set, defined by a finite number of convex inequalities, and presents an optimization approach for solving them. Several optimization models are developed that can be easily generalized to find other inscribed geometric shapes such as triangles, rhombi, and tetrahedrons. To find the largest axis-aligned inscribed rectangles in the higher dimensions, an interior-point method algorithm is presented and analyzed. Finally, a parametrized optimization approach is developed to find the largest (axis-aligned) inscribed rectangles in the two-dimensional space.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Behroozi, Mehdi

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Citation
Behroozi, Mehdi. (2021). Optimization Methods in Geometric Shape Approximation. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/224906.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Behroozi, Mehdi. Optimization Methods in Geometric Shape Approximation. 2021. https://hdl.handle.net/11299/224906