Algorithms for the decomposition of a polygon into convex polygons

DOI10.1016/S0377-2217(99)00033-8zbMath0973.90058OpenAlexW2053866918MaRDI QIDQ1969864

Blas Pelegrín, Lázaro Cánovas, José Fernández

Publication date: 5 December 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00033-8

zbMATH Keywords

approximationfacility locationpolygon decomposition

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ A virtual element method for transversely isotropic hyperelasticity ⋮ A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

Cites Work

• Triangulating a simple polygon in linear time
• DECOPOL -- Codes for decomposing a polygon into convex subpolygons
• The concept of state in discrete dynamic programming
• COMPUTATIONAL GEOMETRY COLUMN 29
• Decomposing a Polygon into Simpler Components
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Decomposition of Polygons into Convex Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for the decomposition of a polygon into convex polygons