Back to Search
Start Over
An exact algorithm for constructing minimum Euclidean skeletons of polygons.
- Source :
- Journal of Global Optimization; May2022, Vol. 83 Issue 1, p137-162, 26p
- Publication Year :
- 2022
-
Abstract
- A Euclidean skeleton is a set of edges in the interior (or on the boundary) of a polygon that intersects any line segment that joins two points outside of the polygon and that intersects the polygon. In this paper we study minimum cardinality Euclidean skeletons and develop an algorithm for constructing them. We first prove a number of structural properties of minimum skeletons and use these to develop a canonical form. We then design an exact algorithm which initially generates a set of canonical skeleton edges, then executes a pruning module to reduce the set of candidate edges, and finally runs existing integer linear programming code to output an optimal solution. Finally, we perform computational testing on our algorithm to demonstrate its performance, and observe a number of experimental properties of minimum skeletons. [ABSTRACT FROM AUTHOR]
- Subjects :
- SKELETON
LINEAR codes
LINEAR programming
INTEGER programming
Subjects
Details
- Language :
- English
- ISSN :
- 09255001
- Volume :
- 83
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Journal of Global Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 156494314
- Full Text :
- https://doi.org/10.1007/s10898-021-01101-3