On Solving Geometric Optimization Problems Using Shortest Paths


We have developed techniques which contribute to efficient algorithms for certain geometric optimization problems involving simple polygons: computing minimum separators, maximum inscribed triangles, a minimum circumscribed concave quadrilateral, or a maximum contained triangle. The structure for our algorithms is as follows: a) decompose the initial… (More)
DOI: 10.1145/98524.98600


10 Figures and Tables