On a general method for maximizing and minimizing among certain geometric problems
- 1 October 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Problems concerned with finding inscribing or circumscribing polygons that maximize some measurement are considered such as: Find an area maximizing triangle inscribed in a given convex polygon. Algorithms solving a number of these problems in linear time are presented. They use the common approach of finding an initial solution with respect to a fixed bounding point and then iteratively transforming this solution into a new solution with respect to a new point. The generality of this approach is discussed and several open problems are noted.Keywords
This publication has 4 references indexed in Scilit:
- Decomposing a polygon into its convex partsPublished by Association for Computing Machinery (ACM) ,1979
- On triangulations of a set of points in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972