DECOPOL -- Codes for decomposing a polygon into convex subpolygons
From MaRDI portal
Publication:1291595
DOI10.1016/S0377-2217(97)00225-7zbMath0948.90153MaRDI QIDQ1291595
José Fernández, Blas Pelegrín, Lázaro Cánovas
Publication date: 21 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (3)
A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ Algorithms for the decomposition of a polygon into convex polygons ⋮ A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Cites Work
This page was built for publication: DECOPOL -- Codes for decomposing a polygon into convex subpolygons
