Rotational polygon overlap minimization and compaction
From MaRDI portal
Publication:1265289
DOI10.1016/S0925-7721(98)00012-1zbMath0904.68174MaRDI QIDQ1265289
Publication date: 28 September 1998
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
New perspectives in VLSI design automation: deterministic packing by sequence pair ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Optimal clustering of a pair of irregular objects ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial solution for the Potato-peeling problem
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Multiple translational containment. II: Exact algorithms
- Largest placement of one convex polygon inside another
- Computing the intersection-depth to polyhedra
- A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
