Pages that link to "Item:Q1969864"

The following pages link to Algorithms for the decomposition of a polygon into convex polygons (Q1969864):

Displaying 7 items.

• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
• A continuous location model for siting a non-noxious undesirable facility within a geographical region (Q1969855) (← links)
• A virtual element method for transversely isotropic hyperelasticity (Q2246310) (← links)
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts (Q6087527) (← links)
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects (Q6106774) (← links)
• Voronoi-based splinegon decomposition and shortest-path tree computation (Q6563938) (← links)