A computational method for optimizing the shape and location of a polygon on a plane

A computational method for optimizing the shape and location of a polygon on a plane

0.00 Avg rating0 Votes
Article ID: iaor20022442
Country: United Kingdom
Volume: 8
Issue: 5
Start Page Number: 547
End Page Number: 559
Publication Date: Sep 2001
Journal: International Transactions in Operational Research
Authors: ,
Abstract:

This study applies the concept of the Voronoi diagram to a simultaneous search for the optimal shape and location of a polygon. Suppose that an area-like facility is contained in a finite two-dimensional uniform region. The objective of our study is to optimize the shape and location of the facility (polygon) in terms of the mini-sum distance from all the surrounding points. When the mini-sum distance is minimized, the polygon forms a star-shaped polygon at the center, and when maximized, it verges alongside the edge of the region. The results are represented by an approximate value of local optima obtained by replacing the boundary of the polygon with points. We justify the results by examining the difference between the value obtained from a line Voronoi diagram and that generated from points.

Reviews

Required fields are marked *. Your email address will not be published.