Optimal clustering of a pair of irregular objects
From MaRDI portal
Publication:2018508
Recommendations
- Optimized packing clusters of objects in a rectangular container
- Solution methods of clustering 2D-objects into a circle of the minimal radius
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- \(\Phi\)-functions for complex 2D-objects
- Irregular packing: MILP model based on a polygonal enclosure
Cites work
- scientific article; zbMATH DE number 4168061 (Why is no real title available?)
- A new algorithm for the minimal-area convex enclosure problem
- A new algorithm for the two-polygon containment problem
- A tutorial in irregular shape packing problems
- An improved typology of cutting and packing problems
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Containment of a single polygon using mathematical programming
- Cutting circles and polygons from area-minimizing rectangles
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Irregular packing using the line and arc no-fit polygon
- Mathematical model and efficient algorithms for object packing problem
- Multiple translational containment. II: Exact algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Phi-functions for 2D objects formed by line segments and circular arcs
- Polygon placement under translation and rotation
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Rotational polygon overlap minimization and compaction
- Solution approaches to irregular nesting problems
- The complexity of cutting complexes
- The geometry of nesting problems: a tutorial
- Tools of mathematical modeling of arbitrary object packing problems
- Two approximate Minkowski sum algorithms
Cited in
(15)- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Quasi-phi-functions and optimal packing of ellipses
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Optimized packing clusters of objects in a rectangular container
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Packing convex polygons in minimum-perimeter convex hulls
- Irregular packing problems: a review of mathematical models
- Optimized object packings using quasi-phi-functions
- Packing circles into perimeter-minimizing convex hulls
- Solution methods of clustering 2D-objects into a circle of the minimal radius
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
This page was built for publication: Optimal clustering of a pair of irregular objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018508)
