Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions


The goal of this paper is to show that the concept of the shortest path inside a polygonal region contributes to the design of eecient algorithms for certain geometric optimization problems involving simple polygons: computing optimum separators, maximum area or perimeter inscribed triangles, a minimum area circumscribed concave quadrilateral, or a maximum… (More)
DOI: 10.1137/0221038