DECOPOL -- Codes for decomposing a polygon into convex subpolygons

DOI10.1016/S0377-2217(97)00225-7MaRDI QIDQ1291595zbMATH OpenFDO

Authors José Fernández, B. Pelegrin, Lázaro Cánovas

Publication date 21 November 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsapproximation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(3)

• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
• 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

This page was built for publication: DECOPOL -- Codes for decomposing a polygon into convex subpolygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291595)